./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 2329fc70
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i -s /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e73fa4cb5d730df9ff96f4b4e2c24e965bcd61c0183b81fcc825ea7b25063723
--- Real Ultimate output ---
This is Ultimate 0.2.2-dev-2329fc7
[2024-03-09 03:42:06,033 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2024-03-09 03:42:06,035 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2024-03-09 03:42:06,056 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2024-03-09 03:42:06,056 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2024-03-09 03:42:06,057 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2024-03-09 03:42:06,058 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2024-03-09 03:42:06,059 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2024-03-09 03:42:06,060 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2024-03-09 03:42:06,061 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2024-03-09 03:42:06,061 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2024-03-09 03:42:06,062 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2024-03-09 03:42:06,062 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2024-03-09 03:42:06,063 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2024-03-09 03:42:06,064 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2024-03-09 03:42:06,064 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2024-03-09 03:42:06,065 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2024-03-09 03:42:06,066 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2024-03-09 03:42:06,067 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2024-03-09 03:42:06,068 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2024-03-09 03:42:06,069 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2024-03-09 03:42:06,070 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2024-03-09 03:42:06,071 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2024-03-09 03:42:06,071 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2024-03-09 03:42:06,074 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2024-03-09 03:42:06,074 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2024-03-09 03:42:06,074 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2024-03-09 03:42:06,075 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2024-03-09 03:42:06,075 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2024-03-09 03:42:06,076 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2024-03-09 03:42:06,076 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2024-03-09 03:42:06,076 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2024-03-09 03:42:06,077 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2024-03-09 03:42:06,077 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2024-03-09 03:42:06,078 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2024-03-09 03:42:06,078 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2024-03-09 03:42:06,078 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2024-03-09 03:42:06,079 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2024-03-09 03:42:06,079 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2024-03-09 03:42:06,079 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2024-03-09 03:42:06,080 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2024-03-09 03:42:06,080 INFO  L101        SettingsManager]: Beginning loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-09 03:42:06,096 INFO  L113        SettingsManager]: Loading preferences was successful
[2024-03-09 03:42:06,099 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-09 03:42:06,099 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-09 03:42:06,099 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-09 03:42:06,100 INFO  L136        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-09 03:42:06,100 INFO  L138        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-09 03:42:06,100 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-09 03:42:06,100 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * Use SBE=true
[2024-03-09 03:42:06,101 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * sizeof long=4
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-09 03:42:06,101 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * sizeof long double=12
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2024-03-09 03:42:06,102 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-09 03:42:06,103 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:42:06,103 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2024-03-09 03:42:06,103 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC
[2024-03-09 03:42:06,104 INFO  L138        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e73fa4cb5d730df9ff96f4b4e2c24e965bcd61c0183b81fcc825ea7b25063723
[2024-03-09 03:42:06,266 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-09 03:42:06,295 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-09 03:42:06,297 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-09 03:42:06,298 INFO  L271        PluginConnector]: Initializing CDTParser...
[2024-03-09 03:42:06,299 INFO  L275        PluginConnector]: CDTParser initialized
[2024-03-09 03:42:06,300 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-09 03:42:07,386 INFO  L500              CDTParser]: Created temporary CDT project at NULL
[2024-03-09 03:42:07,569 INFO  L351              CDTParser]: Found 1 translation units.
[2024-03-09 03:42:07,570 INFO  L172              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-09 03:42:07,580 INFO  L394              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/71e0d26f7/e37159ac0f90419b84ae28d94faaec27/FLAG01998db25
[2024-03-09 03:42:07,591 INFO  L402              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/data/71e0d26f7/e37159ac0f90419b84ae28d94faaec27
[2024-03-09 03:42:07,593 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-09 03:42:07,594 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-09 03:42:07,595 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-09 03:42:07,595 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-09 03:42:07,598 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-09 03:42:07,598 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:07,599 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45627bcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07, skipping insertion in model container
[2024-03-09 03:42:07,599 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:07,604 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2024-03-09 03:42:07,633 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2024-03-09 03:42:07,746 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:42:07,863 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:42:07,869 INFO  L203         MainTranslator]: Completed pre-run
[2024-03-09 03:42:07,880 WARN  L611        FunctionHandler]: implicit declaration of function __builtin_bswap16
[2024-03-09 03:42:07,904 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2024-03-09 03:42:07,980 INFO  L208         MainTranslator]: Completed translation
[2024-03-09 03:42:07,980 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07 WrapperNode
[2024-03-09 03:42:07,980 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-09 03:42:07,981 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-09 03:42:07,981 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-09 03:42:07,981 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-09 03:42:07,986 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,001 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,018 INFO  L138                Inliner]: procedures = 266, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78
[2024-03-09 03:42:08,019 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-09 03:42:08,019 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-09 03:42:08,019 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-09 03:42:08,019 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2024-03-09 03:42:08,026 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,026 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,030 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,030 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,036 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,039 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,040 INFO  L185        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,041 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,044 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-09 03:42:08,044 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-09 03:42:08,044 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2024-03-09 03:42:08,045 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2024-03-09 03:42:08,045 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (1/1) ...
[2024-03-09 03:42:08,050 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2024-03-09 03:42:08,058 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:08,068 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null)
[2024-03-09 03:42:08,099 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process
[2024-03-09 03:42:08,132 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-09 03:42:08,132 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-09 03:42:08,132 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-09 03:42:08,132 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-09 03:42:08,133 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-09 03:42:08,133 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-09 03:42:08,133 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-09 03:42:08,133 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-09 03:42:08,133 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-09 03:42:08,133 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-09 03:42:08,134 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-09 03:42:08,135 WARN  L209             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement
[2024-03-09 03:42:08,264 INFO  L235             CfgBuilder]: Building ICFG
[2024-03-09 03:42:08,265 INFO  L261             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-09 03:42:08,417 INFO  L276             CfgBuilder]: Performing block encoding
[2024-03-09 03:42:08,424 INFO  L295             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-09 03:42:08,424 INFO  L300             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-09 03:42:08,425 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:42:08 BoogieIcfgContainer
[2024-03-09 03:42:08,426 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-09 03:42:08,427 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-09 03:42:08,427 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2024-03-09 03:42:08,429 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2024-03-09 03:42:08,430 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 03:42:07" (1/3) ...
[2024-03-09 03:42:08,430 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c27c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:42:08, skipping insertion in model container
[2024-03-09 03:42:08,430 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 03:42:07" (2/3) ...
[2024-03-09 03:42:08,431 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392c27c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 03:42:08, skipping insertion in model container
[2024-03-09 03:42:08,431 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.03 03:42:08" (3/3) ...
[2024-03-09 03:42:08,432 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2024-03-09 03:42:08,438 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-09 03:42:08,445 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-09 03:42:08,445 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-09 03:42:08,445 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-09 03:42:08,483 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-09 03:42:08,511 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,554 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2024-03-09 03:42:08,554 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:42:08,558 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-09 03:42:08,558 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,561 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,564 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:42:08,571 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,573 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,574 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 214 flow
[2024-03-09 03:42:08,603 INFO  L130       PetriNetUnfolder]: 6/150 cut-off events.
[2024-03-09 03:42:08,604 INFO  L131       PetriNetUnfolder]: For 1/1 co-relation queries the response was YES.
[2024-03-09 03:42:08,604 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 156 conditions, 150 events. 6/150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-09 03:42:08,605 INFO  L119        LiptonReduction]: Number of co-enabled transitions 1620
[2024-03-09 03:42:10,468 INFO  L134        LiptonReduction]: Checked pairs total: 7037
[2024-03-09 03:42:10,469 INFO  L136        LiptonReduction]: Total number of compositions: 70
[2024-03-09 03:42:10,480 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:42:10,485 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f79657, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:42:10,485 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-09 03:42:10,489 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2024-03-09 03:42:10,489 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:42:10,489 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:10,490 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:10,490 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:42:10,493 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:10,493 INFO  L85        PathProgramCache]: Analyzing trace with hash -2131258833, now seen corresponding path program 1 times
[2024-03-09 03:42:10,500 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:10,500 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170978196]
[2024-03-09 03:42:10,500 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:10,501 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:10,590 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:10,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:10,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:10,880 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170978196]
[2024-03-09 03:42:10,881 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170978196] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:10,881 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:10,881 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:10,882 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090546132]
[2024-03-09 03:42:10,883 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:10,888 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:10,888 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:10,901 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:10,908 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:11,096 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173
[2024-03-09 03:42:11,099 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 43 transitions, 94 flow. Second operand  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,099 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:11,099 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173
[2024-03-09 03:42:11,100 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:11,280 INFO  L130       PetriNetUnfolder]: 181/536 cut-off events.
[2024-03-09 03:42:11,280 INFO  L131       PetriNetUnfolder]: For 9/11 co-relation queries the response was YES.
[2024-03-09 03:42:11,282 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 994 conditions, 536 events. 181/536 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2875 event pairs, 42 based on Foata normal form. 1/497 useless extension candidates. Maximal degree in co-relation 895. Up to 266 conditions per place. 
[2024-03-09 03:42:11,285 INFO  L137   encePairwiseOnDemand]: 151/173 looper letters, 54 selfloop transitions, 28 changer transitions 0/92 dead transitions.
[2024-03-09 03:42:11,285 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 92 transitions, 359 flow
[2024-03-09 03:42:11,286 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:11,288 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:11,296 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions.
[2024-03-09 03:42:11,298 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5038535645472062
[2024-03-09 03:42:11,299 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 523 transitions.
[2024-03-09 03:42:11,299 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 523 transitions.
[2024-03-09 03:42:11,301 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:11,303 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 523 transitions.
[2024-03-09 03:42:11,307 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,312 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,312 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,314 INFO  L175             Difference]: Start difference. First operand has 45 places, 43 transitions, 94 flow. Second operand 6 states and 523 transitions.
[2024-03-09 03:42:11,314 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 92 transitions, 359 flow
[2024-03-09 03:42:11,317 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 92 transitions, 359 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:11,319 INFO  L231             Difference]: Finished difference. Result has 55 places, 71 transitions, 306 flow
[2024-03-09 03:42:11,320 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=306, PETRI_PLACES=55, PETRI_TRANSITIONS=71}
[2024-03-09 03:42:11,323 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 10 predicate places.
[2024-03-09 03:42:11,323 INFO  L495      AbstractCegarLoop]: Abstraction has has 55 places, 71 transitions, 306 flow
[2024-03-09 03:42:11,324 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 74.16666666666667) internal successors, (445), 6 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,324 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:11,324 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:11,324 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-09 03:42:11,324 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:42:11,324 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:11,324 INFO  L85        PathProgramCache]: Analyzing trace with hash -1539485806, now seen corresponding path program 1 times
[2024-03-09 03:42:11,325 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:11,325 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247608772]
[2024-03-09 03:42:11,325 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:11,325 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:11,340 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:11,537 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:11,537 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:11,537 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247608772]
[2024-03-09 03:42:11,537 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247608772] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:11,537 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:11,537 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:11,538 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974461540]
[2024-03-09 03:42:11,538 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:11,539 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:11,539 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:11,539 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:11,539 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:11,753 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 83 out of 173
[2024-03-09 03:42:11,754 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 71 transitions, 306 flow. Second operand  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,754 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:11,754 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 173
[2024-03-09 03:42:11,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:11,884 INFO  L130       PetriNetUnfolder]: 182/561 cut-off events.
[2024-03-09 03:42:11,884 INFO  L131       PetriNetUnfolder]: For 252/254 co-relation queries the response was YES.
[2024-03-09 03:42:11,886 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1418 conditions, 561 events. 182/561 cut-off events. For 252/254 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3049 event pairs, 36 based on Foata normal form. 0/537 useless extension candidates. Maximal degree in co-relation 1293. Up to 276 conditions per place. 
[2024-03-09 03:42:11,888 INFO  L137   encePairwiseOnDemand]: 162/173 looper letters, 37 selfloop transitions, 33 changer transitions 8/113 dead transitions.
[2024-03-09 03:42:11,888 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 113 transitions, 637 flow
[2024-03-09 03:42:11,888 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:11,888 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:11,890 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 551 transitions.
[2024-03-09 03:42:11,891 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5308285163776493
[2024-03-09 03:42:11,891 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 551 transitions.
[2024-03-09 03:42:11,891 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 551 transitions.
[2024-03-09 03:42:11,891 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:11,892 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 551 transitions.
[2024-03-09 03:42:11,893 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.83333333333333) internal successors, (551), 6 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,895 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,895 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,895 INFO  L175             Difference]: Start difference. First operand has 55 places, 71 transitions, 306 flow. Second operand 6 states and 551 transitions.
[2024-03-09 03:42:11,896 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 113 transitions, 637 flow
[2024-03-09 03:42:11,899 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 113 transitions, 637 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:11,900 INFO  L231             Difference]: Finished difference. Result has 65 places, 101 transitions, 607 flow
[2024-03-09 03:42:11,900 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=607, PETRI_PLACES=65, PETRI_TRANSITIONS=101}
[2024-03-09 03:42:11,901 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 20 predicate places.
[2024-03-09 03:42:11,901 INFO  L495      AbstractCegarLoop]: Abstraction has has 65 places, 101 transitions, 607 flow
[2024-03-09 03:42:11,902 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 84.33333333333333) internal successors, (506), 6 states have internal predecessors, (506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:11,902 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:11,902 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:11,902 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-09 03:42:11,902 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:42:11,902 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:11,903 INFO  L85        PathProgramCache]: Analyzing trace with hash 262130902, now seen corresponding path program 1 times
[2024-03-09 03:42:11,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:11,903 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309235042]
[2024-03-09 03:42:11,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:11,903 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:11,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:12,108 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:12,108 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:12,109 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309235042]
[2024-03-09 03:42:12,109 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309235042] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:12,109 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:12,109 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:12,109 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235924912]
[2024-03-09 03:42:12,109 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:12,110 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:12,110 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:12,110 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:12,110 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:12,193 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 173
[2024-03-09 03:42:12,194 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 101 transitions, 607 flow. Second operand  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:12,194 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:12,194 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 173
[2024-03-09 03:42:12,194 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:12,488 INFO  L130       PetriNetUnfolder]: 316/822 cut-off events.
[2024-03-09 03:42:12,489 INFO  L131       PetriNetUnfolder]: For 647/655 co-relation queries the response was YES.
[2024-03-09 03:42:12,492 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2697 conditions, 822 events. 316/822 cut-off events. For 647/655 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4796 event pairs, 49 based on Foata normal form. 0/765 useless extension candidates. Maximal degree in co-relation 2572. Up to 579 conditions per place. 
[2024-03-09 03:42:12,494 INFO  L137   encePairwiseOnDemand]: 151/173 looper letters, 100 selfloop transitions, 76 changer transitions 10/199 dead transitions.
[2024-03-09 03:42:12,495 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 199 transitions, 1391 flow
[2024-03-09 03:42:12,495 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:12,495 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:12,496 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 562 transitions.
[2024-03-09 03:42:12,497 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5414258188824663
[2024-03-09 03:42:12,497 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 562 transitions.
[2024-03-09 03:42:12,497 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 562 transitions.
[2024-03-09 03:42:12,497 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:12,497 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 562 transitions.
[2024-03-09 03:42:12,498 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 93.66666666666667) internal successors, (562), 6 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:12,500 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:12,500 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 173.0) internal successors, (1211), 7 states have internal predecessors, (1211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:12,500 INFO  L175             Difference]: Start difference. First operand has 65 places, 101 transitions, 607 flow. Second operand 6 states and 562 transitions.
[2024-03-09 03:42:12,501 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 199 transitions, 1391 flow
[2024-03-09 03:42:12,506 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 199 transitions, 1391 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:12,508 INFO  L231             Difference]: Finished difference. Result has 73 places, 169 transitions, 1207 flow
[2024-03-09 03:42:12,508 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=173, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1207, PETRI_PLACES=73, PETRI_TRANSITIONS=169}
[2024-03-09 03:42:12,509 INFO  L288   CegarLoopForPetriNet]: 45 programPoint places, 28 predicate places.
[2024-03-09 03:42:12,509 INFO  L495      AbstractCegarLoop]: Abstraction has has 73 places, 169 transitions, 1207 flow
[2024-03-09 03:42:12,509 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.16666666666667) internal successors, (451), 6 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:12,509 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:12,510 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1]
[2024-03-09 03:42:12,510 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-09 03:42:12,510 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-09 03:42:12,510 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:12,510 INFO  L85        PathProgramCache]: Analyzing trace with hash 62906132, now seen corresponding path program 1 times
[2024-03-09 03:42:12,510 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:12,511 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343149303]
[2024-03-09 03:42:12,511 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:12,511 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:12,545 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:42:12,545 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-09 03:42:12,555 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-09 03:42:12,572 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-09 03:42:12,572 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-09 03:42:12,573 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-09 03:42:12,574 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-09 03:42:12,575 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-09 03:42:12,575 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-09 03:42:12,575 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-09 03:42:12,575 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-09 03:42:12,575 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-09 03:42:12,575 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-09 03:42:12,575 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-09 03:42:12,577 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-09 03:42:12,577 INFO  L515   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-09 03:42:12,592 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-09 03:42:12,595 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,620 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2024-03-09 03:42:12,620 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 03:42:12,620 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2024-03-09 03:42:12,621 INFO  L82        GeneralOperation]: Start removeDead. Operand has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,621 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,622 INFO  L124   etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation.
[2024-03-09 03:42:12,622 INFO  L131   etLargeBlockEncoding]: Starting large block encoding on Petri net that has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,622 INFO  L113        LiptonReduction]: Starting Lipton reduction on Petri net that has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 120 places, 120 transitions, 258 flow
[2024-03-09 03:42:12,637 INFO  L130       PetriNetUnfolder]: 11/265 cut-off events.
[2024-03-09 03:42:12,637 INFO  L131       PetriNetUnfolder]: For 6/6 co-relation queries the response was YES.
[2024-03-09 03:42:12,637 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 279 conditions, 265 events. 11/265 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 614 event pairs, 0 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 152. Up to 8 conditions per place. 
[2024-03-09 03:42:12,639 INFO  L119        LiptonReduction]: Number of co-enabled transitions 4080
[2024-03-09 03:42:14,513 INFO  L134        LiptonReduction]: Checked pairs total: 17877
[2024-03-09 03:42:14,513 INFO  L136        LiptonReduction]: Total number of compositions: 72
[2024-03-09 03:42:14,515 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-09 03:42:14,516 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57f79657, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=<UNSUPPORTED>, UseSemiCommutativity=<UNSUPPORTED>, Solver=<NOT_USED>, SolverTimeout=<NOT_USED>]
[2024-03-09 03:42:14,516 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-09 03:42:14,518 INFO  L130       PetriNetUnfolder]: 0/17 cut-off events.
[2024-03-09 03:42:14,518 INFO  L131       PetriNetUnfolder]: For 0/0 co-relation queries the response was YES.
[2024-03-09 03:42:14,518 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:14,519 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:14,519 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:14,519 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:14,519 INFO  L85        PathProgramCache]: Analyzing trace with hash 629147434, now seen corresponding path program 1 times
[2024-03-09 03:42:14,519 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:14,520 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513572419]
[2024-03-09 03:42:14,520 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:14,520 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:14,549 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:14,684 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:14,684 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:14,684 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513572419]
[2024-03-09 03:42:14,684 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513572419] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:14,684 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:14,684 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:14,685 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558262930]
[2024-03-09 03:42:14,685 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:14,685 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:14,685 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:14,685 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:14,685 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:14,902 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-09 03:42:14,903 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 54 transitions, 126 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:14,903 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:14,903 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-09 03:42:14,903 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:15,625 INFO  L130       PetriNetUnfolder]: 3686/6983 cut-off events.
[2024-03-09 03:42:15,625 INFO  L131       PetriNetUnfolder]: For 206/241 co-relation queries the response was YES.
[2024-03-09 03:42:15,629 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13338 conditions, 6983 events. 3686/6983 cut-off events. For 206/241 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 47160 event pairs, 884 based on Foata normal form. 12/6616 useless extension candidates. Maximal degree in co-relation 6457. Up to 4233 conditions per place. 
[2024-03-09 03:42:15,653 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 75 selfloop transitions, 47 changer transitions 0/135 dead transitions.
[2024-03-09 03:42:15,654 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 135 transitions, 543 flow
[2024-03-09 03:42:15,654 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:15,654 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:15,656 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions.
[2024-03-09 03:42:15,656 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5460069444444444
[2024-03-09 03:42:15,656 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 629 transitions.
[2024-03-09 03:42:15,656 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions.
[2024-03-09 03:42:15,657 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:15,657 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions.
[2024-03-09 03:42:15,659 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:15,661 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:15,661 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:15,661 INFO  L175             Difference]: Start difference. First operand has 57 places, 54 transitions, 126 flow. Second operand 6 states and 629 transitions.
[2024-03-09 03:42:15,661 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 135 transitions, 543 flow
[2024-03-09 03:42:15,663 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 543 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:15,665 INFO  L231             Difference]: Finished difference. Result has 67 places, 101 transitions, 460 flow
[2024-03-09 03:42:15,666 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=101}
[2024-03-09 03:42:15,666 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 10 predicate places.
[2024-03-09 03:42:15,666 INFO  L495      AbstractCegarLoop]: Abstraction has has 67 places, 101 transitions, 460 flow
[2024-03-09 03:42:15,667 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:15,667 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:15,667 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:15,667 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-09 03:42:15,667 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:15,667 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:15,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -1562642498, now seen corresponding path program 1 times
[2024-03-09 03:42:15,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:15,668 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730750091]
[2024-03-09 03:42:15,668 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:15,668 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:15,677 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:15,815 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:15,815 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:15,816 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730750091]
[2024-03-09 03:42:15,816 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730750091] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:15,816 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:15,816 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:15,816 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515647788]
[2024-03-09 03:42:15,816 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:15,816 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:15,816 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:15,817 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:15,817 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:16,050 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 192
[2024-03-09 03:42:16,052 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 101 transitions, 460 flow. Second operand  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:16,052 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:16,052 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 192
[2024-03-09 03:42:16,052 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:16,839 INFO  L130       PetriNetUnfolder]: 3875/7372 cut-off events.
[2024-03-09 03:42:16,839 INFO  L131       PetriNetUnfolder]: For 4540/4665 co-relation queries the response was YES.
[2024-03-09 03:42:16,847 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19732 conditions, 7372 events. 3875/7372 cut-off events. For 4540/4665 co-relation queries the response was YES. Maximal size of possible extension queue 261. Compared 50170 event pairs, 1160 based on Foata normal form. 0/6968 useless extension candidates. Maximal degree in co-relation 10705. Up to 4740 conditions per place. 
[2024-03-09 03:42:16,872 INFO  L137   encePairwiseOnDemand]: 177/192 looper letters, 81 selfloop transitions, 70 changer transitions 0/188 dead transitions.
[2024-03-09 03:42:16,872 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 188 transitions, 1134 flow
[2024-03-09 03:42:16,875 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:16,875 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:16,876 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-09 03:42:16,877 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5651041666666666
[2024-03-09 03:42:16,877 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-09 03:42:16,877 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-09 03:42:16,877 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:16,877 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-09 03:42:16,879 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:16,882 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:16,882 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:16,882 INFO  L175             Difference]: Start difference. First operand has 67 places, 101 transitions, 460 flow. Second operand 6 states and 651 transitions.
[2024-03-09 03:42:16,883 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 188 transitions, 1134 flow
[2024-03-09 03:42:16,890 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 188 transitions, 1134 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:16,893 INFO  L231             Difference]: Finished difference. Result has 77 places, 170 transitions, 1114 flow
[2024-03-09 03:42:16,893 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1114, PETRI_PLACES=77, PETRI_TRANSITIONS=170}
[2024-03-09 03:42:16,893 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 20 predicate places.
[2024-03-09 03:42:16,893 INFO  L495      AbstractCegarLoop]: Abstraction has has 77 places, 170 transitions, 1114 flow
[2024-03-09 03:42:16,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.33333333333333) internal successors, (572), 6 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:16,894 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:16,894 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:16,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-09 03:42:16,894 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:16,894 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:16,894 INFO  L85        PathProgramCache]: Analyzing trace with hash -52118358, now seen corresponding path program 1 times
[2024-03-09 03:42:16,894 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:16,895 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223339279]
[2024-03-09 03:42:16,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:16,895 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:16,906 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:17,079 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:17,079 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:17,079 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223339279]
[2024-03-09 03:42:17,079 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223339279] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:17,079 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:17,080 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:17,080 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324130830]
[2024-03-09 03:42:17,080 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:17,080 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:17,080 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:17,080 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:17,081 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:17,183 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-09 03:42:17,183 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 170 transitions, 1114 flow. Second operand  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:17,183 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:17,183 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-09 03:42:17,184 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:18,418 INFO  L130       PetriNetUnfolder]: 6828/12078 cut-off events.
[2024-03-09 03:42:18,418 INFO  L131       PetriNetUnfolder]: For 11484/11568 co-relation queries the response was YES.
[2024-03-09 03:42:18,468 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 40089 conditions, 12078 events. 6828/12078 cut-off events. For 11484/11568 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 82857 event pairs, 1685 based on Foata normal form. 0/11340 useless extension candidates. Maximal degree in co-relation 33299. Up to 9361 conditions per place. 
[2024-03-09 03:42:18,509 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 184 selfloop transitions, 147 changer transitions 0/348 dead transitions.
[2024-03-09 03:42:18,509 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 348 transitions, 2660 flow
[2024-03-09 03:42:18,511 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:18,511 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:18,512 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 674 transitions.
[2024-03-09 03:42:18,512 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5850694444444444
[2024-03-09 03:42:18,513 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 674 transitions.
[2024-03-09 03:42:18,513 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 674 transitions.
[2024-03-09 03:42:18,513 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:18,513 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 674 transitions.
[2024-03-09 03:42:18,515 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 112.33333333333333) internal successors, (674), 6 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:18,517 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:18,517 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:18,517 INFO  L175             Difference]: Start difference. First operand has 77 places, 170 transitions, 1114 flow. Second operand 6 states and 674 transitions.
[2024-03-09 03:42:18,517 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 348 transitions, 2660 flow
[2024-03-09 03:42:18,536 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 348 transitions, 2660 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:18,539 INFO  L231             Difference]: Finished difference. Result has 86 places, 304 transitions, 2404 flow
[2024-03-09 03:42:18,540 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2404, PETRI_PLACES=86, PETRI_TRANSITIONS=304}
[2024-03-09 03:42:18,540 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 29 predicate places.
[2024-03-09 03:42:18,540 INFO  L495      AbstractCegarLoop]: Abstraction has has 86 places, 304 transitions, 2404 flow
[2024-03-09 03:42:18,541 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.16666666666667) internal successors, (517), 6 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:18,541 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:18,541 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:18,541 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-09 03:42:18,541 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:18,541 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:18,541 INFO  L85        PathProgramCache]: Analyzing trace with hash -1215569579, now seen corresponding path program 1 times
[2024-03-09 03:42:18,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:18,542 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543037160]
[2024-03-09 03:42:18,542 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:18,542 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:18,559 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:18,836 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:18,836 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:18,836 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543037160]
[2024-03-09 03:42:18,836 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543037160] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:42:18,836 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419428088]
[2024-03-09 03:42:18,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:18,837 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:18,837 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:18,838 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:42:18,840 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-09 03:42:18,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:18,934 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-09 03:42:18,943 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:42:19,040 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:42:19,067 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:42:19,103 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:19,104 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:42:19,151 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:19,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:42:19,226 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:19,228 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:42:19,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:19,256 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:42:19,284 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 03:42:19,307 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_282 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_282) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 03:42:19,405 INFO  L134       CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:42:19,406 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [419428088] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:42:19,406 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:42:19,406 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 20
[2024-03-09 03:42:19,406 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762826111]
[2024-03-09 03:42:19,406 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:42:19,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-09 03:42:19,407 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:19,407 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-09 03:42:19,407 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=301, Unknown=2, NotChecked=74, Total=462
[2024-03-09 03:42:19,439 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 192
[2024-03-09 03:42:19,440 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 304 transitions, 2404 flow. Second operand  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:19,440 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:19,441 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 192
[2024-03-09 03:42:19,441 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:22,772 INFO  L130       PetriNetUnfolder]: 11359/18832 cut-off events.
[2024-03-09 03:42:22,773 INFO  L131       PetriNetUnfolder]: For 32117/32119 co-relation queries the response was YES.
[2024-03-09 03:42:22,813 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 75968 conditions, 18832 events. 11359/18832 cut-off events. For 32117/32119 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 128274 event pairs, 1116 based on Foata normal form. 2/17121 useless extension candidates. Maximal degree in co-relation 66241. Up to 10934 conditions per place. 
[2024-03-09 03:42:22,879 INFO  L137   encePairwiseOnDemand]: 143/192 looper letters, 523 selfloop transitions, 331 changer transitions 19/878 dead transitions.
[2024-03-09 03:42:22,879 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 878 transitions, 7634 flow
[2024-03-09 03:42:22,879 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2024-03-09 03:42:22,880 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2024-03-09 03:42:22,882 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1166 transitions.
[2024-03-09 03:42:22,882 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.4671474358974359
[2024-03-09 03:42:22,882 INFO  L72            ComplementDD]: Start complementDD. Operand 13 states and 1166 transitions.
[2024-03-09 03:42:22,882 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 13 states and 1166 transitions.
[2024-03-09 03:42:22,883 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:22,883 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1166 transitions.
[2024-03-09 03:42:22,955 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 14 states, 13 states have (on average 89.6923076923077) internal successors, (1166), 13 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:22,959 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:22,960 INFO  L81            ComplementDD]: Finished complementDD. Result  has 14 states, 14 states have (on average 192.0) internal successors, (2688), 14 states have internal predecessors, (2688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:22,960 INFO  L175             Difference]: Start difference. First operand has 86 places, 304 transitions, 2404 flow. Second operand 13 states and 1166 transitions.
[2024-03-09 03:42:22,961 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 878 transitions, 7634 flow
[2024-03-09 03:42:23,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 878 transitions, 7490 flow, removed 72 selfloop flow, removed 0 redundant places.
[2024-03-09 03:42:23,384 INFO  L231             Difference]: Finished difference. Result has 108 places, 587 transitions, 5820 flow
[2024-03-09 03:42:23,384 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=2308, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=5820, PETRI_PLACES=108, PETRI_TRANSITIONS=587}
[2024-03-09 03:42:23,385 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 51 predicate places.
[2024-03-09 03:42:23,385 INFO  L495      AbstractCegarLoop]: Abstraction has has 108 places, 587 transitions, 5820 flow
[2024-03-09 03:42:23,385 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 62.27272727272727) internal successors, (1370), 22 states have internal predecessors, (1370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:23,386 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:23,386 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:23,405 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-09 03:42:23,586 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:23,587 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:23,588 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:23,589 INFO  L85        PathProgramCache]: Analyzing trace with hash 198304269, now seen corresponding path program 1 times
[2024-03-09 03:42:23,589 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:23,589 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650705268]
[2024-03-09 03:42:23,589 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:23,590 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:23,608 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:23,880 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:23,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:23,880 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650705268]
[2024-03-09 03:42:23,880 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650705268] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:42:23,880 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773191222]
[2024-03-09 03:42:23,881 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:23,881 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:23,881 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:23,888 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:42:23,891 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-09 03:42:23,991 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:23,992 INFO  L263         TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 03:42:23,996 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:42:24,068 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:42:24,094 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,095 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:42:24,137 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,138 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,139 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:42:24,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,182 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,183 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,184 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:42:24,266 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:24,267 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:42:24,298 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:24,298 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:42:24,412 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33)))) is different from false
[2024-03-09 03:42:24,764 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33)))))) is different from false
[2024-03-09 03:42:24,809 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_33 Int)) (or (< |c_threadThread1of2ForFork0_#in~arg.base| v_threadThread1of2ForFork0_~t~0.base_33) (forall ((v_ArrVal_369 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_33 v_ArrVal_369) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2024-03-09 03:42:24,855 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:24,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-09 03:42:24,862 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:24,862 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 34
[2024-03-09 03:42:24,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3
[2024-03-09 03:42:24,881 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:42:24,883 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:42:24,889 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:42:24,890 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:42:24,967 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 03:42:24,967 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773191222] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:42:24,967 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:42:24,968 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 23
[2024-03-09 03:42:24,968 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106249362]
[2024-03-09 03:42:24,968 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:42:24,969 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-09 03:42:24,970 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:24,970 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-09 03:42:24,971 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=351, Unknown=16, NotChecked=126, Total=600
[2024-03-09 03:42:25,269 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 64 out of 192
[2024-03-09 03:42:25,272 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 587 transitions, 5820 flow. Second operand  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:25,272 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:25,272 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 192
[2024-03-09 03:42:25,273 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:30,635 INFO  L130       PetriNetUnfolder]: 11547/19365 cut-off events.
[2024-03-09 03:42:30,635 INFO  L131       PetriNetUnfolder]: For 76984/77026 co-relation queries the response was YES.
[2024-03-09 03:42:30,685 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 107171 conditions, 19365 events. 11547/19365 cut-off events. For 76984/77026 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 133846 event pairs, 848 based on Foata normal form. 40/18199 useless extension candidates. Maximal degree in co-relation 100256. Up to 12694 conditions per place. 
[2024-03-09 03:42:30,759 INFO  L137   encePairwiseOnDemand]: 162/192 looper letters, 586 selfloop transitions, 327 changer transitions 12/934 dead transitions.
[2024-03-09 03:42:30,759 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 934 transitions, 10619 flow
[2024-03-09 03:42:30,760 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-03-09 03:42:30,760 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-03-09 03:42:30,762 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 974 transitions.
[2024-03-09 03:42:30,762 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.46117424242424243
[2024-03-09 03:42:30,762 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 974 transitions.
[2024-03-09 03:42:30,762 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 974 transitions.
[2024-03-09 03:42:30,763 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:30,763 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 974 transitions.
[2024-03-09 03:42:30,764 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:30,766 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:30,767 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 192.0) internal successors, (2304), 12 states have internal predecessors, (2304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:30,767 INFO  L175             Difference]: Start difference. First operand has 108 places, 587 transitions, 5820 flow. Second operand 11 states and 974 transitions.
[2024-03-09 03:42:30,767 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 934 transitions, 10619 flow
[2024-03-09 03:42:31,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 934 transitions, 10460 flow, removed 78 selfloop flow, removed 1 redundant places.
[2024-03-09 03:42:31,517 INFO  L231             Difference]: Finished difference. Result has 124 places, 728 transitions, 8482 flow
[2024-03-09 03:42:31,517 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=209, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8482, PETRI_PLACES=124, PETRI_TRANSITIONS=728}
[2024-03-09 03:42:31,518 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 67 predicate places.
[2024-03-09 03:42:31,518 INFO  L495      AbstractCegarLoop]: Abstraction has has 124 places, 728 transitions, 8482 flow
[2024-03-09 03:42:31,519 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 66.0) internal successors, (1650), 25 states have internal predecessors, (1650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:31,519 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:31,519 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:31,525 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-09 03:42:31,719 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:31,720 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:31,720 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:31,720 INFO  L85        PathProgramCache]: Analyzing trace with hash -248351730, now seen corresponding path program 1 times
[2024-03-09 03:42:31,721 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:31,722 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514483218]
[2024-03-09 03:42:31,722 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:31,722 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:31,748 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:32,227 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:32,227 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:32,227 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514483218]
[2024-03-09 03:42:32,227 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514483218] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:42:32,227 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804321324]
[2024-03-09 03:42:32,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:32,228 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:32,228 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:32,229 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:42:32,233 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-09 03:42:32,357 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:32,358 INFO  L263         TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-09 03:42:32,361 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:42:32,444 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:42:32,470 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,471 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:42:32,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,507 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,508 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:42:32,552 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,553 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,554 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,555 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:42:32,601 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:42:32,603 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:42:32,643 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:32,643 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:42:32,662 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)))) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))) is different from false
[2024-03-09 03:42:32,811 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-09 03:42:32,834 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2 0) .cse1 0) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (and (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_464 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_464) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-09 03:42:32,848 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:32,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-09 03:42:32,854 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:32,854 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 36
[2024-03-09 03:42:32,857 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 03:42:32,865 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:42:32,865 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:42:32,872 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:42:32,872 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-09 03:42:32,939 INFO  L134       CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-09 03:42:32,940 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [804321324] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:42:32,940 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:42:32,940 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 23
[2024-03-09 03:42:32,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583171517]
[2024-03-09 03:42:32,940 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:42:32,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-03-09 03:42:32,940 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:32,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-03-09 03:42:32,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=362, Unknown=18, NotChecked=126, Total=600
[2024-03-09 03:42:32,999 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 62 out of 192
[2024-03-09 03:42:33,001 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 728 transitions, 8482 flow. Second operand  has 25 states, 25 states have (on average 64.2) internal successors, (1605), 25 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:33,001 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:33,001 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 192
[2024-03-09 03:42:33,001 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:38,915 INFO  L130       PetriNetUnfolder]: 15068/25147 cut-off events.
[2024-03-09 03:42:38,915 INFO  L131       PetriNetUnfolder]: For 136581/136644 co-relation queries the response was YES.
[2024-03-09 03:42:38,995 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 153349 conditions, 25147 events. 15068/25147 cut-off events. For 136581/136644 co-relation queries the response was YES. Maximal size of possible extension queue 844. Compared 180010 event pairs, 1109 based on Foata normal form. 397/24033 useless extension candidates. Maximal degree in co-relation 141877. Up to 10732 conditions per place. 
[2024-03-09 03:42:39,092 INFO  L137   encePairwiseOnDemand]: 158/192 looper letters, 865 selfloop transitions, 648 changer transitions 11/1529 dead transitions.
[2024-03-09 03:42:39,093 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 1529 transitions, 19641 flow
[2024-03-09 03:42:39,095 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-09 03:42:39,095 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-09 03:42:39,097 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1134 transitions.
[2024-03-09 03:42:39,097 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.421875
[2024-03-09 03:42:39,097 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1134 transitions.
[2024-03-09 03:42:39,097 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1134 transitions.
[2024-03-09 03:42:39,098 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:39,098 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1134 transitions.
[2024-03-09 03:42:39,099 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 81.0) internal successors, (1134), 14 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:39,102 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:39,102 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 192.0) internal successors, (2880), 15 states have internal predecessors, (2880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:39,103 INFO  L175             Difference]: Start difference. First operand has 124 places, 728 transitions, 8482 flow. Second operand 14 states and 1134 transitions.
[2024-03-09 03:42:39,103 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 1529 transitions, 19641 flow
[2024-03-09 03:42:41,725 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 1529 transitions, 19609 flow, removed 15 selfloop flow, removed 1 redundant places.
[2024-03-09 03:42:41,741 INFO  L231             Difference]: Finished difference. Result has 145 places, 1145 transitions, 16177 flow
[2024-03-09 03:42:41,741 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=8468, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=275, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=16177, PETRI_PLACES=145, PETRI_TRANSITIONS=1145}
[2024-03-09 03:42:41,742 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 88 predicate places.
[2024-03-09 03:42:41,742 INFO  L495      AbstractCegarLoop]: Abstraction has has 145 places, 1145 transitions, 16177 flow
[2024-03-09 03:42:41,743 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 25 states, 25 states have (on average 64.2) internal successors, (1605), 25 states have internal predecessors, (1605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:41,743 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:41,743 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:41,750 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-09 03:42:41,943 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-09 03:42:41,944 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:41,945 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:41,945 INFO  L85        PathProgramCache]: Analyzing trace with hash -1497011703, now seen corresponding path program 1 times
[2024-03-09 03:42:41,946 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:41,946 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491577438]
[2024-03-09 03:42:41,946 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:41,946 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:41,968 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:42,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:42,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:42,019 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491577438]
[2024-03-09 03:42:42,019 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491577438] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:42:42,019 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143334596]
[2024-03-09 03:42:42,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:42,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:42,020 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:42,020 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:42:42,023 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-09 03:42:42,153 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:42,154 INFO  L263         TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-03-09 03:42:42,155 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:42:42,184 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:42,185 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:42:42,213 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:42,213 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143334596] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:42:42,213 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:42:42,213 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8
[2024-03-09 03:42:42,213 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059153762]
[2024-03-09 03:42:42,214 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:42:42,214 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-03-09 03:42:42,214 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:42,214 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-03-09 03:42:42,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-03-09 03:42:42,302 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 192
[2024-03-09 03:42:42,303 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1145 transitions, 16177 flow. Second operand  has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:42,303 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:42,303 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 192
[2024-03-09 03:42:42,303 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:45,393 INFO  L130       PetriNetUnfolder]: 9510/17687 cut-off events.
[2024-03-09 03:42:45,393 INFO  L131       PetriNetUnfolder]: For 137211/139352 co-relation queries the response was YES.
[2024-03-09 03:42:45,456 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 109832 conditions, 17687 events. 9510/17687 cut-off events. For 137211/139352 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 137365 event pairs, 1249 based on Foata normal form. 507/17648 useless extension candidates. Maximal degree in co-relation 109710. Up to 6069 conditions per place. 
[2024-03-09 03:42:45,522 INFO  L137   encePairwiseOnDemand]: 185/192 looper letters, 200 selfloop transitions, 14 changer transitions 37/1188 dead transitions.
[2024-03-09 03:42:45,523 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 1188 transitions, 17403 flow
[2024-03-09 03:42:45,524 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. 
[2024-03-09 03:42:45,524 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2024-03-09 03:42:45,525 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 863 transitions.
[2024-03-09 03:42:45,525 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5618489583333334
[2024-03-09 03:42:45,525 INFO  L72            ComplementDD]: Start complementDD. Operand 8 states and 863 transitions.
[2024-03-09 03:42:45,525 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 8 states and 863 transitions.
[2024-03-09 03:42:45,526 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:45,526 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 863 transitions.
[2024-03-09 03:42:45,527 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 9 states, 8 states have (on average 107.875) internal successors, (863), 8 states have internal predecessors, (863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:45,529 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:45,529 INFO  L81            ComplementDD]: Finished complementDD. Result  has 9 states, 9 states have (on average 192.0) internal successors, (1728), 9 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:45,529 INFO  L175             Difference]: Start difference. First operand has 145 places, 1145 transitions, 16177 flow. Second operand 8 states and 863 transitions.
[2024-03-09 03:42:45,529 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 1188 transitions, 17403 flow
[2024-03-09 03:42:46,693 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1188 transitions, 17323 flow, removed 22 selfloop flow, removed 4 redundant places.
[2024-03-09 03:42:46,708 INFO  L231             Difference]: Finished difference. Result has 152 places, 1077 transitions, 15379 flow
[2024-03-09 03:42:46,709 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=15655, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1087, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=15379, PETRI_PLACES=152, PETRI_TRANSITIONS=1077}
[2024-03-09 03:42:46,709 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 95 predicate places.
[2024-03-09 03:42:46,709 INFO  L495      AbstractCegarLoop]: Abstraction has has 152 places, 1077 transitions, 15379 flow
[2024-03-09 03:42:46,710 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 104.77777777777777) internal successors, (943), 9 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:46,710 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:46,710 INFO  L209   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:46,717 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-09 03:42:46,914 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:46,915 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:46,915 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:46,915 INFO  L85        PathProgramCache]: Analyzing trace with hash -1134168285, now seen corresponding path program 1 times
[2024-03-09 03:42:46,916 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:46,916 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63335254]
[2024-03-09 03:42:46,916 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:46,916 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:46,933 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:47,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-03-09 03:42:47,102 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:47,102 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63335254]
[2024-03-09 03:42:47,102 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63335254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-09 03:42:47,102 INFO  L184   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-09 03:42:47,102 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-09 03:42:47,102 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705626689]
[2024-03-09 03:42:47,102 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-09 03:42:47,102 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-09 03:42:47,103 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:47,103 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-09 03:42:47,103 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-09 03:42:47,222 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 192
[2024-03-09 03:42:47,223 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 1077 transitions, 15379 flow. Second operand  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:47,223 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:47,223 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 192
[2024-03-09 03:42:47,223 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:42:52,697 INFO  L130       PetriNetUnfolder]: 12664/22131 cut-off events.
[2024-03-09 03:42:52,697 INFO  L131       PetriNetUnfolder]: For 178230/179056 co-relation queries the response was YES.
[2024-03-09 03:42:52,808 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 150502 conditions, 22131 events. 12664/22131 cut-off events. For 178230/179056 co-relation queries the response was YES. Maximal size of possible extension queue 733. Compared 164209 event pairs, 1988 based on Foata normal form. 74/21049 useless extension candidates. Maximal degree in co-relation 150447. Up to 17693 conditions per place. 
[2024-03-09 03:42:52,907 INFO  L137   encePairwiseOnDemand]: 166/192 looper letters, 987 selfloop transitions, 229 changer transitions 9/1289 dead transitions.
[2024-03-09 03:42:52,907 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 1289 transitions, 20559 flow
[2024-03-09 03:42:52,908 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-09 03:42:52,908 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-09 03:42:52,909 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 670 transitions.
[2024-03-09 03:42:52,909 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.5815972222222222
[2024-03-09 03:42:52,910 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 670 transitions.
[2024-03-09 03:42:52,910 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 670 transitions.
[2024-03-09 03:42:52,910 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:42:52,910 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 670 transitions.
[2024-03-09 03:42:52,911 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 111.66666666666667) internal successors, (670), 6 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:52,912 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:52,913 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 192.0) internal successors, (1344), 7 states have internal predecessors, (1344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:52,913 INFO  L175             Difference]: Start difference. First operand has 152 places, 1077 transitions, 15379 flow. Second operand 6 states and 670 transitions.
[2024-03-09 03:42:52,913 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 1289 transitions, 20559 flow
[2024-03-09 03:42:54,775 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 1289 transitions, 20112 flow, removed 10 selfloop flow, removed 5 redundant places.
[2024-03-09 03:42:54,792 INFO  L231             Difference]: Finished difference. Result has 154 places, 1236 transitions, 18025 flow
[2024-03-09 03:42:54,792 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=14984, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1077, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=102, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18025, PETRI_PLACES=154, PETRI_TRANSITIONS=1236}
[2024-03-09 03:42:54,793 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 97 predicate places.
[2024-03-09 03:42:54,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 154 places, 1236 transitions, 18025 flow
[2024-03-09 03:42:54,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.5) internal successors, (519), 6 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:54,793 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:42:54,793 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:42:54,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-09 03:42:54,793 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:42:54,793 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:42:54,794 INFO  L85        PathProgramCache]: Analyzing trace with hash 628212227, now seen corresponding path program 1 times
[2024-03-09 03:42:54,794 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:42:54,794 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178326206]
[2024-03-09 03:42:54,794 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:54,794 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:42:54,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:55,243 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:55,243 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:42:55,243 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178326206]
[2024-03-09 03:42:55,243 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178326206] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:42:55,243 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1315082558]
[2024-03-09 03:42:55,243 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:42:55,243 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:42:55,243 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:42:55,244 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:42:55,245 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-09 03:42:55,417 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:42:55,418 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 41 conjunts are in the unsatisfiable core
[2024-03-09 03:42:55,422 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:42:55,431 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-09 03:42:55,431 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 27
[2024-03-09 03:42:55,514 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:42:55,515 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-09 03:42:55,558 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:42:55,590 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 03:42:55,606 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:42:55,615 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:42:55,632 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:55,632 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:42:55,646 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:42:55,646 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:42:55,671 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:42:55,681 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:42:55,681 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:42:55,701 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_720 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 03:42:55,817 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_720 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_720 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_720) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 03:42:55,874 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_711) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 03:42:55,890 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_711) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 03:42:55,897 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_710) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_711) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 03:42:55,920 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_711 (Array Int Int)) (v_ArrVal_710 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_710) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_711) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 03:42:55,924 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:42:55,924 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1315082558] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:42:55,924 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:42:55,924 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21
[2024-03-09 03:42:55,925 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327468619]
[2024-03-09 03:42:55,925 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:42:55,925 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 23 states
[2024-03-09 03:42:55,925 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:42:55,926 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants.
[2024-03-09 03:42:55,926 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=218, Unknown=14, NotChecked=210, Total=506
[2024-03-09 03:42:55,940 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:42:55,943 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 1236 transitions, 18025 flow. Second operand  has 23 states, 23 states have (on average 59.30434782608695) internal successors, (1364), 23 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:42:55,943 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:42:55,943 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:42:55,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:43:05,085 INFO  L130       PetriNetUnfolder]: 17833/29857 cut-off events.
[2024-03-09 03:43:05,086 INFO  L131       PetriNetUnfolder]: For 272701/272701 co-relation queries the response was YES.
[2024-03-09 03:43:05,228 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 214263 conditions, 29857 events. 17833/29857 cut-off events. For 272701/272701 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 216486 event pairs, 2616 based on Foata normal form. 77/28944 useless extension candidates. Maximal degree in co-relation 165715. Up to 24889 conditions per place. 
[2024-03-09 03:43:05,352 INFO  L137   encePairwiseOnDemand]: 160/192 looper letters, 1791 selfloop transitions, 645 changer transitions 1/2439 dead transitions.
[2024-03-09 03:43:05,352 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 2439 transitions, 38527 flow
[2024-03-09 03:43:05,353 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 03:43:05,353 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 03:43:05,355 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1522 transitions.
[2024-03-09 03:43:05,356 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3774801587301587
[2024-03-09 03:43:05,356 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1522 transitions.
[2024-03-09 03:43:05,356 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1522 transitions.
[2024-03-09 03:43:05,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:43:05,356 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1522 transitions.
[2024-03-09 03:43:05,359 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 72.47619047619048) internal successors, (1522), 21 states have internal predecessors, (1522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:05,362 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:05,363 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:05,363 INFO  L175             Difference]: Start difference. First operand has 154 places, 1236 transitions, 18025 flow. Second operand 21 states and 1522 transitions.
[2024-03-09 03:43:05,363 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 2439 transitions, 38527 flow
[2024-03-09 03:43:08,241 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 2439 transitions, 37947 flow, removed 290 selfloop flow, removed 0 redundant places.
[2024-03-09 03:43:08,270 INFO  L231             Difference]: Finished difference. Result has 191 places, 1930 transitions, 30724 flow
[2024-03-09 03:43:08,270 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=17521, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=868, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=30724, PETRI_PLACES=191, PETRI_TRANSITIONS=1930}
[2024-03-09 03:43:08,271 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 134 predicate places.
[2024-03-09 03:43:08,271 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 1930 transitions, 30724 flow
[2024-03-09 03:43:08,271 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 23 states, 23 states have (on average 59.30434782608695) internal successors, (1364), 23 states have internal predecessors, (1364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:08,272 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:43:08,272 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:43:08,278 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-09 03:43:08,472 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12
[2024-03-09 03:43:08,473 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:43:08,477 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:43:08,477 INFO  L85        PathProgramCache]: Analyzing trace with hash 2075024165, now seen corresponding path program 2 times
[2024-03-09 03:43:08,477 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:43:08,477 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181953863]
[2024-03-09 03:43:08,477 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:43:08,477 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:43:08,494 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:43:08,968 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:43:08,969 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:43:08,969 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181953863]
[2024-03-09 03:43:08,969 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181953863] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:43:08,969 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578818637]
[2024-03-09 03:43:08,969 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:43:08,969 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:43:08,969 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:43:08,970 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:43:08,971 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-09 03:43:09,110 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:43:09,111 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:43:09,112 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 03:43:09,115 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:43:09,124 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,128 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-09 03:43:09,265 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:43:09,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 03:43:09,314 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-09 03:43:09,354 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:43:09,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:43:09,504 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,505 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,506 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:43:09,577 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,578 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,579 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,580 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:43:09,654 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:43:09,696 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,697 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:09,723 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,724 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:09,748 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,748 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:09,774 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:09,775 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:09,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:09,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:43:09,893 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:43:10,003 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 03:43:12,125 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse0 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse0 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse0 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse0 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-03-09 03:43:12,155 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 03:43:12,175 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 03:43:12,208 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_831 (Array Int Int)) (v_ArrVal_830 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_830) .cse1 v_ArrVal_831) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 03:43:12,259 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:43:12,259 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2024-03-09 03:43:12,266 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:43:12,266 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 228 treesize of output 154
[2024-03-09 03:43:12,271 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110
[2024-03-09 03:43:12,275 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51
[2024-03-09 03:43:12,322 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:43:12,322 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:43:12,328 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:43:12,329 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:43:12,334 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:43:12,335 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-03-09 03:43:12,466 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:43:12,466 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578818637] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:43:12,466 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:43:12,466 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2024-03-09 03:43:12,466 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077289470]
[2024-03-09 03:43:12,467 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:43:12,467 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-09 03:43:12,467 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:43:12,467 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-09 03:43:12,468 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=631, Unknown=13, NotChecked=280, Total=1056
[2024-03-09 03:43:12,469 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:43:12,470 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 1930 transitions, 30724 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:12,470 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:43:12,470 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:43:12,470 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:43:17,109 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:43:19,778 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:43:28,609 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:43:31,351 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:43:45,625 INFO  L130       PetriNetUnfolder]: 18861/31444 cut-off events.
[2024-03-09 03:43:45,626 INFO  L131       PetriNetUnfolder]: For 392970/392972 co-relation queries the response was YES.
[2024-03-09 03:43:45,811 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 253364 conditions, 31444 events. 18861/31444 cut-off events. For 392970/392972 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 227958 event pairs, 1727 based on Foata normal form. 27/30481 useless extension candidates. Maximal degree in co-relation 248296. Up to 26395 conditions per place. 
[2024-03-09 03:43:45,954 INFO  L137   encePairwiseOnDemand]: 157/192 looper letters, 2231 selfloop transitions, 442 changer transitions 2/2677 dead transitions.
[2024-03-09 03:43:45,954 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 2677 transitions, 46453 flow
[2024-03-09 03:43:45,955 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 03:43:45,955 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 03:43:45,956 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1770 transitions.
[2024-03-09 03:43:45,957 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36875
[2024-03-09 03:43:45,957 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1770 transitions.
[2024-03-09 03:43:45,957 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1770 transitions.
[2024-03-09 03:43:45,958 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:43:45,958 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1770 transitions.
[2024-03-09 03:43:45,961 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.8) internal successors, (1770), 25 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:45,965 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:45,966 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:45,967 INFO  L175             Difference]: Start difference. First operand has 191 places, 1930 transitions, 30724 flow. Second operand 25 states and 1770 transitions.
[2024-03-09 03:43:45,967 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 2677 transitions, 46453 flow
[2024-03-09 03:43:51,037 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 2677 transitions, 46111 flow, removed 169 selfloop flow, removed 2 redundant places.
[2024-03-09 03:43:51,074 INFO  L231             Difference]: Finished difference. Result has 231 places, 2277 transitions, 37412 flow
[2024-03-09 03:43:51,076 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=30480, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1930, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=37412, PETRI_PLACES=231, PETRI_TRANSITIONS=2277}
[2024-03-09 03:43:51,076 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 174 predicate places.
[2024-03-09 03:43:51,076 INFO  L495      AbstractCegarLoop]: Abstraction has has 231 places, 2277 transitions, 37412 flow
[2024-03-09 03:43:51,077 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:51,077 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:43:51,077 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:43:51,084 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-09 03:43:51,278 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-09 03:43:51,279 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:43:51,280 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:43:51,280 INFO  L85        PathProgramCache]: Analyzing trace with hash 1017693441, now seen corresponding path program 3 times
[2024-03-09 03:43:51,280 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:43:51,280 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576537068]
[2024-03-09 03:43:51,281 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:43:51,281 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:43:51,298 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:43:51,774 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:43:51,775 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:43:51,775 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576537068]
[2024-03-09 03:43:51,775 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576537068] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:43:51,775 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805467909]
[2024-03-09 03:43:51,775 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 03:43:51,775 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:43:51,776 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:43:51,777 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:43:51,778 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-09 03:43:51,947 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 03:43:51,947 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:43:51,949 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 03:43:51,953 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:43:51,968 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:51,973 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-09 03:43:52,135 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:43:52,135 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 03:43:52,192 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,193 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-09 03:43:52,235 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:43:52,303 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,303 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:43:52,384 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,386 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,387 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:43:52,457 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:43:52,510 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30
[2024-03-09 03:43:52,532 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,534 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,536 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:43:52,595 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,596 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:52,627 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,627 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:52,659 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:43:52,660 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:52,726 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:43:52,765 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:43:52,766 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:43:52,787 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_942 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 03:43:52,823 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 03:43:53,125 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)))) is different from false
[2024-03-09 03:43:53,155 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse2 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse2 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse2 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse2 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-03-09 03:43:53,437 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse7 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse2 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse7 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse0 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (let ((.cse5 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse6 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse6 c_threadThread1of2ForFork0_~t~0.base (store (select .cse6 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) .cse7))) (forall ((v_ArrVal_942 (Array Int Int)) (v_ArrVal_941 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (let ((.cse8 (store .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_936))) (store .cse8 c_threadThread1of2ForFork0_~t~0.base (store (select .cse8 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_941) .cse3 v_ArrVal_942) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 03:43:53,502 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:43:53,503 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 64
[2024-03-09 03:43:53,510 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:43:53,511 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 294 treesize of output 218
[2024-03-09 03:43:53,520 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182
[2024-03-09 03:43:53,524 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 158
[2024-03-09 03:43:53,587 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 03:43:53,587 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1
[2024-03-09 03:43:53,594 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 03:43:53,594 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 1
[2024-03-09 03:43:53,602 INFO  L321             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-09 03:43:53,602 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 71 treesize of output 1
[2024-03-09 03:43:53,738 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:43:53,738 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [805467909] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:43:53,738 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:43:53,739 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 32
[2024-03-09 03:43:53,739 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76015605]
[2024-03-09 03:43:53,739 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:43:53,740 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-09 03:43:53,740 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:43:53,740 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-09 03:43:53,741 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=665, Unknown=41, NotChecked=290, Total=1122
[2024-03-09 03:43:53,872 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:43:53,875 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 2277 transitions, 37412 flow. Second operand  has 34 states, 34 states have (on average 59.11764705882353) internal successors, (2010), 34 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:43:53,875 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:43:53,875 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:43:53,875 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:44:13,591 INFO  L130       PetriNetUnfolder]: 19276/32086 cut-off events.
[2024-03-09 03:44:13,591 INFO  L131       PetriNetUnfolder]: For 477083/477085 co-relation queries the response was YES.
[2024-03-09 03:44:13,834 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 277383 conditions, 32086 events. 19276/32086 cut-off events. For 477083/477085 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 232788 event pairs, 1773 based on Foata normal form. 66/31162 useless extension candidates. Maximal degree in co-relation 272333. Up to 26476 conditions per place. 
[2024-03-09 03:44:13,988 INFO  L137   encePairwiseOnDemand]: 158/192 looper letters, 2163 selfloop transitions, 678 changer transitions 0/2843 dead transitions.
[2024-03-09 03:44:13,988 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 2843 transitions, 52304 flow
[2024-03-09 03:44:13,989 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-09 03:44:13,989 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-09 03:44:13,990 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1770 transitions.
[2024-03-09 03:44:13,991 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.36875
[2024-03-09 03:44:13,991 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1770 transitions.
[2024-03-09 03:44:13,991 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1770 transitions.
[2024-03-09 03:44:13,992 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:44:13,992 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1770 transitions.
[2024-03-09 03:44:13,993 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 70.8) internal successors, (1770), 25 states have internal predecessors, (1770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:13,997 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:13,997 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 192.0) internal successors, (4992), 26 states have internal predecessors, (4992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:13,997 INFO  L175             Difference]: Start difference. First operand has 231 places, 2277 transitions, 37412 flow. Second operand 25 states and 1770 transitions.
[2024-03-09 03:44:13,998 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 2843 transitions, 52304 flow
[2024-03-09 03:44:21,657 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2843 transitions, 51554 flow, removed 358 selfloop flow, removed 8 redundant places.
[2024-03-09 03:44:21,697 INFO  L231             Difference]: Finished difference. Result has 258 places, 2509 transitions, 43318 flow
[2024-03-09 03:44:21,699 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=36774, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=472, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=43318, PETRI_PLACES=258, PETRI_TRANSITIONS=2509}
[2024-03-09 03:44:21,699 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 201 predicate places.
[2024-03-09 03:44:21,699 INFO  L495      AbstractCegarLoop]: Abstraction has has 258 places, 2509 transitions, 43318 flow
[2024-03-09 03:44:21,700 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 59.11764705882353) internal successors, (2010), 34 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:21,700 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:44:21,700 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:44:21,705 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-09 03:44:21,900 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-09 03:44:21,901 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:44:21,902 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:44:21,902 INFO  L85        PathProgramCache]: Analyzing trace with hash 1290046147, now seen corresponding path program 4 times
[2024-03-09 03:44:21,903 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:44:21,903 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554388216]
[2024-03-09 03:44:21,903 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:44:21,904 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:44:21,930 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:44:22,397 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:44:22,397 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:44:22,397 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554388216]
[2024-03-09 03:44:22,398 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554388216] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:44:22,398 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650203989]
[2024-03-09 03:44:22,398 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-09 03:44:22,398 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:44:22,398 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:44:22,399 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:44:22,400 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-09 03:44:22,604 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-09 03:44:22,604 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:44:22,606 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 57 conjunts are in the unsatisfiable core
[2024-03-09 03:44:22,611 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:44:22,619 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16
[2024-03-09 03:44:22,767 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:44:22,768 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2024-03-09 03:44:22,776 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:22,777 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 03:44:22,849 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-09 03:44:22,860 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-09 03:44:22,912 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:44:22,959 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:22,960 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:44:23,074 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:44:23,077 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-09 03:44:23,139 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:23,142 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:23,143 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:44:23,215 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:23,216 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:23,217 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:44:23,217 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:44:23,286 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:44:23,315 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:44:23,352 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:44:23,386 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:44:23,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:44:23,524 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:44:23,524 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:44:23,551 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1055 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1055 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1055 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 03:44:23,590 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-09 03:44:23,888 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 03:44:23,910 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 03:44:23,998 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1055 (Array Int Int)) (v_ArrVal_1054 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1054) .cse1 v_ArrVal_1055) c_threadThread1of2ForFork0_~t~0.base) .cse4)))))) is different from false
[2024-03-09 03:44:24,015 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:44:24,015 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2024-03-09 03:44:24,022 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:44:24,022 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 146 treesize of output 82
[2024-03-09 03:44:24,026 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 50
[2024-03-09 03:44:24,029 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28
[2024-03-09 03:44:24,050 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:44:24,051 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:44:24,056 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:44:24,056 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-03-09 03:44:24,062 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:44:24,062 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:44:24,175 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:44:24,175 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650203989] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:44:24,175 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:44:24,175 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2024-03-09 03:44:24,176 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666222574]
[2024-03-09 03:44:24,176 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:44:24,176 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-09 03:44:24,176 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:44:24,177 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-09 03:44:24,177 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=635, Unknown=22, NotChecked=280, Total=1056
[2024-03-09 03:44:24,340 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:44:24,341 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 2509 transitions, 43318 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:24,341 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:44:24,341 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:44:24,342 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:44:27,548 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:44:29,572 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:44:48,709 INFO  L130       PetriNetUnfolder]: 20037/33285 cut-off events.
[2024-03-09 03:44:48,709 INFO  L131       PetriNetUnfolder]: For 559806/559808 co-relation queries the response was YES.
[2024-03-09 03:44:49,012 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 300928 conditions, 33285 events. 20037/33285 cut-off events. For 559806/559808 co-relation queries the response was YES. Maximal size of possible extension queue 919. Compared 242119 event pairs, 1820 based on Foata normal form. 66/32361 useless extension candidates. Maximal degree in co-relation 295614. Up to 27054 conditions per place. 
[2024-03-09 03:44:49,317 INFO  L137   encePairwiseOnDemand]: 159/192 looper letters, 2462 selfloop transitions, 644 changer transitions 0/3108 dead transitions.
[2024-03-09 03:44:49,317 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 3108 transitions, 60052 flow
[2024-03-09 03:44:49,317 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-09 03:44:49,318 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-09 03:44:49,319 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1565 transitions.
[2024-03-09 03:44:49,319 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3705018939393939
[2024-03-09 03:44:49,319 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1565 transitions.
[2024-03-09 03:44:49,319 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1565 transitions.
[2024-03-09 03:44:49,320 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:44:49,320 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1565 transitions.
[2024-03-09 03:44:49,321 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 71.13636363636364) internal successors, (1565), 22 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:49,324 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:49,324 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:49,324 INFO  L175             Difference]: Start difference. First operand has 258 places, 2509 transitions, 43318 flow. Second operand 22 states and 1565 transitions.
[2024-03-09 03:44:49,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 3108 transitions, 60052 flow
[2024-03-09 03:44:59,676 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 3108 transitions, 59432 flow, removed 276 selfloop flow, removed 6 redundant places.
[2024-03-09 03:44:59,722 INFO  L231             Difference]: Finished difference. Result has 282 places, 2744 transitions, 49852 flow
[2024-03-09 03:44:59,723 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=42824, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2509, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=423, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=49852, PETRI_PLACES=282, PETRI_TRANSITIONS=2744}
[2024-03-09 03:44:59,724 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 225 predicate places.
[2024-03-09 03:44:59,724 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 2744 transitions, 49852 flow
[2024-03-09 03:44:59,724 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:44:59,724 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:44:59,724 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:44:59,731 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-09 03:44:59,925 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15
[2024-03-09 03:44:59,926 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:44:59,927 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:44:59,927 INFO  L85        PathProgramCache]: Analyzing trace with hash -1257854249, now seen corresponding path program 5 times
[2024-03-09 03:44:59,927 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:44:59,927 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104605180]
[2024-03-09 03:44:59,928 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:44:59,928 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:44:59,944 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:45:00,392 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:00,392 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:45:00,392 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104605180]
[2024-03-09 03:45:00,392 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104605180] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:45:00,393 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086885695]
[2024-03-09 03:45:00,393 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-09 03:45:00,393 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:45:00,393 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:45:00,394 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:45:00,395 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-09 03:45:00,545 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:45:00,545 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:45:00,546 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-09 03:45:00,551 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:45:00,561 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:00,571 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-09 03:45:00,572 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36
[2024-03-09 03:45:00,783 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:45:00,783 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-09 03:45:00,876 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:00,877 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:45:00,929 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:45:01,001 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 03:45:01,045 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,046 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:45:01,115 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,116 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,117 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:45:01,182 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,184 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,185 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,185 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:45:01,259 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,260 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:45:01,288 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,289 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:45:01,326 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,330 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:45:01,372 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:45:01,373 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:45:01,456 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:45:01,499 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:45:01,499 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:45:01,525 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1167 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1167 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-09 03:45:01,569 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-09 03:45:02,020 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-09 03:45:02,052 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 03:45:02,079 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) .cse1 v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) .cse1 v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) .cse1 v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) .cse4))) (forall ((v_ArrVal_1167 (Array Int Int)) (v_ArrVal_1166 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1166) .cse1 v_ArrVal_1167) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 03:45:02,142 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:02,143 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 58
[2024-03-09 03:45:02,152 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:45:02,152 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 216 treesize of output 146
[2024-03-09 03:45:02,159 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 110
[2024-03-09 03:45:02,162 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102
[2024-03-09 03:45:02,204 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:02,205 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:45:02,212 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:02,213 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 1
[2024-03-09 03:45:02,220 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:45:02,221 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 1
[2024-03-09 03:45:02,343 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:45:02,344 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086885695] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:45:02,344 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:45:02,344 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 31
[2024-03-09 03:45:02,344 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724926141]
[2024-03-09 03:45:02,344 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:45:02,345 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 33 states
[2024-03-09 03:45:02,345 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:45:02,345 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants.
[2024-03-09 03:45:02,346 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=632, Unknown=24, NotChecked=280, Total=1056
[2024-03-09 03:45:02,606 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:45:02,608 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 2744 transitions, 49852 flow. Second operand  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:02,608 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:45:02,608 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:45:02,608 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:45:05,155 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:09,355 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:11,441 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:13,719 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:16,077 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:22,202 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:24,213 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:27,167 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:29,182 WARN  L539   Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]
[2024-03-09 03:45:53,033 INFO  L130       PetriNetUnfolder]: 22200/36628 cut-off events.
[2024-03-09 03:45:53,033 INFO  L131       PetriNetUnfolder]: For 722531/722533 co-relation queries the response was YES.
[2024-03-09 03:45:53,406 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 352635 conditions, 36628 events. 22200/36628 cut-off events. For 722531/722533 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 268099 event pairs, 1884 based on Foata normal form. 78/35716 useless extension candidates. Maximal degree in co-relation 345129. Up to 28451 conditions per place. 
[2024-03-09 03:45:53,593 INFO  L137   encePairwiseOnDemand]: 159/192 looper letters, 3130 selfloop transitions, 748 changer transitions 0/3880 dead transitions.
[2024-03-09 03:45:53,593 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 3880 transitions, 80441 flow
[2024-03-09 03:45:53,594 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-03-09 03:45:53,594 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-03-09 03:45:53,595 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 1625 transitions.
[2024-03-09 03:45:53,596 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3679800724637681
[2024-03-09 03:45:53,596 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 1625 transitions.
[2024-03-09 03:45:53,596 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 1625 transitions.
[2024-03-09 03:45:53,596 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:45:53,596 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 1625 transitions.
[2024-03-09 03:45:53,598 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 70.65217391304348) internal successors, (1625), 23 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,601 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,601 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 192.0) internal successors, (4608), 24 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:45:53,601 INFO  L175             Difference]: Start difference. First operand has 282 places, 2744 transitions, 49852 flow. Second operand 23 states and 1625 transitions.
[2024-03-09 03:45:53,601 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 3880 transitions, 80441 flow
[2024-03-09 03:46:08,887 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 3880 transitions, 79323 flow, removed 454 selfloop flow, removed 9 redundant places.
[2024-03-09 03:46:08,945 INFO  L231             Difference]: Finished difference. Result has 309 places, 3259 transitions, 63614 flow
[2024-03-09 03:46:08,947 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=49250, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=252, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=63614, PETRI_PLACES=309, PETRI_TRANSITIONS=3259}
[2024-03-09 03:46:08,947 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 252 predicate places.
[2024-03-09 03:46:08,948 INFO  L495      AbstractCegarLoop]: Abstraction has has 309 places, 3259 transitions, 63614 flow
[2024-03-09 03:46:08,948 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 33 states, 33 states have (on average 59.18181818181818) internal successors, (1953), 33 states have internal predecessors, (1953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:08,948 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:46:08,948 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:46:08,957 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-09 03:46:09,149 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-09 03:46:09,150 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:46:09,150 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:46:09,151 INFO  L85        PathProgramCache]: Analyzing trace with hash 1115411521, now seen corresponding path program 6 times
[2024-03-09 03:46:09,151 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:46:09,151 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361190184]
[2024-03-09 03:46:09,151 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:46:09,152 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:46:09,171 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:46:09,685 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:09,685 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:46:09,686 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361190184]
[2024-03-09 03:46:09,686 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361190184] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:46:09,686 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269204302]
[2024-03-09 03:46:09,686 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-09 03:46:09,687 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:46:09,687 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:46:09,688 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:46:09,690 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-09 03:46:09,866 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-09 03:46:09,866 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:46:09,867 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-09 03:46:09,871 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:46:09,885 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:09,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-09 03:46:10,111 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:46:10,112 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 03:46:10,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,182 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24
[2024-03-09 03:46:10,247 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:46:10,377 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:46:10,449 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,450 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16
[2024-03-09 03:46:10,479 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,480 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:46:10,544 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,545 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:46:10,570 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,571 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:46:10,590 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,591 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:46:10,646 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,647 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,649 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:46:10,709 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,710 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,712 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:46:10,715 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:46:10,833 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:46:10,878 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:10,878 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:46:11,111 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1278 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1278 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 03:46:11,133 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1278 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1278 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-09 03:46:11,163 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1273))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1273))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (= (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1273))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1273 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse5 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1273))) (store .cse5 c_threadThread1of2ForFork0_~t~0.base (store (store (select .cse5 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1278) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))))) is different from false
[2024-03-09 03:46:11,633 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:46:11,634 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [269204302] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:46:11,634 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:46:11,634 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 30
[2024-03-09 03:46:11,635 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173315779]
[2024-03-09 03:46:11,635 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:46:11,636 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-09 03:46:11,636 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:46:11,637 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-09 03:46:11,638 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=677, Unknown=36, NotChecked=168, Total=992
[2024-03-09 03:46:11,768 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:46:11,770 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 3259 transitions, 63614 flow. Second operand  has 32 states, 32 states have (on average 59.125) internal successors, (1892), 32 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:11,770 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:46:11,770 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:46:11,770 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:46:40,547 INFO  L130       PetriNetUnfolder]: 23025/37958 cut-off events.
[2024-03-09 03:46:40,547 INFO  L131       PetriNetUnfolder]: For 855853/855853 co-relation queries the response was YES.
[2024-03-09 03:46:41,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 381832 conditions, 37958 events. 23025/37958 cut-off events. For 855853/855853 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 279089 event pairs, 1879 based on Foata normal form. 64/37032 useless extension candidates. Maximal degree in co-relation 375060. Up to 27896 conditions per place. 
[2024-03-09 03:46:41,376 INFO  L137   encePairwiseOnDemand]: 174/192 looper letters, 2770 selfloop transitions, 1165 changer transitions 0/3937 dead transitions.
[2024-03-09 03:46:41,377 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 3937 transitions, 84521 flow
[2024-03-09 03:46:41,377 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-09 03:46:41,377 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-09 03:46:41,378 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1302 transitions.
[2024-03-09 03:46:41,379 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3767361111111111
[2024-03-09 03:46:41,379 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1302 transitions.
[2024-03-09 03:46:41,379 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1302 transitions.
[2024-03-09 03:46:41,380 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:46:41,380 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1302 transitions.
[2024-03-09 03:46:41,381 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 72.33333333333333) internal successors, (1302), 18 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,383 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,384 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 192.0) internal successors, (3648), 19 states have internal predecessors, (3648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:46:41,384 INFO  L175             Difference]: Start difference. First operand has 309 places, 3259 transitions, 63614 flow. Second operand 18 states and 1302 transitions.
[2024-03-09 03:46:41,384 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 3937 transitions, 84521 flow
[2024-03-09 03:47:04,730 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 3937 transitions, 83717 flow, removed 385 selfloop flow, removed 5 redundant places.
[2024-03-09 03:47:04,796 INFO  L231             Difference]: Finished difference. Result has 330 places, 3503 transitions, 72755 flow
[2024-03-09 03:47:04,798 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=62818, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=930, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=72755, PETRI_PLACES=330, PETRI_TRANSITIONS=3503}
[2024-03-09 03:47:04,798 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 273 predicate places.
[2024-03-09 03:47:04,798 INFO  L495      AbstractCegarLoop]: Abstraction has has 330 places, 3503 transitions, 72755 flow
[2024-03-09 03:47:04,799 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 59.125) internal successors, (1892), 32 states have internal predecessors, (1892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:04,799 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:47:04,799 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:47:04,806 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0
[2024-03-09 03:47:04,999 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-03-09 03:47:05,000 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:47:05,001 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:47:05,001 INFO  L85        PathProgramCache]: Analyzing trace with hash 1510551795, now seen corresponding path program 1 times
[2024-03-09 03:47:05,001 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:47:05,001 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861672608]
[2024-03-09 03:47:05,002 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:47:05,002 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:47:05,025 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:47:05,381 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:05,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:47:05,382 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861672608]
[2024-03-09 03:47:05,382 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861672608] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:47:05,382 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596086110]
[2024-03-09 03:47:05,382 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:47:05,382 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:47:05,383 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:47:05,384 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:47:05,385 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-03-09 03:47:05,551 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:47:05,552 INFO  L263         TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 40 conjunts are in the unsatisfiable core
[2024-03-09 03:47:05,562 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:47:05,572 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:47:05,577 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-09 03:47:05,577 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36
[2024-03-09 03:47:05,711 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:47:05,711 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-09 03:47:05,768 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:47:05,770 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23
[2024-03-09 03:47:05,825 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 03:47:05,846 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-03-09 03:47:05,856 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-03-09 03:47:05,873 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:05,874 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-03-09 03:47:05,889 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40
[2024-03-09 03:47:05,907 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:47:05,908 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-03-09 03:47:05,919 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:47:05,920 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:47:06,284 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1381 (Array Int Int)) (v_ArrVal_1380 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1380) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1381) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 03:47:06,285 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:47:06,286 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596086110] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:47:06,286 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:47:06,286 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20
[2024-03-09 03:47:06,286 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670507292]
[2024-03-09 03:47:06,287 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:47:06,287 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-09 03:47:06,287 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:47:06,288 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-09 03:47:06,288 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=328, Unknown=26, NotChecked=38, Total=462
[2024-03-09 03:47:06,571 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 54 out of 192
[2024-03-09 03:47:06,572 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 3503 transitions, 72755 flow. Second operand  has 22 states, 22 states have (on average 56.31818181818182) internal successors, (1239), 22 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:06,572 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:47:06,572 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 192
[2024-03-09 03:47:06,573 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:47:38,044 INFO  L130       PetriNetUnfolder]: 24699/40596 cut-off events.
[2024-03-09 03:47:38,044 INFO  L131       PetriNetUnfolder]: For 1029197/1029199 co-relation queries the response was YES.
[2024-03-09 03:47:38,766 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 425694 conditions, 40596 events. 24699/40596 cut-off events. For 1029197/1029199 co-relation queries the response was YES. Maximal size of possible extension queue 1132. Compared 300818 event pairs, 1841 based on Foata normal form. 150/39756 useless extension candidates. Maximal degree in co-relation 420711. Up to 24028 conditions per place. 
[2024-03-09 03:47:38,987 INFO  L137   encePairwiseOnDemand]: 170/192 looper letters, 3501 selfloop transitions, 1636 changer transitions 0/5139 dead transitions.
[2024-03-09 03:47:38,987 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 5139 transitions, 115991 flow
[2024-03-09 03:47:38,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-09 03:47:38,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-09 03:47:38,989 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1398 transitions.
[2024-03-09 03:47:38,989 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.34672619047619047
[2024-03-09 03:47:38,989 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1398 transitions.
[2024-03-09 03:47:38,990 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1398 transitions.
[2024-03-09 03:47:38,990 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:47:38,990 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1398 transitions.
[2024-03-09 03:47:38,991 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 66.57142857142857) internal successors, (1398), 21 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,994 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,994 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 192.0) internal successors, (4224), 22 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:47:38,995 INFO  L175             Difference]: Start difference. First operand has 330 places, 3503 transitions, 72755 flow. Second operand 21 states and 1398 transitions.
[2024-03-09 03:47:38,995 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 5139 transitions, 115991 flow
[2024-03-09 03:48:09,221 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 5139 transitions, 114819 flow, removed 504 selfloop flow, removed 7 redundant places.
[2024-03-09 03:48:09,326 INFO  L231             Difference]: Finished difference. Result has 356 places, 4291 transitions, 94560 flow
[2024-03-09 03:48:09,327 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=71790, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=900, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=94560, PETRI_PLACES=356, PETRI_TRANSITIONS=4291}
[2024-03-09 03:48:09,328 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 299 predicate places.
[2024-03-09 03:48:09,328 INFO  L495      AbstractCegarLoop]: Abstraction has has 356 places, 4291 transitions, 94560 flow
[2024-03-09 03:48:09,328 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 56.31818181818182) internal successors, (1239), 22 states have internal predecessors, (1239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:09,328 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:48:09,329 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:48:09,336 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-03-09 03:48:09,529 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:48:09,530 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:48:09,531 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:48:09,531 INFO  L85        PathProgramCache]: Analyzing trace with hash 726228861, now seen corresponding path program 7 times
[2024-03-09 03:48:09,531 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:48:09,531 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97782361]
[2024-03-09 03:48:09,532 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:48:09,532 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:48:09,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:48:09,893 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:48:09,894 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:48:09,894 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97782361]
[2024-03-09 03:48:09,894 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97782361] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:48:09,894 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651936476]
[2024-03-09 03:48:09,894 INFO  L93    rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY
[2024-03-09 03:48:09,895 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:48:09,895 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:48:09,896 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:48:09,898 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-03-09 03:48:10,049 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:48:10,050 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 37 conjunts are in the unsatisfiable core
[2024-03-09 03:48:10,053 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:48:10,074 INFO  L321             Elim1Store]: treesize reduction 11, result has 8.3 percent of original size
[2024-03-09 03:48:10,075 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 112
[2024-03-09 03:48:10,187 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:48:10,188 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28
[2024-03-09 03:48:10,253 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-03-09 03:48:10,274 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:48:10,283 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:48:10,298 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:48:10,298 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:48:10,319 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:48:10,320 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:48:10,342 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:48:10,357 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:48:10,357 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:48:10,382 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-09 03:48:10,403 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-09 03:48:10,425 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1497 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 03:48:10,446 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1497 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1497 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1497) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 03:48:10,465 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:48:10,465 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 49
[2024-03-09 03:48:10,473 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:48:10,473 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 30
[2024-03-09 03:48:10,484 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:48:10,484 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:48:10,492 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:48:10,492 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:48:10,499 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:48:10,500 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-09 03:48:10,531 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1488) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-09 03:48:10,554 WARN  L837   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1488 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1488) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_~t~1#1.base|))) is different from false
[2024-03-09 03:48:10,555 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-09 03:48:10,556 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651936476] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:48:10,556 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:48:10,556 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 20
[2024-03-09 03:48:10,556 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379759144]
[2024-03-09 03:48:10,557 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:48:10,557 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 22 states
[2024-03-09 03:48:10,557 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:48:10,558 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants.
[2024-03-09 03:48:10,558 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=197, Unknown=6, NotChecked=198, Total=462
[2024-03-09 03:48:10,655 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:48:10,656 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 4291 transitions, 94560 flow. Second operand  has 22 states, 22 states have (on average 59.27272727272727) internal successors, (1304), 22 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:48:10,656 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:48:10,656 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:48:10,657 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:49:02,291 INFO  L130       PetriNetUnfolder]: 36568/59269 cut-off events.
[2024-03-09 03:49:02,291 INFO  L131       PetriNetUnfolder]: For 1547634/1547636 co-relation queries the response was YES.
[2024-03-09 03:49:03,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 624028 conditions, 59269 events. 36568/59269 cut-off events. For 1547634/1547636 co-relation queries the response was YES. Maximal size of possible extension queue 1646. Compared 458425 event pairs, 2489 based on Foata normal form. 135/57255 useless extension candidates. Maximal degree in co-relation 618650. Up to 24206 conditions per place. 
[2024-03-09 03:49:03,704 INFO  L137   encePairwiseOnDemand]: 160/192 looper letters, 5254 selfloop transitions, 1073 changer transitions 1/6330 dead transitions.
[2024-03-09 03:49:03,704 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 6330 transitions, 143925 flow
[2024-03-09 03:49:03,705 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. 
[2024-03-09 03:49:03,705 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2024-03-09 03:49:03,706 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1627 transitions.
[2024-03-09 03:49:03,707 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.38517992424242425
[2024-03-09 03:49:03,707 INFO  L72            ComplementDD]: Start complementDD. Operand 22 states and 1627 transitions.
[2024-03-09 03:49:03,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 22 states and 1627 transitions.
[2024-03-09 03:49:03,707 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:49:03,707 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 1627 transitions.
[2024-03-09 03:49:03,709 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 23 states, 22 states have (on average 73.95454545454545) internal successors, (1627), 22 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:03,712 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:03,712 INFO  L81            ComplementDD]: Finished complementDD. Result  has 23 states, 23 states have (on average 192.0) internal successors, (4416), 23 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:49:03,712 INFO  L175             Difference]: Start difference. First operand has 356 places, 4291 transitions, 94560 flow. Second operand 22 states and 1627 transitions.
[2024-03-09 03:49:03,712 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 6330 transitions, 143925 flow
[2024-03-09 03:50:08,369 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 6330 transitions, 143302 flow, removed 258 selfloop flow, removed 4 redundant places.
[2024-03-09 03:50:08,469 INFO  L231             Difference]: Finished difference. Result has 390 places, 4736 transitions, 107350 flow
[2024-03-09 03:50:08,472 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=94193, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=641, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=107350, PETRI_PLACES=390, PETRI_TRANSITIONS=4736}
[2024-03-09 03:50:08,472 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 333 predicate places.
[2024-03-09 03:50:08,472 INFO  L495      AbstractCegarLoop]: Abstraction has has 390 places, 4736 transitions, 107350 flow
[2024-03-09 03:50:08,473 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 22 states, 22 states have (on average 59.27272727272727) internal successors, (1304), 22 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:50:08,473 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:50:08,473 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:50:08,478 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-03-09 03:50:08,677 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:50:08,678 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:50:08,678 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:50:08,678 INFO  L85        PathProgramCache]: Analyzing trace with hash 726126561, now seen corresponding path program 8 times
[2024-03-09 03:50:08,679 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:50:08,679 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611378621]
[2024-03-09 03:50:08,679 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:50:08,679 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:50:08,701 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:50:09,005 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:09,005 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:50:09,005 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611378621]
[2024-03-09 03:50:09,005 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611378621] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:50:09,006 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2026314360]
[2024-03-09 03:50:09,006 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-09 03:50:09,006 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:50:09,006 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:50:09,007 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:50:09,009 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-03-09 03:50:09,199 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-09 03:50:09,199 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:50:09,201 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-09 03:50:09,204 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:50:09,215 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 58
[2024-03-09 03:50:09,424 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:50:09,424 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37
[2024-03-09 03:50:09,433 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,434 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20
[2024-03-09 03:50:09,569 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:50:09,576 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7
[2024-03-09 03:50:09,698 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:50:09,742 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,742 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:50:09,811 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,813 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,813 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:50:09,876 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,877 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,879 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42
[2024-03-09 03:50:09,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,945 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,947 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:50:09,950 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:50:09,950 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:50:09,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:09,997 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:50:11,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:50:11,375 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2026314360] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:50:11,375 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:50:11,375 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 32
[2024-03-09 03:50:11,375 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903492450]
[2024-03-09 03:50:11,375 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:50:11,376 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-09 03:50:11,376 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:50:11,376 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-09 03:50:11,377 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=955, Unknown=15, NotChecked=0, Total=1122
[2024-03-09 03:50:14,995 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 192
[2024-03-09 03:50:14,998 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 4736 transitions, 107350 flow. Second operand  has 34 states, 34 states have (on average 54.14705882352941) internal successors, (1841), 34 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:50:14,998 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:50:14,999 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 192
[2024-03-09 03:50:14,999 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:51:20,136 INFO  L130       PetriNetUnfolder]: 38259/62405 cut-off events.
[2024-03-09 03:51:20,136 INFO  L131       PetriNetUnfolder]: For 1968150/1968152 co-relation queries the response was YES.
[2024-03-09 03:51:21,481 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 694537 conditions, 62405 events. 38259/62405 cut-off events. For 1968150/1968152 co-relation queries the response was YES. Maximal size of possible extension queue 1730. Compared 491886 event pairs, 4041 based on Foata normal form. 190/62573 useless extension candidates. Maximal degree in co-relation 692417. Up to 46187 conditions per place. 
[2024-03-09 03:51:21,836 INFO  L137   encePairwiseOnDemand]: 168/192 looper letters, 5226 selfloop transitions, 815 changer transitions 5/6048 dead transitions.
[2024-03-09 03:51:21,836 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 6048 transitions, 143623 flow
[2024-03-09 03:51:21,837 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. 
[2024-03-09 03:51:21,837 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2024-03-09 03:51:21,838 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1078 transitions.
[2024-03-09 03:51:21,838 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3509114583333333
[2024-03-09 03:51:21,838 INFO  L72            ComplementDD]: Start complementDD. Operand 16 states and 1078 transitions.
[2024-03-09 03:51:21,838 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 16 states and 1078 transitions.
[2024-03-09 03:51:21,839 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:51:21,839 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1078 transitions.
[2024-03-09 03:51:21,840 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 17 states, 16 states have (on average 67.375) internal successors, (1078), 16 states have internal predecessors, (1078), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:21,842 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 17 states, 17 states have (on average 192.0) internal successors, (3264), 17 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:21,842 INFO  L81            ComplementDD]: Finished complementDD. Result  has 17 states, 17 states have (on average 192.0) internal successors, (3264), 17 states have internal predecessors, (3264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:51:21,842 INFO  L175             Difference]: Start difference. First operand has 390 places, 4736 transitions, 107350 flow. Second operand 16 states and 1078 transitions.
[2024-03-09 03:51:21,842 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 6048 transitions, 143623 flow
[2024-03-09 03:52:45,428 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 402 places, 6048 transitions, 142656 flow, removed 432 selfloop flow, removed 3 redundant places.
[2024-03-09 03:52:45,527 INFO  L231             Difference]: Finished difference. Result has 411 places, 5228 transitions, 120395 flow
[2024-03-09 03:52:45,531 INFO  L271   CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=106443, PETRI_DIFFERENCE_MINUEND_PLACES=387, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=446, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=4101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=120395, PETRI_PLACES=411, PETRI_TRANSITIONS=5228}
[2024-03-09 03:52:45,531 INFO  L288   CegarLoopForPetriNet]: 57 programPoint places, 354 predicate places.
[2024-03-09 03:52:45,531 INFO  L495      AbstractCegarLoop]: Abstraction has has 411 places, 5228 transitions, 120395 flow
[2024-03-09 03:52:45,531 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 54.14705882352941) internal successors, (1841), 34 states have internal predecessors, (1841), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:52:45,532 INFO  L201   CegarLoopForPetriNet]: Found error trace
[2024-03-09 03:52:45,532 INFO  L209   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-09 03:52:45,538 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-03-09 03:52:45,732 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20
[2024-03-09 03:52:45,734 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-09 03:52:45,734 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-09 03:52:45,735 INFO  L85        PathProgramCache]: Analyzing trace with hash 922624721, now seen corresponding path program 9 times
[2024-03-09 03:52:45,735 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-09 03:52:45,735 INFO  L333   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398790816]
[2024-03-09 03:52:45,735 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-09 03:52:45,736 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-09 03:52:45,755 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-09 03:52:46,160 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:46,161 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-09 03:52:46,161 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398790816]
[2024-03-09 03:52:46,161 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398790816] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-09 03:52:46,161 INFO  L333   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137058721]
[2024-03-09 03:52:46,161 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-09 03:52:46,161 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-09 03:52:46,162 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3
[2024-03-09 03:52:46,163 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-09 03:52:46,164 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-03-09 03:52:46,360 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-09 03:52:46,360 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-09 03:52:46,362 INFO  L263         TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 44 conjunts are in the unsatisfiable core
[2024-03-09 03:52:46,366 INFO  L286         TraceCheckSpWp]: Computing forward predicates...
[2024-03-09 03:52:46,383 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:46,388 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24
[2024-03-09 03:52:46,569 INFO  L321             Elim1Store]: treesize reduction 15, result has 25.0 percent of original size
[2024-03-09 03:52:46,570 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29
[2024-03-09 03:52:46,680 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-03-09 03:52:46,796 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-03-09 03:52:46,859 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:46,861 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20
[2024-03-09 03:52:46,935 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:46,936 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:46,937 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32
[2024-03-09 03:52:47,014 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:47,015 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:47,016 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:47,017 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44
[2024-03-09 03:52:47,095 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-09 03:52:47,096 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:52:47,181 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37
[2024-03-09 03:52:47,239 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:47,239 INFO  L328         TraceCheckSpWp]: Computing backward predicates...
[2024-03-09 03:52:47,264 WARN  L837   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1712 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1712 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1712 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1712 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-09 03:52:47,723 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-09 03:52:47,742 WARN  L837   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1711 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1711) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1712) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-09 03:52:47,760 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:52:47,760 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54
[2024-03-09 03:52:47,767 INFO  L321             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-09 03:52:47,767 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 204 treesize of output 130
[2024-03-09 03:52:47,775 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43
[2024-03-09 03:52:47,778 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 78
[2024-03-09 03:52:47,808 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:52:47,808 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-03-09 03:52:47,816 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:52:47,816 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 1
[2024-03-09 03:52:47,822 INFO  L321             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-09 03:52:47,823 INFO  L350             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 1
[2024-03-09 03:52:47,979 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-09 03:52:47,979 INFO  L157   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137058721] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-09 03:52:47,979 INFO  L184   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-09 03:52:47,979 INFO  L197   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 30
[2024-03-09 03:52:47,980 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977566593]
[2024-03-09 03:52:47,980 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-09 03:52:47,980 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-09 03:52:47,980 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-09 03:52:47,981 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-09 03:52:47,981 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=662, Unknown=32, NotChecked=168, Total=992
[2024-03-09 03:52:48,039 INFO  L478   CegarLoopForPetriNet]: Number of universal loopers: 57 out of 192
[2024-03-09 03:52:48,041 INFO  L100   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 5228 transitions, 120395 flow. Second operand  has 32 states, 32 states have (on average 59.0625) internal successors, (1890), 32 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:52:48,041 INFO  L109   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-09 03:52:48,041 INFO  L110   encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 192
[2024-03-09 03:52:48,041 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-09 03:54:04,256 INFO  L130       PetriNetUnfolder]: 39186/64167 cut-off events.
[2024-03-09 03:54:04,256 INFO  L131       PetriNetUnfolder]: For 2254016/2254018 co-relation queries the response was YES.
[2024-03-09 03:54:05,672 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 736088 conditions, 64167 events. 39186/64167 cut-off events. For 2254016/2254018 co-relation queries the response was YES. Maximal size of possible extension queue 1770. Compared 510242 event pairs, 3604 based on Foata normal form. 155/64300 useless extension candidates. Maximal degree in co-relation 733289. Up to 23128 conditions per place. 
[2024-03-09 03:54:06,078 INFO  L137   encePairwiseOnDemand]: 161/192 looper letters, 5298 selfloop transitions, 1774 changer transitions 1/7075 dead transitions.
[2024-03-09 03:54:06,079 INFO  L142   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 7075 transitions, 169835 flow
[2024-03-09 03:54:06,079 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-03-09 03:54:06,080 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-03-09 03:54:06,080 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1488 transitions.
[2024-03-09 03:54:06,081 INFO  L523   CegarLoopForPetriNet]: DFA transition density 0.3875
[2024-03-09 03:54:06,081 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 1488 transitions.
[2024-03-09 03:54:06,081 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 1488 transitions.
[2024-03-09 03:54:06,081 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-09 03:54:06,081 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1488 transitions.
[2024-03-09 03:54:06,083 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 74.4) internal successors, (1488), 20 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:06,085 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:06,086 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 192.0) internal successors, (4032), 21 states have internal predecessors, (4032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-09 03:54:06,086 INFO  L175             Difference]: Start difference. First operand has 411 places, 5228 transitions, 120395 flow. Second operand 20 states and 1488 transitions.
[2024-03-09 03:54:06,086 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 7075 transitions, 169835 flow
Killed by 15
