./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.i --full-output --architecture 32bit


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


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --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 3a3145affc8b47741798715331effced1e2f2146562f74e2adfa90aa8d74930a
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:20:35,077 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:20:35,120 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 01:20:35,126 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:20:35,126 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:20:35,146 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:20:35,146 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:20:35,147 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:20:35,147 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:20:35,147 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:20:35,148 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:20:35,148 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:20:35,148 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:20:35,149 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:20:35,149 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:20:35,149 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:20:35,149 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:20:35,150 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:20:35,150 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:20:35,150 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:20:35,150 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:20:35,151 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:20:35,151 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:20:35,151 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:20:35,151 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:20:35,152 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:20:35,152 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:20:35,152 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:20:35,152 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:20:35,153 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:20:35,153 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:20:35,153 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:20:35,153 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:20:35,153 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:20:35,154 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:20:35,155 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:20:35,155 INFO  L153        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-pldi24/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-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
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 -> 3a3145affc8b47741798715331effced1e2f2146562f74e2adfa90aa8d74930a
[2024-03-12 01:20:35,314 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:20:35,330 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:20:35,331 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:20:35,332 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:20:35,333 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:20:35,334 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-03-12 01:20:36,477 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:20:36,689 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:20:36,689 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct.i
[2024-03-12 01:20:36,702 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c1bb6c436/ee03a1896c294dbd839da8adab5f2445/FLAG17c8d084d
[2024-03-12 01:20:36,712 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/c1bb6c436/ee03a1896c294dbd839da8adab5f2445
[2024-03-12 01:20:36,714 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:20:36,715 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:20:36,716 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:20:36,716 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:20:36,720 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:20:36,721 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:20:36" (1/1) ...
[2024-03-12 01:20:36,721 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24beed79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:36, skipping insertion in model container
[2024-03-12 01:20:36,721 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:20:36" (1/1) ...
[2024-03-12 01:20:36,758 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:20:37,041 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:20:37,047 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:20:37,134 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:20:37,203 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:20:37,204 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37 WrapperNode
[2024-03-12 01:20:37,204 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:20:37,205 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:20:37,205 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:20:37,205 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:20:37,210 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,224 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,242 INFO  L138                Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79
[2024-03-12 01:20:37,243 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:20:37,243 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:20:37,243 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:20:37,243 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:20:37,250 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,251 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,254 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,254 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,262 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,266 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,269 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,271 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,275 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:20:37,277 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:20:37,277 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:20:37,277 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:20:37,277 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (1/1) ...
[2024-03-12 01:20:37,282 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:20:37,290 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:20:37,302 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-03-12 01:20:37,308 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 01:20:37,342 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:20:37,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:20:37,343 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:20:37,343 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:20:37,344 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-03-12 01:20:37,507 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:20:37,508 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:20:37,665 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:20:37,674 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:20:37,674 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:20:37,675 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:20:37 BoogieIcfgContainer
[2024-03-12 01:20:37,675 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:20:37,677 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:20:37,677 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:20:37,679 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:20:37,679 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:20:36" (1/3) ...
[2024-03-12 01:20:37,680 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc7cdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:20:37, skipping insertion in model container
[2024-03-12 01:20:37,680 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:20:37" (2/3) ...
[2024-03-12 01:20:37,680 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc7cdab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:20:37, skipping insertion in model container
[2024-03-12 01:20:37,680 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:20:37" (3/3) ...
[2024-03-12 01:20:37,681 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct.i
[2024-03-12 01:20:37,687 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:20:37,695 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:20:37,695 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-12 01:20:37,695 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:20:37,738 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:20:37,765 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow
[2024-03-12 01:20:37,812 INFO  L124   PetriNetUnfolderBase]: 6/154 cut-off events.
[2024-03-12 01:20:37,812 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:20:37,816 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 6/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 304 event pairs, 0 based on Foata normal form. 0/136 useless extension candidates. Maximal degree in co-relation 74. Up to 4 conditions per place. 
[2024-03-12 01:20:37,816 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow
[2024-03-12 01:20:37,819 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow
[2024-03-12 01:20:37,826 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:20:37,831 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=LoopHeads, 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;@864bb5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:20:37,832 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-12 01:20:37,841 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:20:37,841 INFO  L124   PetriNetUnfolderBase]: 3/48 cut-off events.
[2024-03-12 01:20:37,841 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:20:37,841 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:37,842 INFO  L208   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, 1, 1]
[2024-03-12 01:20:37,842 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:20:37,846 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:37,846 INFO  L85        PathProgramCache]: Analyzing trace with hash 1739621941, now seen corresponding path program 1 times
[2024-03-12 01:20:37,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:37,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509371637]
[2024-03-12 01:20:37,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:37,854 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:37,950 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:38,125 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-12 01:20:38,125 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:38,125 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509371637]
[2024-03-12 01:20:38,126 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509371637] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:38,126 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:38,126 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:38,127 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395841299]
[2024-03-12 01:20:38,128 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:38,134 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:20:38,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:38,156 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:20:38,156 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:20:38,227 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103
[2024-03-12 01:20:38,229 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 flow. Second operand  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-12 01:20:38,230 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:38,230 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103
[2024-03-12 01:20:38,230 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:38,278 INFO  L124   PetriNetUnfolderBase]: 1/165 cut-off events.
[2024-03-12 01:20:38,278 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-03-12 01:20:38,279 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 192 conditions, 165 events. 1/165 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs, 0 based on Foata normal form. 2/156 useless extension candidates. Maximal degree in co-relation 40. Up to 16 conditions per place. 
[2024-03-12 01:20:38,280 INFO  L140   encePairwiseOnDemand]: 92/103 looper letters, 11 selfloop transitions, 6 changer transitions 2/105 dead transitions.
[2024-03-12 01:20:38,280 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 105 transitions, 253 flow
[2024-03-12 01:20:38,281 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:38,283 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:38,289 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 546 transitions.
[2024-03-12 01:20:38,292 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.883495145631068
[2024-03-12 01:20:38,293 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 546 transitions.
[2024-03-12 01:20:38,293 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 546 transitions.
[2024-03-12 01:20:38,295 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:38,296 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 546 transitions.
[2024-03-12 01:20:38,300 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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-12 01:20:38,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:38,306 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:38,307 INFO  L175             Difference]: Start difference. First operand has 102 places, 103 transitions, 213 flow. Second operand 6 states and 546 transitions.
[2024-03-12 01:20:38,308 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 105 transitions, 253 flow
[2024-03-12 01:20:38,310 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 253 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:20:38,312 INFO  L231             Difference]: Finished difference. Result has 111 places, 103 transitions, 247 flow
[2024-03-12 01:20:38,314 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=247, PETRI_PLACES=111, PETRI_TRANSITIONS=103}
[2024-03-12 01:20:38,317 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 9 predicate places.
[2024-03-12 01:20:38,317 INFO  L495      AbstractCegarLoop]: Abstraction has has 111 places, 103 transitions, 247 flow
[2024-03-12 01:20:38,317 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-12 01:20:38,317 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:38,318 INFO  L208   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, 1, 1, 1]
[2024-03-12 01:20:38,318 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:20:38,318 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:20:38,318 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:38,318 INFO  L85        PathProgramCache]: Analyzing trace with hash 2126181978, now seen corresponding path program 1 times
[2024-03-12 01:20:38,319 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:38,319 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267240252]
[2024-03-12 01:20:38,319 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:38,319 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:38,339 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:38,587 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-12 01:20:38,587 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:38,588 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267240252]
[2024-03-12 01:20:38,588 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267240252] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:38,588 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:38,588 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:38,588 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898930414]
[2024-03-12 01:20:38,588 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:38,589 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:20:38,589 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:38,590 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:20:38,590 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:20:38,825 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 103
[2024-03-12 01:20:38,825 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 103 transitions, 247 flow. Second operand  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-12 01:20:38,825 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:38,825 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 103
[2024-03-12 01:20:38,825 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:38,987 INFO  L124   PetriNetUnfolderBase]: 116/602 cut-off events.
[2024-03-12 01:20:38,987 INFO  L125   PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES.
[2024-03-12 01:20:38,989 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 951 conditions, 602 events. 116/602 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3361 event pairs, 9 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 861. Up to 195 conditions per place. 
[2024-03-12 01:20:38,990 INFO  L140   encePairwiseOnDemand]: 80/103 looper letters, 38 selfloop transitions, 29 changer transitions 4/142 dead transitions.
[2024-03-12 01:20:38,991 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 142 transitions, 462 flow
[2024-03-12 01:20:38,991 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:38,991 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:38,992 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 502 transitions.
[2024-03-12 01:20:38,993 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8122977346278317
[2024-03-12 01:20:38,993 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 502 transitions.
[2024-03-12 01:20:38,993 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 502 transitions.
[2024-03-12 01:20:38,993 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:38,993 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 502 transitions.
[2024-03-12 01:20:38,994 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 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-12 01:20:38,996 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:38,996 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:38,996 INFO  L175             Difference]: Start difference. First operand has 111 places, 103 transitions, 247 flow. Second operand 6 states and 502 transitions.
[2024-03-12 01:20:38,996 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 142 transitions, 462 flow
[2024-03-12 01:20:38,998 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 142 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:20:39,000 INFO  L231             Difference]: Finished difference. Result has 119 places, 128 transitions, 441 flow
[2024-03-12 01:20:39,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=441, PETRI_PLACES=119, PETRI_TRANSITIONS=128}
[2024-03-12 01:20:39,001 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 17 predicate places.
[2024-03-12 01:20:39,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 119 places, 128 transitions, 441 flow
[2024-03-12 01:20:39,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 73.16666666666667) internal successors, (439), 6 states have internal predecessors, (439), 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-12 01:20:39,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:39,001 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:20:39,002 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:20:39,002 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:20:39,002 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:39,002 INFO  L85        PathProgramCache]: Analyzing trace with hash 382970382, now seen corresponding path program 1 times
[2024-03-12 01:20:39,002 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:39,002 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472007556]
[2024-03-12 01:20:39,003 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:39,003 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:39,022 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:39,264 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-12 01:20:39,264 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:39,265 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472007556]
[2024-03-12 01:20:39,265 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472007556] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:39,265 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:39,265 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:39,265 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550759637]
[2024-03-12 01:20:39,265 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:39,266 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:20:39,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:39,266 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:20:39,266 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:20:39,389 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103
[2024-03-12 01:20:39,390 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 128 transitions, 441 flow. Second operand  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-12 01:20:39,390 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:39,390 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103
[2024-03-12 01:20:39,390 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:39,771 INFO  L124   PetriNetUnfolderBase]: 337/1201 cut-off events.
[2024-03-12 01:20:39,771 INFO  L125   PetriNetUnfolderBase]: For 446/544 co-relation queries the response was YES.
[2024-03-12 01:20:39,776 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2766 conditions, 1201 events. 337/1201 cut-off events. For 446/544 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 8525 event pairs, 67 based on Foata normal form. 15/1149 useless extension candidates. Maximal degree in co-relation 2579. Up to 597 conditions per place. 
[2024-03-12 01:20:39,779 INFO  L140   encePairwiseOnDemand]: 80/103 looper letters, 49 selfloop transitions, 79 changer transitions 5/209 dead transitions.
[2024-03-12 01:20:39,780 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 209 transitions, 1043 flow
[2024-03-12 01:20:39,781 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:39,781 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:39,782 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions.
[2024-03-12 01:20:39,782 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8656957928802589
[2024-03-12 01:20:39,782 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 535 transitions.
[2024-03-12 01:20:39,782 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions.
[2024-03-12 01:20:39,783 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:39,783 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions.
[2024-03-12 01:20:39,784 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 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-12 01:20:39,785 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:39,786 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 103.0) internal successors, (721), 7 states have internal predecessors, (721), 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-12 01:20:39,786 INFO  L175             Difference]: Start difference. First operand has 119 places, 128 transitions, 441 flow. Second operand 6 states and 535 transitions.
[2024-03-12 01:20:39,786 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 209 transitions, 1043 flow
[2024-03-12 01:20:39,791 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1031 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:20:39,794 INFO  L231             Difference]: Finished difference. Result has 122 places, 204 transitions, 1119 flow
[2024-03-12 01:20:39,795 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=429, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1119, PETRI_PLACES=122, PETRI_TRANSITIONS=204}
[2024-03-12 01:20:39,795 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 20 predicate places.
[2024-03-12 01:20:39,796 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 204 transitions, 1119 flow
[2024-03-12 01:20:39,796 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 75.0) internal successors, (450), 6 states have internal predecessors, (450), 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-12 01:20:39,796 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:39,796 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-12 01:20:39,796 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:20:39,797 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:20:39,797 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:39,797 INFO  L85        PathProgramCache]: Analyzing trace with hash 1331419043, now seen corresponding path program 1 times
[2024-03-12 01:20:39,797 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:39,797 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231963994]
[2024-03-12 01:20:39,798 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:39,798 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:39,827 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:20:39,828 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:20:39,840 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:20:39,859 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:20:39,860 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:20:39,860 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-12 01:20:39,862 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-12 01:20:39,862 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-12 01:20:39,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-12 01:20:39,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-12 01:20:39,863 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-12 01:20:39,864 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-12 01:20:39,864 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:20:39,864 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-12 01:20:39,866 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:20:39,866 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:20:39,885 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:20:39,888 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 122 places, 122 transitions, 260 flow
[2024-03-12 01:20:39,911 INFO  L124   PetriNetUnfolderBase]: 11/275 cut-off events.
[2024-03-12 01:20:39,912 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 01:20:39,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 287 conditions, 275 events. 11/275 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 632 event pairs, 0 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 156. Up to 8 conditions per place. 
[2024-03-12 01:20:39,912 INFO  L82        GeneralOperation]: Start removeDead. Operand has 122 places, 122 transitions, 260 flow
[2024-03-12 01:20:39,914 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 122 places, 122 transitions, 260 flow
[2024-03-12 01:20:39,915 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:20:39,916 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=LoopHeads, 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;@864bb5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:20:39,916 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:20:39,919 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:20:39,919 INFO  L124   PetriNetUnfolderBase]: 3/48 cut-off events.
[2024-03-12 01:20:39,919 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:20:39,920 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:39,920 INFO  L208   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, 1, 1]
[2024-03-12 01:20:39,920 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:39,920 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:39,920 INFO  L85        PathProgramCache]: Analyzing trace with hash 67653935, now seen corresponding path program 1 times
[2024-03-12 01:20:39,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:39,921 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978362375]
[2024-03-12 01:20:39,921 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:39,921 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:39,931 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:39,972 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-12 01:20:39,972 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:39,973 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978362375]
[2024-03-12 01:20:39,973 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978362375] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:39,973 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:39,973 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:39,973 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712996554]
[2024-03-12 01:20:39,973 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:39,973 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:20:39,974 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:39,974 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:20:39,974 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:20:40,015 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 104 out of 122
[2024-03-12 01:20:40,016 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 122 transitions, 260 flow. Second operand  has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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-12 01:20:40,016 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:40,016 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 122
[2024-03-12 01:20:40,016 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:40,068 INFO  L124   PetriNetUnfolderBase]: 3/283 cut-off events.
[2024-03-12 01:20:40,069 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-03-12 01:20:40,069 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 333 conditions, 283 events. 3/283 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 685 event pairs, 0 based on Foata normal form. 2/266 useless extension candidates. Maximal degree in co-relation 188. Up to 32 conditions per place. 
[2024-03-12 01:20:40,070 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 14 selfloop transitions, 6 changer transitions 2/125 dead transitions.
[2024-03-12 01:20:40,070 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 125 transitions, 308 flow
[2024-03-12 01:20:40,070 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:40,070 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:40,071 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions.
[2024-03-12 01:20:40,071 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.889344262295082
[2024-03-12 01:20:40,071 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 651 transitions.
[2024-03-12 01:20:40,071 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions.
[2024-03-12 01:20:40,072 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:40,072 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions.
[2024-03-12 01:20:40,073 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-12 01:20:40,074 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:40,075 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:40,075 INFO  L175             Difference]: Start difference. First operand has 122 places, 122 transitions, 260 flow. Second operand 6 states and 651 transitions.
[2024-03-12 01:20:40,075 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 125 transitions, 308 flow
[2024-03-12 01:20:40,076 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 125 transitions, 308 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:20:40,077 INFO  L231             Difference]: Finished difference. Result has 131 places, 123 transitions, 298 flow
[2024-03-12 01:20:40,077 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=298, PETRI_PLACES=131, PETRI_TRANSITIONS=123}
[2024-03-12 01:20:40,078 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places.
[2024-03-12 01:20:40,078 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 298 flow
[2024-03-12 01:20:40,078 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 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-12 01:20:40,078 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:40,078 INFO  L208   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, 1, 1, 1]
[2024-03-12 01:20:40,078 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:20:40,078 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:40,079 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:40,079 INFO  L85        PathProgramCache]: Analyzing trace with hash 1834781466, now seen corresponding path program 1 times
[2024-03-12 01:20:40,079 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:40,079 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998256023]
[2024-03-12 01:20:40,079 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:40,079 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:40,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:40,251 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-12 01:20:40,251 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:40,251 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998256023]
[2024-03-12 01:20:40,252 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998256023] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:40,252 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:40,252 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:40,252 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894436869]
[2024-03-12 01:20:40,252 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:40,253 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:20:40,253 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:40,254 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:20:40,254 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:20:40,396 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 122
[2024-03-12 01:20:40,397 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 298 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-12 01:20:40,397 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:40,397 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 122
[2024-03-12 01:20:40,397 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:40,940 INFO  L124   PetriNetUnfolderBase]: 1709/5076 cut-off events.
[2024-03-12 01:20:40,941 INFO  L125   PetriNetUnfolderBase]: For 163/163 co-relation queries the response was YES.
[2024-03-12 01:20:40,950 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8275 conditions, 5076 events. 1709/5076 cut-off events. For 163/163 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 42960 event pairs, 275 based on Foata normal form. 0/4719 useless extension candidates. Maximal degree in co-relation 8184. Up to 2240 conditions per place. 
[2024-03-12 01:20:40,964 INFO  L140   encePairwiseOnDemand]: 95/122 looper letters, 46 selfloop transitions, 48 changer transitions 4/183 dead transitions.
[2024-03-12 01:20:40,965 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 183 transitions, 617 flow
[2024-03-12 01:20:40,965 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:40,965 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:40,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 607 transitions.
[2024-03-12 01:20:40,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8292349726775956
[2024-03-12 01:20:40,967 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 607 transitions.
[2024-03-12 01:20:40,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 607 transitions.
[2024-03-12 01:20:40,967 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:40,967 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 607 transitions.
[2024-03-12 01:20:40,968 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 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-12 01:20:40,969 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:40,970 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:40,970 INFO  L175             Difference]: Start difference. First operand has 131 places, 123 transitions, 298 flow. Second operand 6 states and 607 transitions.
[2024-03-12 01:20:40,970 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 183 transitions, 617 flow
[2024-03-12 01:20:40,972 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 183 transitions, 615 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 01:20:40,974 INFO  L231             Difference]: Finished difference. Result has 139 places, 167 transitions, 614 flow
[2024-03-12 01:20:40,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=139, PETRI_TRANSITIONS=167}
[2024-03-12 01:20:40,974 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places.
[2024-03-12 01:20:40,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 167 transitions, 614 flow
[2024-03-12 01:20:40,975 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-12 01:20:40,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:40,975 INFO  L208   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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:20:40,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:20:40,975 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:40,975 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:40,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -1475656483, now seen corresponding path program 1 times
[2024-03-12 01:20:40,976 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:40,976 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47226347]
[2024-03-12 01:20:40,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:40,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:41,000 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:41,192 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-12 01:20:41,193 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:41,193 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47226347]
[2024-03-12 01:20:41,193 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47226347] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:41,193 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:41,193 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:41,193 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598406261]
[2024-03-12 01:20:41,193 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:41,194 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:20:41,194 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:41,194 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:20:41,194 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:20:41,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 86 out of 122
[2024-03-12 01:20:41,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 167 transitions, 614 flow. Second operand  has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 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-12 01:20:41,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:41,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 122
[2024-03-12 01:20:41,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:42,555 INFO  L124   PetriNetUnfolderBase]: 4894/11954 cut-off events.
[2024-03-12 01:20:42,555 INFO  L125   PetriNetUnfolderBase]: For 5307/7433 co-relation queries the response was YES.
[2024-03-12 01:20:42,581 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 29122 conditions, 11954 events. 4894/11954 cut-off events. For 5307/7433 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 108963 event pairs, 1132 based on Foata normal form. 46/11284 useless extension candidates. Maximal degree in co-relation 7823. Up to 6769 conditions per place. 
[2024-03-12 01:20:42,626 INFO  L140   encePairwiseOnDemand]: 95/122 looper letters, 80 selfloop transitions, 142 changer transitions 0/312 dead transitions.
[2024-03-12 01:20:42,626 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 312 transitions, 1722 flow
[2024-03-12 01:20:42,626 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:42,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:42,627 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 643 transitions.
[2024-03-12 01:20:42,628 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8784153005464481
[2024-03-12 01:20:42,628 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 643 transitions.
[2024-03-12 01:20:42,628 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 643 transitions.
[2024-03-12 01:20:42,628 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:42,628 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 643 transitions.
[2024-03-12 01:20:42,630 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.16666666666667) internal successors, (643), 6 states have internal predecessors, (643), 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-12 01:20:42,631 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:42,631 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:42,631 INFO  L175             Difference]: Start difference. First operand has 139 places, 167 transitions, 614 flow. Second operand 6 states and 643 transitions.
[2024-03-12 01:20:42,631 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 312 transitions, 1722 flow
[2024-03-12 01:20:42,643 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 312 transitions, 1712 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 01:20:42,646 INFO  L231             Difference]: Finished difference. Result has 143 places, 304 transitions, 1902 flow
[2024-03-12 01:20:42,647 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1902, PETRI_PLACES=143, PETRI_TRANSITIONS=304}
[2024-03-12 01:20:42,647 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 21 predicate places.
[2024-03-12 01:20:42,647 INFO  L495      AbstractCegarLoop]: Abstraction has has 143 places, 304 transitions, 1902 flow
[2024-03-12 01:20:42,647 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 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-12 01:20:42,648 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:42,648 INFO  L208   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, 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, 1]
[2024-03-12 01:20:42,648 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:20:42,648 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:42,648 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:42,648 INFO  L85        PathProgramCache]: Analyzing trace with hash 1192601189, now seen corresponding path program 1 times
[2024-03-12 01:20:42,648 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:42,648 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380244815]
[2024-03-12 01:20:42,648 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:42,649 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:42,664 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:42,896 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-03-12 01:20:42,896 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:42,896 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380244815]
[2024-03-12 01:20:42,896 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380244815] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:20:42,897 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:20:42,897 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:20:42,897 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925865548]
[2024-03-12 01:20:42,897 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:20:42,897 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:20:42,897 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:42,898 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:20:42,898 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:20:43,171 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 94 out of 122
[2024-03-12 01:20:43,172 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 304 transitions, 1902 flow. Second operand  has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-12 01:20:43,172 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:43,172 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 122
[2024-03-12 01:20:43,172 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:44,389 INFO  L124   PetriNetUnfolderBase]: 5008/11995 cut-off events.
[2024-03-12 01:20:44,389 INFO  L125   PetriNetUnfolderBase]: For 14303/14924 co-relation queries the response was YES.
[2024-03-12 01:20:44,421 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37507 conditions, 11995 events. 5008/11995 cut-off events. For 14303/14924 co-relation queries the response was YES. Maximal size of possible extension queue 458. Compared 107231 event pairs, 575 based on Foata normal form. 47/11606 useless extension candidates. Maximal degree in co-relation 19773. Up to 5158 conditions per place. 
[2024-03-12 01:20:44,463 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 120 selfloop transitions, 124 changer transitions 0/425 dead transitions.
[2024-03-12 01:20:44,463 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 425 transitions, 3306 flow
[2024-03-12 01:20:44,464 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:20:44,464 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:20:44,465 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions.
[2024-03-12 01:20:44,465 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8592896174863388
[2024-03-12 01:20:44,466 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 629 transitions.
[2024-03-12 01:20:44,466 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions.
[2024-03-12 01:20:44,466 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:44,466 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions.
[2024-03-12 01:20:44,467 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-12 01:20:44,468 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:44,469 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 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-12 01:20:44,469 INFO  L175             Difference]: Start difference. First operand has 143 places, 304 transitions, 1902 flow. Second operand 6 states and 629 transitions.
[2024-03-12 01:20:44,469 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 425 transitions, 3306 flow
[2024-03-12 01:20:44,521 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 425 transitions, 3252 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 01:20:44,525 INFO  L231             Difference]: Finished difference. Result has 153 places, 423 transitions, 3346 flow
[2024-03-12 01:20:44,525 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3346, PETRI_PLACES=153, PETRI_TRANSITIONS=423}
[2024-03-12 01:20:44,526 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 31 predicate places.
[2024-03-12 01:20:44,526 INFO  L495      AbstractCegarLoop]: Abstraction has has 153 places, 423 transitions, 3346 flow
[2024-03-12 01:20:44,526 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 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-12 01:20:44,526 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:44,526 INFO  L208   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, 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, 1, 1]
[2024-03-12 01:20:44,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 01:20:44,527 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:44,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:44,527 INFO  L85        PathProgramCache]: Analyzing trace with hash 929046158, now seen corresponding path program 1 times
[2024-03-12 01:20:44,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:44,527 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781675752]
[2024-03-12 01:20:44,527 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:44,527 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:44,552 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:44,924 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-12 01:20:44,924 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:44,924 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781675752]
[2024-03-12 01:20:44,924 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781675752] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:20:44,925 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311794917]
[2024-03-12 01:20:44,925 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:44,925 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:20:44,925 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:20:44,929 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:20:44,933 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-03-12 01:20:45,041 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:45,045 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-12 01:20:45,052 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:20:45,209 INFO  L378             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-12 01:20:45,237 INFO  L378             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-12 01:20:45,276 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:20:45,276 INFO  L378             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-12 01:20:45,319 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:20:45,319 INFO  L378             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-12 01:20:45,369 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:20:45,370 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:20:45,378 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-12 01:20:45,378 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:20:45,403 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-12 01:20:45,422 WARN  L854   $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_269 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_269 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_269 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_269) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-12 01:20:45,610 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-12 01:20:45,611 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [311794917] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:20:45,611 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:20:45,611 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28
[2024-03-12 01:20:45,611 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653786585]
[2024-03-12 01:20:45,611 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:20:45,612 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 29 states
[2024-03-12 01:20:45,612 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:45,612 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants.
[2024-03-12 01:20:45,613 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=603, Unknown=2, NotChecked=102, Total=812
[2024-03-12 01:20:45,649 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 122
[2024-03-12 01:20:45,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 423 transitions, 3346 flow. Second operand  has 29 states, 29 states have (on average 60.3448275862069) internal successors, (1750), 29 states have internal predecessors, (1750), 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-12 01:20:45,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:45,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 122
[2024-03-12 01:20:45,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:20:51,257 INFO  L124   PetriNetUnfolderBase]: 15326/30554 cut-off events.
[2024-03-12 01:20:51,257 INFO  L125   PetriNetUnfolderBase]: For 45508/45728 co-relation queries the response was YES.
[2024-03-12 01:20:51,368 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 105642 conditions, 30554 events. 15326/30554 cut-off events. For 45508/45728 co-relation queries the response was YES. Maximal size of possible extension queue 994. Compared 276992 event pairs, 2325 based on Foata normal form. 385/29475 useless extension candidates. Maximal degree in co-relation 85703. Up to 11501 conditions per place. 
[2024-03-12 01:20:51,551 INFO  L140   encePairwiseOnDemand]: 98/122 looper letters, 762 selfloop transitions, 485 changer transitions 1/1307 dead transitions.
[2024-03-12 01:20:51,551 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 1307 transitions, 12210 flow
[2024-03-12 01:20:51,552 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-03-12 01:20:51,552 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-03-12 01:20:51,556 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 2094 transitions.
[2024-03-12 01:20:51,557 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6129976580796253
[2024-03-12 01:20:51,557 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 2094 transitions.
[2024-03-12 01:20:51,558 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 2094 transitions.
[2024-03-12 01:20:51,559 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:20:51,559 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 2094 transitions.
[2024-03-12 01:20:51,563 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 74.78571428571429) internal successors, (2094), 28 states have internal predecessors, (2094), 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-12 01:20:51,568 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 122.0) internal successors, (3538), 29 states have internal predecessors, (3538), 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-12 01:20:51,569 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 122.0) internal successors, (3538), 29 states have internal predecessors, (3538), 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-12 01:20:51,569 INFO  L175             Difference]: Start difference. First operand has 153 places, 423 transitions, 3346 flow. Second operand 28 states and 2094 transitions.
[2024-03-12 01:20:51,569 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 1307 transitions, 12210 flow
[2024-03-12 01:20:51,985 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 1307 transitions, 12174 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-03-12 01:20:51,999 INFO  L231             Difference]: Finished difference. Result has 197 places, 870 transitions, 9261 flow
[2024-03-12 01:20:52,000 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3310, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=9261, PETRI_PLACES=197, PETRI_TRANSITIONS=870}
[2024-03-12 01:20:52,000 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 75 predicate places.
[2024-03-12 01:20:52,001 INFO  L495      AbstractCegarLoop]: Abstraction has has 197 places, 870 transitions, 9261 flow
[2024-03-12 01:20:52,001 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 29 states, 29 states have (on average 60.3448275862069) internal successors, (1750), 29 states have internal predecessors, (1750), 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-12 01:20:52,001 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:20:52,001 INFO  L208   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, 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, 1, 1]
[2024-03-12 01:20:52,010 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-03-12 01:20:52,202 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:20:52,203 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:20:52,204 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:20:52,204 INFO  L85        PathProgramCache]: Analyzing trace with hash -16778054, now seen corresponding path program 1 times
[2024-03-12 01:20:52,204 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:20:52,205 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448179285]
[2024-03-12 01:20:52,205 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:52,205 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:20:52,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:52,618 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-12 01:20:52,618 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:20:52,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448179285]
[2024-03-12 01:20:52,619 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448179285] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:20:52,619 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278429615]
[2024-03-12 01:20:52,619 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:20:52,620 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:20:52,620 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:20:52,621 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:20:52,626 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-03-12 01:20:52,708 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:20:52,710 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 22 conjunts are in the unsatisfiable core
[2024-03-12 01:20:52,714 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:20:52,983 INFO  L378             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-12 01:20:53,024 INFO  L378             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 19 treesize of output 18
[2024-03-12 01:20:53,068 INFO  L378             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 26 treesize of output 28
[2024-03-12 01:20:53,128 INFO  L378             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 33 treesize of output 38
[2024-03-12 01:20:53,195 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:20:53,196 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:20:53,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-12 01:20:53,239 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:20:53,272 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))) is different from false
[2024-03-12 01:20:53,297 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0))))) is different from false
[2024-03-12 01:20:53,337 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse2 (+ 3 |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) .cse2 0)))) (and (forall ((v_ArrVal_348 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (forall ((v_ArrVal_348 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1))) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_348 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_348) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0))))) is different from false
[2024-03-12 01:20:53,552 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-12 01:20:53,552 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [278429615] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:20:53,552 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:20:53,552 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 31
[2024-03-12 01:20:53,552 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046660101]
[2024-03-12 01:20:53,553 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:20:53,553 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-03-12 01:20:53,554 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:20:53,554 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-03-12 01:20:53,554 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=706, Unknown=3, NotChecked=168, Total=992
[2024-03-12 01:20:53,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 122
[2024-03-12 01:20:53,654 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 870 transitions, 9261 flow. Second operand  has 32 states, 32 states have (on average 62.15625) internal successors, (1989), 32 states have internal predecessors, (1989), 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-12 01:20:53,654 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:20:53,654 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 122
[2024-03-12 01:20:53,654 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:21:02,288 INFO  L124   PetriNetUnfolderBase]: 18104/34974 cut-off events.
[2024-03-12 01:21:02,289 INFO  L125   PetriNetUnfolderBase]: For 161490/161877 co-relation queries the response was YES.
[2024-03-12 01:21:02,500 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 168670 conditions, 34974 events. 18104/34974 cut-off events. For 161490/161877 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 313328 event pairs, 1885 based on Foata normal form. 383/33613 useless extension candidates. Maximal degree in co-relation 163550. Up to 10633 conditions per place. 
[2024-03-12 01:21:02,640 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 999 selfloop transitions, 771 changer transitions 0/1839 dead transitions.
[2024-03-12 01:21:02,640 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 1839 transitions, 22645 flow
[2024-03-12 01:21:02,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-12 01:21:02,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-12 01:21:02,644 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2323 transitions.
[2024-03-12 01:21:02,645 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6142252776308831
[2024-03-12 01:21:02,645 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2323 transitions.
[2024-03-12 01:21:02,645 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2323 transitions.
[2024-03-12 01:21:02,646 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:21:02,646 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2323 transitions.
[2024-03-12 01:21:02,650 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 74.93548387096774) internal successors, (2323), 31 states have internal predecessors, (2323), 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-12 01:21:02,747 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-12 01:21:02,749 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 122.0) internal successors, (3904), 32 states have internal predecessors, (3904), 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-12 01:21:02,749 INFO  L175             Difference]: Start difference. First operand has 197 places, 870 transitions, 9261 flow. Second operand 31 states and 2323 transitions.
[2024-03-12 01:21:02,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 1839 transitions, 22645 flow
[2024-03-12 01:21:04,218 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 1839 transitions, 22156 flow, removed 243 selfloop flow, removed 1 redundant places.
[2024-03-12 01:21:04,237 INFO  L231             Difference]: Finished difference. Result has 242 places, 1321 transitions, 17501 flow
[2024-03-12 01:21:04,238 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=9011, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=383, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=17501, PETRI_PLACES=242, PETRI_TRANSITIONS=1321}
[2024-03-12 01:21:04,239 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 120 predicate places.
[2024-03-12 01:21:04,239 INFO  L495      AbstractCegarLoop]: Abstraction has has 242 places, 1321 transitions, 17501 flow
[2024-03-12 01:21:04,239 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 32 states, 32 states have (on average 62.15625) internal successors, (1989), 32 states have internal predecessors, (1989), 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-12 01:21:04,240 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:21:04,240 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:21:04,247 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 01:21:04,441 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9
[2024-03-12 01:21:04,441 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:21:04,442 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:21:04,442 INFO  L85        PathProgramCache]: Analyzing trace with hash -818786000, now seen corresponding path program 1 times
[2024-03-12 01:21:04,442 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:21:04,442 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071918863]
[2024-03-12 01:21:04,442 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:21:04,442 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:21:04,464 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:21:05,143 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-12 01:21:05,143 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:21:05,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071918863]
[2024-03-12 01:21:05,143 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071918863] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:21:05,143 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297043737]
[2024-03-12 01:21:05,143 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:21:05,143 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:21:05,143 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:21:05,144 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:21:05,149 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-03-12 01:21:05,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:21:05,236 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 46 conjunts are in the unsatisfiable core
[2024-03-12 01:21:05,242 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:21:05,272 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:21:05,352 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:21:05,353 INFO  L378             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 15 treesize of output 15
[2024-03-12 01:21:05,541 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:21:05,542 INFO  L378             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 34 treesize of output 33
[2024-03-12 01:21:05,680 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:21:05,680 INFO  L378             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 26 treesize of output 19
[2024-03-12 01:21:05,695 INFO  L378             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-12 01:21:05,742 INFO  L378             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-12 01:21:05,811 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:21:05,812 INFO  L378             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-12 01:21:06,041 INFO  L378             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-12 01:21:06,101 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:21:06,102 INFO  L378             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 34 treesize of output 25
[2024-03-12 01:21:06,119 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:21:06,119 INFO  L378             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-12 01:21:06,205 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:21:06,206 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:21:06,238 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:21:06,239 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:21:06,264 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:21:06,265 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:21:06,317 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:21:06,328 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-12 01:21:06,328 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:21:06,352 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-12 01:21:06,399 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-12 01:21:06,475 WARN  L854   $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_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-12 01:21:06,501 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-03-12 01:21:06,531 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3)) (.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_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse1 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse1 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse1 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse1 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false
[2024-03-12 01:21:06,733 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.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_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse2 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse2 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse2 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_446 (Array Int Int)) (v_ArrVal_452 (Array Int Int)) (v_ArrVal_451 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_446) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_451) .cse2 v_ArrVal_452) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-12 01:21:07,183 INFO  L378             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 92 treesize of output 64
[2024-03-12 01:21:07,196 INFO  L378             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 34 treesize of output 30
[2024-03-12 01:21:07,288 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:21:07,288 INFO  L378             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 40
[2024-03-12 01:21:07,335 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-12 01:21:07,335 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297043737] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:21:07,335 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:21:07,335 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 19] total 44
[2024-03-12 01:21:07,335 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109457954]
[2024-03-12 01:21:07,335 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:21:07,336 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 45 states
[2024-03-12 01:21:07,336 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:21:07,337 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants.
[2024-03-12 01:21:07,337 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1340, Unknown=10, NotChecked=474, Total=1980
[2024-03-12 01:21:07,392 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122
[2024-03-12 01:21:07,394 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 1321 transitions, 17501 flow. Second operand  has 45 states, 45 states have (on average 51.111111111111114) internal successors, (2300), 45 states have internal predecessors, (2300), 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-12 01:21:07,394 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:21:07,394 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122
[2024-03-12 01:21:07,395 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:21:29,685 INFO  L124   PetriNetUnfolderBase]: 29178/57089 cut-off events.
[2024-03-12 01:21:29,685 INFO  L125   PetriNetUnfolderBase]: For 444823/444917 co-relation queries the response was YES.
[2024-03-12 01:21:30,218 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 290929 conditions, 57089 events. 29178/57089 cut-off events. For 444823/444917 co-relation queries the response was YES. Maximal size of possible extension queue 1878. Compared 556775 event pairs, 3673 based on Foata normal form. 140/54930 useless extension candidates. Maximal degree in co-relation 285115. Up to 27466 conditions per place. 
[2024-03-12 01:21:30,438 INFO  L140   encePairwiseOnDemand]: 76/122 looper letters, 2239 selfloop transitions, 591 changer transitions 58/2937 dead transitions.
[2024-03-12 01:21:30,438 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 2937 transitions, 40408 flow
[2024-03-12 01:21:30,438 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. 
[2024-03-12 01:21:30,439 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 53 states.
[2024-03-12 01:21:30,443 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 3253 transitions.
[2024-03-12 01:21:30,444 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5030931023816888
[2024-03-12 01:21:30,444 INFO  L72            ComplementDD]: Start complementDD. Operand 53 states and 3253 transitions.
[2024-03-12 01:21:30,444 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 53 states and 3253 transitions.
[2024-03-12 01:21:30,446 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:21:30,446 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 53 states and 3253 transitions.
[2024-03-12 01:21:30,451 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 54 states, 53 states have (on average 61.37735849056604) internal successors, (3253), 53 states have internal predecessors, (3253), 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-12 01:21:30,457 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 54 states, 54 states have (on average 122.0) internal successors, (6588), 54 states have internal predecessors, (6588), 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-12 01:21:30,458 INFO  L81            ComplementDD]: Finished complementDD. Result  has 54 states, 54 states have (on average 122.0) internal successors, (6588), 54 states have internal predecessors, (6588), 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-12 01:21:30,458 INFO  L175             Difference]: Start difference. First operand has 242 places, 1321 transitions, 17501 flow. Second operand 53 states and 3253 transitions.
[2024-03-12 01:21:30,458 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 2937 transitions, 40408 flow
[2024-03-12 01:21:33,863 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 2937 transitions, 40281 flow, removed 28 selfloop flow, removed 7 redundant places.
[2024-03-12 01:21:33,893 INFO  L231             Difference]: Finished difference. Result has 329 places, 1825 transitions, 26121 flow
[2024-03-12 01:21:33,894 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=17409, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=53, PETRI_FLOW=26121, PETRI_PLACES=329, PETRI_TRANSITIONS=1825}
[2024-03-12 01:21:33,895 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 207 predicate places.
[2024-03-12 01:21:33,895 INFO  L495      AbstractCegarLoop]: Abstraction has has 329 places, 1825 transitions, 26121 flow
[2024-03-12 01:21:33,896 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 45 states, 45 states have (on average 51.111111111111114) internal successors, (2300), 45 states have internal predecessors, (2300), 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-12 01:21:33,896 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:21:33,896 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:21:33,902 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-03-12 01:21:34,098 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:21:34,098 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:21:34,099 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:21:34,099 INFO  L85        PathProgramCache]: Analyzing trace with hash -267500672, now seen corresponding path program 2 times
[2024-03-12 01:21:34,099 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:21:34,100 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000007078]
[2024-03-12 01:21:34,100 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:21:34,100 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:21:34,123 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:21:34,763 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-12 01:21:34,764 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:21:34,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000007078]
[2024-03-12 01:21:34,764 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000007078] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:21:34,764 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640593667]
[2024-03-12 01:21:34,764 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 01:21:34,764 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:21:34,764 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:21:34,766 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:21:34,767 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-03-12 01:21:34,899 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:21:34,900 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:21:34,901 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-03-12 01:21:34,907 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:21:35,024 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:21:35,065 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 01:21:35,066 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 01:21:35,188 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 01:21:35,189 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 01:21:35,428 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:21:35,428 INFO  L378             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 33 treesize of output 32
[2024-03-12 01:21:35,606 INFO  L378             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 25 treesize of output 18
[2024-03-12 01:21:35,664 INFO  L378             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-12 01:21:35,714 INFO  L378             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 19 treesize of output 18
[2024-03-12 01:21:36,022 INFO  L378             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-12 01:21:36,083 INFO  L378             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 26 treesize of output 28
[2024-03-12 01:21:36,143 INFO  L378             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 33 treesize of output 38
[2024-03-12 01:21:36,229 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:21:36,248 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:21:36,273 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:21:36,299 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:21:36,380 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:21:36,421 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-12 01:21:36,421 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:21:36,443 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_557 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-12 01:21:36,477 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-12 01:21:36,535 WARN  L854   $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_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:21:36,553 WARN  L854   $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_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:21:36,573 WARN  L854   $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_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) .cse1 v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) .cse1 v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) .cse1 v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_556 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_556) .cse1 v_ArrVal_557) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-12 01:21:37,033 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:21:37,034 INFO  L378             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-12 01:21:37,049 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:21:37,050 INFO  L378             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 248 treesize of output 154
[2024-03-12 01:21:37,062 INFO  L378             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 21 treesize of output 17
[2024-03-12 01:21:37,065 INFO  L378             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 24
[2024-03-12 01:21:37,093 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:21:37,094 INFO  L378             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-12 01:21:37,100 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:21:37,100 INFO  L378             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-12 01:21:37,109 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:21:37,110 INFO  L378             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-12 01:21:37,729 INFO  L378             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 51 treesize of output 35
[2024-03-12 01:21:37,736 INFO  L378             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 8 treesize of output 6
[2024-03-12 01:21:37,876 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-12 01:21:37,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [640593667] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:21:37,876 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:21:37,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 20] total 57
[2024-03-12 01:21:37,877 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743176720]
[2024-03-12 01:21:37,877 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:21:37,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2024-03-12 01:21:37,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:21:37,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2024-03-12 01:21:37,879 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=2534, Unknown=9, NotChecked=530, Total=3306
[2024-03-12 01:21:38,204 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 33 out of 122
[2024-03-12 01:21:38,209 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 1825 transitions, 26121 flow. Second operand  has 58 states, 58 states have (on average 35.224137931034484) internal successors, (2043), 58 states have internal predecessors, (2043), 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-12 01:21:38,209 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:21:38,210 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 122
[2024-03-12 01:21:38,210 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:22:16,741 INFO  L124   PetriNetUnfolderBase]: 33468/64806 cut-off events.
[2024-03-12 01:22:16,741 INFO  L125   PetriNetUnfolderBase]: For 669533/670133 co-relation queries the response was YES.
[2024-03-12 01:22:17,952 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 371928 conditions, 64806 events. 33468/64806 cut-off events. For 669533/670133 co-relation queries the response was YES. Maximal size of possible extension queue 1985. Compared 630960 event pairs, 3641 based on Foata normal form. 383/62523 useless extension candidates. Maximal degree in co-relation 371286. Up to 30614 conditions per place. 
[2024-03-12 01:22:18,216 INFO  L140   encePairwiseOnDemand]: 65/122 looper letters, 2692 selfloop transitions, 971 changer transitions 49/3746 dead transitions.
[2024-03-12 01:22:18,216 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 3746 transitions, 56670 flow
[2024-03-12 01:22:18,217 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. 
[2024-03-12 01:22:18,218 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2024-03-12 01:22:18,220 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 3368 transitions.
[2024-03-12 01:22:18,221 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3730615861763403
[2024-03-12 01:22:18,221 INFO  L72            ComplementDD]: Start complementDD. Operand 74 states and 3368 transitions.
[2024-03-12 01:22:18,221 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 74 states and 3368 transitions.
[2024-03-12 01:22:18,222 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:22:18,222 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 3368 transitions.
[2024-03-12 01:22:18,228 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 75 states, 74 states have (on average 45.513513513513516) internal successors, (3368), 74 states have internal predecessors, (3368), 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-12 01:22:18,235 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 75 states, 75 states have (on average 122.0) internal successors, (9150), 75 states have internal predecessors, (9150), 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-12 01:22:18,237 INFO  L81            ComplementDD]: Finished complementDD. Result  has 75 states, 75 states have (on average 122.0) internal successors, (9150), 75 states have internal predecessors, (9150), 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-12 01:22:18,237 INFO  L175             Difference]: Start difference. First operand has 329 places, 1825 transitions, 26121 flow. Second operand 74 states and 3368 transitions.
[2024-03-12 01:22:18,237 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 3746 transitions, 56670 flow
[2024-03-12 01:22:28,928 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 3746 transitions, 56586 flow, removed 36 selfloop flow, removed 6 redundant places.
[2024-03-12 01:22:28,970 INFO  L231             Difference]: Finished difference. Result has 417 places, 2381 transitions, 37825 flow
[2024-03-12 01:22:28,971 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=26059, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1825, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=490, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=37825, PETRI_PLACES=417, PETRI_TRANSITIONS=2381}
[2024-03-12 01:22:28,972 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 295 predicate places.
[2024-03-12 01:22:28,972 INFO  L495      AbstractCegarLoop]: Abstraction has has 417 places, 2381 transitions, 37825 flow
[2024-03-12 01:22:28,973 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 58 states have (on average 35.224137931034484) internal successors, (2043), 58 states have internal predecessors, (2043), 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-12 01:22:28,973 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:22:28,973 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:22:28,978 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 01:22:29,177 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11
[2024-03-12 01:22:29,177 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:22:29,178 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:22:29,178 INFO  L85        PathProgramCache]: Analyzing trace with hash -553093872, now seen corresponding path program 3 times
[2024-03-12 01:22:29,178 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:22:29,179 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778769078]
[2024-03-12 01:22:29,179 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:22:29,179 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:22:29,200 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:22:29,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-12 01:22:29,893 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:22:29,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778769078]
[2024-03-12 01:22:29,893 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778769078] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:22:29,893 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067123024]
[2024-03-12 01:22:29,893 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 01:22:29,894 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:22:29,894 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:22:29,895 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:22:29,896 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-03-12 01:22:30,035 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 01:22:30,035 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:22:30,037 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 70 conjunts are in the unsatisfiable core
[2024-03-12 01:22:30,042 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:22:30,130 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:22:30,168 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:22:30,169 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 17 treesize of output 17
[2024-03-12 01:22:30,268 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:22:30,281 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 01:22:30,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-03-12 01:22:30,537 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 01:22:30,538 INFO  L378             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 1 case distinctions, treesize of input 33 treesize of output 24
[2024-03-12 01:22:30,711 INFO  L378             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 26 treesize of output 19
[2024-03-12 01:22:30,804 INFO  L378             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-12 01:22:30,976 INFO  L378             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-12 01:22:31,029 INFO  L378             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 19 treesize of output 18
[2024-03-12 01:22:31,086 INFO  L378             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 26 treesize of output 28
[2024-03-12 01:22:31,165 INFO  L378             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 33 treesize of output 38
[2024-03-12 01:22:31,239 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:22:31,274 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:22:31,294 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:22:31,321 INFO  L378             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 37 treesize of output 26
[2024-03-12 01:22:31,461 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:22:31,462 INFO  L378             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 44 treesize of output 36
[2024-03-12 01:22:31,531 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-12 01:22:31,532 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:22:31,552 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-12 01:22:31,661 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:22:31,764 WARN  L854   $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_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2024-03-12 01:22:31,799 WARN  L854   $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_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2024-03-12 01:22:31,843 WARN  L854   $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_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))))) is different from false
[2024-03-12 01:22:31,890 WARN  L854   $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_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_ArrVal_661 (Array Int Int))) (or (forall ((v_ArrVal_662 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_661) .cse1 v_ArrVal_662) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (not (= (select v_ArrVal_661 |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))))) is different from false
[2024-03-12 01:22:32,285 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:22:32,285 INFO  L378             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 40 treesize of output 56
[2024-03-12 01:22:32,292 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:22:32,293 INFO  L378             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 138 treesize of output 76
[2024-03-12 01:22:32,297 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:22:32,305 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:22:32,305 INFO  L378             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 37 treesize of output 41
[2024-03-12 01:22:32,348 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:22:32,348 INFO  L378             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-12 01:22:32,358 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:22:32,358 INFO  L378             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-12 01:22:32,368 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:22:32,368 INFO  L378             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-12 01:22:32,998 INFO  L378             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 52 treesize of output 40
[2024-03-12 01:22:33,004 INFO  L378             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 24 treesize of output 22
[2024-03-12 01:22:33,197 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-12 01:22:33,197 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067123024] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:22:33,197 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:22:33,197 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 21] total 58
[2024-03-12 01:22:33,197 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887919368]
[2024-03-12 01:22:33,197 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:22:33,198 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2024-03-12 01:22:33,198 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:22:33,198 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2024-03-12 01:22:33,199 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=2553, Unknown=8, NotChecked=642, Total=3422
[2024-03-12 01:22:33,287 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 33 out of 122
[2024-03-12 01:22:33,289 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 2381 transitions, 37825 flow. Second operand  has 59 states, 59 states have (on average 35.186440677966104) internal successors, (2076), 59 states have internal predecessors, (2076), 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-12 01:22:33,289 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:22:33,289 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 122
[2024-03-12 01:22:33,289 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:23:20,912 INFO  L124   PetriNetUnfolderBase]: 35798/68871 cut-off events.
[2024-03-12 01:23:20,912 INFO  L125   PetriNetUnfolderBase]: For 968344/968974 co-relation queries the response was YES.
[2024-03-12 01:23:22,660 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 448579 conditions, 68871 events. 35798/68871 cut-off events. For 968344/968974 co-relation queries the response was YES. Maximal size of possible extension queue 2119. Compared 669943 event pairs, 3787 based on Foata normal form. 394/66866 useless extension candidates. Maximal degree in co-relation 448065. Up to 31094 conditions per place. 
[2024-03-12 01:23:22,962 INFO  L140   encePairwiseOnDemand]: 61/122 looper letters, 2977 selfloop transitions, 1408 changer transitions 38/4457 dead transitions.
[2024-03-12 01:23:22,962 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 497 places, 4457 transitions, 74066 flow
[2024-03-12 01:23:22,963 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. 
[2024-03-12 01:23:22,963 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 82 states.
[2024-03-12 01:23:22,966 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 3700 transitions.
[2024-03-12 01:23:22,967 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36985205917632946
[2024-03-12 01:23:22,967 INFO  L72            ComplementDD]: Start complementDD. Operand 82 states and 3700 transitions.
[2024-03-12 01:23:22,967 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 82 states and 3700 transitions.
[2024-03-12 01:23:22,972 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:23:22,972 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 3700 transitions.
[2024-03-12 01:23:22,976 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 83 states, 82 states have (on average 45.1219512195122) internal successors, (3700), 82 states have internal predecessors, (3700), 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-12 01:23:22,987 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 83 states, 83 states have (on average 122.0) internal successors, (10126), 83 states have internal predecessors, (10126), 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-12 01:23:22,988 INFO  L81            ComplementDD]: Finished complementDD. Result  has 83 states, 83 states have (on average 122.0) internal successors, (10126), 83 states have internal predecessors, (10126), 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-12 01:23:22,988 INFO  L175             Difference]: Start difference. First operand has 417 places, 2381 transitions, 37825 flow. Second operand 82 states and 3700 transitions.
[2024-03-12 01:23:22,988 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 497 places, 4457 transitions, 74066 flow
[2024-03-12 01:23:46,478 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 467 places, 4457 transitions, 72619 flow, removed 624 selfloop flow, removed 30 redundant places.
[2024-03-12 01:23:46,537 INFO  L231             Difference]: Finished difference. Result has 498 places, 3003 transitions, 52663 flow
[2024-03-12 01:23:46,538 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=36716, PETRI_DIFFERENCE_MINUEND_PLACES=386, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2381, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=824, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=82, PETRI_FLOW=52663, PETRI_PLACES=498, PETRI_TRANSITIONS=3003}
[2024-03-12 01:23:46,539 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 376 predicate places.
[2024-03-12 01:23:46,539 INFO  L495      AbstractCegarLoop]: Abstraction has has 498 places, 3003 transitions, 52663 flow
[2024-03-12 01:23:46,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 59 states, 59 states have (on average 35.186440677966104) internal successors, (2076), 59 states have internal predecessors, (2076), 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-12 01:23:46,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:23:46,539 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:23:46,544 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-03-12 01:23:46,740 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:23:46,740 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:23:46,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:23:46,741 INFO  L85        PathProgramCache]: Analyzing trace with hash -1098373146, now seen corresponding path program 4 times
[2024-03-12 01:23:46,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:23:46,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209251390]
[2024-03-12 01:23:46,741 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:23:46,741 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:23:46,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:23:47,310 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-12 01:23:47,310 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:23:47,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209251390]
[2024-03-12 01:23:47,310 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209251390] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:23:47,310 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004032985]
[2024-03-12 01:23:47,310 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 01:23:47,310 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:23:47,310 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:23:47,311 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:23:47,312 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-03-12 01:23:47,490 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 01:23:47,491 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:23:47,493 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 70 conjunts are in the unsatisfiable core
[2024-03-12 01:23:47,504 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:23:47,617 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:23:47,819 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:23:47,820 INFO  L378             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 15 treesize of output 15
[2024-03-12 01:23:48,050 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:23:48,050 INFO  L378             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 50 treesize of output 45
[2024-03-12 01:23:48,054 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:23:48,055 INFO  L378             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 24 treesize of output 11
[2024-03-12 01:23:48,279 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:23:48,280 INFO  L378             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 26 treesize of output 19
[2024-03-12 01:23:48,287 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:23:48,288 INFO  L378             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 16 treesize of output 11
[2024-03-12 01:23:48,365 INFO  L378             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-12 01:23:48,370 INFO  L378             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 7 treesize of output 3
[2024-03-12 01:23:48,433 INFO  L378             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-12 01:23:48,485 INFO  L378             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 19 treesize of output 18
[2024-03-12 01:23:48,533 INFO  L378             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 26 treesize of output 28
[2024-03-12 01:23:48,587 INFO  L378             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 33 treesize of output 38
[2024-03-12 01:23:48,670 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48
[2024-03-12 01:23:48,741 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-12 01:23:48,741 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:23:50,166 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_754 (Array Int Int))) (not (= |c_threadThread1of2ForFork0_#in~arg.base| (select (select (store |c_#memory_$Pointer$.base| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_754) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))))) (and (or (forall ((v_ArrVal_755 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_threadThread1of2ForFork0_#in~arg.offset|))) .cse0) (or (forall ((v_ArrVal_755 (Array Int Int))) (not (= (+ |c_threadThread1of2ForFork0_#in~arg.offset| 1) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_755 (Array Int Int))) (not (= (+ 2 |c_threadThread1of2ForFork0_#in~arg.offset|) (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse0) (or (forall ((v_ArrVal_755 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.offset| |c_threadThread1of2ForFork0_#in~arg.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ 3 |c_threadThread1of2ForFork0_#in~arg.offset|)))) .cse0))) is different from false
[2024-03-12 01:23:50,990 WARN  L854   $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|))) (let ((.cse1 (forall ((v_ArrVal_754 (Array Int Int)) (v_ArrVal_753 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_753) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_754) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc8#1.base|))))) (and (or (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~malloc8#1.offset| 2)))) .cse1) (or (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~malloc8#1.offset| (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) .cse1) (or .cse1 (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~malloc8#1.offset| 1))))) (or .cse1 (forall ((v_ArrVal_755 (Array Int Int)) (v_ArrVal_752 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_752) |c_ULTIMATE.start_main_#t~malloc8#1.base| v_ArrVal_755) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) (+ |c_ULTIMATE.start_main_#t~malloc8#1.offset| 3)))))))) is different from false
[2024-03-12 01:23:52,038 INFO  L378             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 656 treesize of output 504
[2024-03-12 01:23:52,061 INFO  L378             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 556 treesize of output 532
[2024-03-12 01:23:52,080 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:23:52,089 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:23:52,094 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:23:52,101 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:23:52,158 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:23:52,164 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:23:52,172 INFO  L378             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 52 treesize of output 50
[2024-03-12 01:23:52,179 INFO  L378             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 50 treesize of output 46
[2024-03-12 01:23:52,240 INFO  L378             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 52 treesize of output 50
[2024-03-12 01:23:52,247 INFO  L378             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 50 treesize of output 46
[2024-03-12 01:23:52,255 INFO  L378             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 52 treesize of output 50
[2024-03-12 01:23:52,264 INFO  L378             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 50 treesize of output 46
[2024-03-12 01:23:52,320 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:23:52,334 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:23:52,344 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:23:52,353 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:23:52,784 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:23:52,784 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 163
[2024-03-12 01:23:53,488 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-12 01:23:53,488 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004032985] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:23:53,488 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:23:53,488 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 22, 21] total 57
[2024-03-12 01:23:53,489 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73186114]
[2024-03-12 01:23:53,489 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:23:53,489 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 58 states
[2024-03-12 01:23:53,489 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:23:53,490 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants.
[2024-03-12 01:23:53,490 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=2790, Unknown=38, NotChecked=218, Total=3306
[2024-03-12 01:23:53,805 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 30 out of 122
[2024-03-12 01:23:53,806 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 3003 transitions, 52663 flow. Second operand  has 58 states, 58 states have (on average 32.37931034482759) internal successors, (1878), 58 states have internal predecessors, (1878), 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-12 01:23:53,806 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:23:53,806 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 122
[2024-03-12 01:23:53,806 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:25:30,331 INFO  L124   PetriNetUnfolderBase]: 68038/128570 cut-off events.
[2024-03-12 01:25:30,331 INFO  L125   PetriNetUnfolderBase]: For 2509380/2510264 co-relation queries the response was YES.
[2024-03-12 01:25:34,889 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 937897 conditions, 128570 events. 68038/128570 cut-off events. For 2509380/2510264 co-relation queries the response was YES. Maximal size of possible extension queue 4074. Compared 1349615 event pairs, 7666 based on Foata normal form. 1030/124906 useless extension candidates. Maximal degree in co-relation 936464. Up to 36543 conditions per place. 
[2024-03-12 01:25:35,666 INFO  L140   encePairwiseOnDemand]: 60/122 looper letters, 5512 selfloop transitions, 3350 changer transitions 68/8960 dead transitions.
[2024-03-12 01:25:35,666 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 595 places, 8960 transitions, 170775 flow
[2024-03-12 01:25:35,667 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. 
[2024-03-12 01:25:35,667 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 98 states.
[2024-03-12 01:25:35,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 4363 transitions.
[2024-03-12 01:25:35,672 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.36492137838742056
[2024-03-12 01:25:35,672 INFO  L72            ComplementDD]: Start complementDD. Operand 98 states and 4363 transitions.
[2024-03-12 01:25:35,672 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 98 states and 4363 transitions.
[2024-03-12 01:25:35,673 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:25:35,673 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 98 states and 4363 transitions.
[2024-03-12 01:25:35,677 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 99 states, 98 states have (on average 44.52040816326531) internal successors, (4363), 98 states have internal predecessors, (4363), 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-12 01:25:35,685 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 99 states, 99 states have (on average 122.0) internal successors, (12078), 99 states have internal predecessors, (12078), 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-12 01:25:35,685 INFO  L81            ComplementDD]: Finished complementDD. Result  has 99 states, 99 states have (on average 122.0) internal successors, (12078), 99 states have internal predecessors, (12078), 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-12 01:25:35,685 INFO  L175             Difference]: Start difference. First operand has 498 places, 3003 transitions, 52663 flow. Second operand 98 states and 4363 transitions.
[2024-03-12 01:25:35,685 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 595 places, 8960 transitions, 170775 flow
[2024-03-12 01:27:19,343 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 558 places, 8960 transitions, 168624 flow, removed 898 selfloop flow, removed 37 redundant places.
[2024-03-12 01:27:19,452 INFO  L231             Difference]: Finished difference. Result has 604 places, 5680 transitions, 116600 flow
[2024-03-12 01:27:19,454 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=51499, PETRI_DIFFERENCE_MINUEND_PLACES=461, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3003, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=98, PETRI_FLOW=116600, PETRI_PLACES=604, PETRI_TRANSITIONS=5680}
[2024-03-12 01:27:19,455 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 482 predicate places.
[2024-03-12 01:27:19,455 INFO  L495      AbstractCegarLoop]: Abstraction has has 604 places, 5680 transitions, 116600 flow
[2024-03-12 01:27:19,456 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 58 states, 58 states have (on average 32.37931034482759) internal successors, (1878), 58 states have internal predecessors, (1878), 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-12 01:27:19,456 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:27:19,456 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:27:19,460 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-03-12 01:27:19,656 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13
[2024-03-12 01:27:19,657 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:27:19,657 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:27:19,657 INFO  L85        PathProgramCache]: Analyzing trace with hash -259929342, now seen corresponding path program 1 times
[2024-03-12 01:27:19,657 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:27:19,657 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666413753]
[2024-03-12 01:27:19,658 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:27:19,658 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:27:19,680 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:27:20,185 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-12 01:27:20,185 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:27:20,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666413753]
[2024-03-12 01:27:20,185 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666413753] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:27:20,185 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619632707]
[2024-03-12 01:27:20,185 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:27:20,185 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:27:20,185 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:27:20,186 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:27:20,188 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-03-12 01:27:20,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:27:20,289 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 01:27:20,291 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:27:20,298 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:27:20,324 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 01:27:20,324 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 17 treesize of output 21
[2024-03-12 01:27:20,422 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:27:20,429 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:27:20,429 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-03-12 01:27:20,590 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:27:20,590 INFO  L378             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 33 treesize of output 32
[2024-03-12 01:27:20,726 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:27:20,727 INFO  L378             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 25 treesize of output 18
[2024-03-12 01:27:20,778 INFO  L378             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-12 01:27:20,792 INFO  L378             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-12 01:27:20,798 INFO  L378             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-12 01:27:20,812 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:27:20,812 INFO  L378             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-12 01:27:20,827 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:27:20,827 INFO  L378             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 52 treesize of output 57
[2024-03-12 01:27:20,847 INFO  L378             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 56 treesize of output 45
[2024-03-12 01:27:20,859 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-12 01:27:20,859 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:27:20,885 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)))) is different from false
[2024-03-12 01:27:21,034 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:27:21,053 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse4 (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse4 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)) (forall ((v_ArrVal_861 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_861) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse4) 0)))))) is different from false
[2024-03-12 01:27:21,072 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:27:21,073 INFO  L378             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 50 treesize of output 66
[2024-03-12 01:27:21,079 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:27:21,080 INFO  L378             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 81 treesize of output 38
[2024-03-12 01:27:21,092 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:27:21,092 INFO  L378             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 51 treesize of output 1
[2024-03-12 01:27:21,101 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:27:21,101 INFO  L378             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 51 treesize of output 1
[2024-03-12 01:27:21,107 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:27:21,107 INFO  L378             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 51 treesize of output 1
[2024-03-12 01:27:21,132 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_856) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_threadThread1of2ForFork0_~t~0.base))) is different from false
[2024-03-12 01:27:21,144 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_856) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-12 01:27:21,187 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_856 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_856) |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-12 01:27:21,451 INFO  L378             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 73 treesize of output 57
[2024-03-12 01:27:21,456 INFO  L378             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 52 treesize of output 48
[2024-03-12 01:27:21,462 INFO  L378             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 48 treesize of output 46
[2024-03-12 01:27:21,629 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-12 01:27:21,629 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619632707] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:27:21,629 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:27:21,629 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 40
[2024-03-12 01:27:21,630 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3824246]
[2024-03-12 01:27:21,630 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:27:21,630 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-03-12 01:27:21,631 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:27:21,632 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-03-12 01:27:21,632 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1052, Unknown=34, NotChecked=426, Total=1640
[2024-03-12 01:27:21,633 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 45 out of 122
[2024-03-12 01:27:21,634 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 5680 transitions, 116600 flow. Second operand  has 41 states, 41 states have (on average 47.048780487804876) internal successors, (1929), 41 states have internal predecessors, (1929), 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-12 01:27:21,634 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:27:21,634 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 122
[2024-03-12 01:27:21,634 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:29:35,324 INFO  L124   PetriNetUnfolderBase]: 64591/124133 cut-off events.
[2024-03-12 01:29:35,325 INFO  L125   PetriNetUnfolderBase]: For 3911021/3913263 co-relation queries the response was YES.
[2024-03-12 01:29:41,298 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1089239 conditions, 124133 events. 64591/124133 cut-off events. For 3911021/3913263 co-relation queries the response was YES. Maximal size of possible extension queue 4021. Compared 1327239 event pairs, 8027 based on Foata normal form. 1089/120395 useless extension candidates. Maximal degree in co-relation 1088904. Up to 36599 conditions per place. 
[2024-03-12 01:29:41,997 INFO  L140   encePairwiseOnDemand]: 88/122 looper letters, 5060 selfloop transitions, 2878 changer transitions 32/8334 dead transitions.
[2024-03-12 01:29:41,997 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 8334 transitions, 189128 flow
[2024-03-12 01:29:41,997 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2024-03-12 01:29:41,997 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2024-03-12 01:29:41,999 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2652 transitions.
[2024-03-12 01:29:42,000 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4830601092896175
[2024-03-12 01:29:42,000 INFO  L72            ComplementDD]: Start complementDD. Operand 45 states and 2652 transitions.
[2024-03-12 01:29:42,000 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 2652 transitions.
[2024-03-12 01:29:42,001 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:29:42,001 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 2652 transitions.
[2024-03-12 01:29:42,003 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 46 states, 45 states have (on average 58.93333333333333) internal successors, (2652), 45 states have internal predecessors, (2652), 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-12 01:29:42,007 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 46 states, 46 states have (on average 122.0) internal successors, (5612), 46 states have internal predecessors, (5612), 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-12 01:29:42,008 INFO  L81            ComplementDD]: Finished complementDD. Result  has 46 states, 46 states have (on average 122.0) internal successors, (5612), 46 states have internal predecessors, (5612), 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-12 01:29:42,008 INFO  L175             Difference]: Start difference. First operand has 604 places, 5680 transitions, 116600 flow. Second operand 45 states and 2652 transitions.
[2024-03-12 01:29:42,008 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 646 places, 8334 transitions, 189128 flow
[2024-03-12 01:32:51,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 8334 transitions, 178641 flow, removed 4836 selfloop flow, removed 33 redundant places.
[2024-03-12 01:32:51,258 INFO  L231             Difference]: Finished difference. Result has 631 places, 6908 transitions, 149581 flow
[2024-03-12 01:32:51,262 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=111776, PETRI_DIFFERENCE_MINUEND_PLACES=569, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=5680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1798, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3767, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=149581, PETRI_PLACES=631, PETRI_TRANSITIONS=6908}
[2024-03-12 01:32:51,262 INFO  L281   CegarLoopForPetriNet]: 122 programPoint places, 509 predicate places.
[2024-03-12 01:32:51,262 INFO  L495      AbstractCegarLoop]: Abstraction has has 631 places, 6908 transitions, 149581 flow
[2024-03-12 01:32:51,263 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 41 states have (on average 47.048780487804876) internal successors, (1929), 41 states have internal predecessors, (1929), 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-12 01:32:51,263 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:32:51,263 INFO  L208   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, 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:32:51,268 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0
[2024-03-12 01:32:51,464 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14
[2024-03-12 01:32:51,464 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:32:51,465 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:32:51,465 INFO  L85        PathProgramCache]: Analyzing trace with hash -2082210608, now seen corresponding path program 5 times
[2024-03-12 01:32:51,465 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:32:51,465 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634809367]
[2024-03-12 01:32:51,466 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:32:51,466 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:32:51,485 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:32:51,904 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-12 01:32:51,904 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:32:51,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634809367]
[2024-03-12 01:32:51,904 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634809367] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:32:51,904 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519026315]
[2024-03-12 01:32:51,904 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 01:32:51,904 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:32:51,904 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:32:51,905 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-03-12 01:32:51,907 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-03-12 01:32:52,041 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:32:52,041 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:32:52,042 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 39 conjunts are in the unsatisfiable core
[2024-03-12 01:32:52,045 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:32:52,069 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5
[2024-03-12 01:32:52,130 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:32:52,130 INFO  L378             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 15 treesize of output 15
[2024-03-12 01:32:52,242 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 01:32:52,242 INFO  L378             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 33 treesize of output 24
[2024-03-12 01:32:52,316 INFO  L378             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-12 01:32:52,332 INFO  L378             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-12 01:32:52,336 INFO  L378             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-12 01:32:52,348 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:32:52,348 INFO  L378             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-12 01:32:52,362 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:32:52,363 INFO  L378             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-12 01:32:52,383 INFO  L378             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 43 treesize of output 32
[2024-03-12 01:32:52,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-12 01:32:52,392 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:32:52,412 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_960 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-12 01:32:52,553 WARN  L854   $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_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-12 01:32:52,569 WARN  L854   $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_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_960 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_960) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-12 01:32:52,583 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:32:52,583 INFO  L378             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-12 01:32:52,588 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:32:52,588 INFO  L378             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 84 treesize of output 32
[2024-03-12 01:32:52,595 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:32:52,595 INFO  L378             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-12 01:32:52,600 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:32:52,600 INFO  L378             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-12 01:32:52,604 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:32:52,605 INFO  L378             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-12 01:32:52,642 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (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_951) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-12 01:32:52,857 INFO  L378             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 44 treesize of output 32
[2024-03-12 01:32:52,860 INFO  L378             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 24 treesize of output 22
[2024-03-12 01:32:52,913 INFO  L378             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 10 treesize of output 8
[2024-03-12 01:32:52,939 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-12 01:32:52,940 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [519026315] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:32:52,940 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:32:52,940 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 35
[2024-03-12 01:32:52,940 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281578618]
[2024-03-12 01:32:52,940 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:32:52,940 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 36 states
[2024-03-12 01:32:52,941 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:32:52,941 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants.
[2024-03-12 01:32:52,941 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=877, Unknown=27, NotChecked=252, Total=1260
[2024-03-12 01:32:53,025 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 49 out of 122
[2024-03-12 01:32:53,026 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 631 places, 6908 transitions, 149581 flow. Second operand  has 36 states, 36 states have (on average 51.083333333333336) internal successors, (1839), 36 states have internal predecessors, (1839), 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-12 01:32:53,026 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:32:53,026 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 122
[2024-03-12 01:32:53,026 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
Killed by 15
