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


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


Checking for data races
Using default analysis
Version 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-race.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 3bf7b579398dce65888a9d1c64f7ca367e99603e81f845cd2926f3955a32b276
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 01:07:37,687 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 01:07:37,725 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:07:37,729 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 01:07:37,729 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 01:07:37,745 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 01:07:37,746 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 01:07:37,746 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 01:07:37,747 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 01:07:37,747 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 01:07:37,747 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 01:07:37,748 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 01:07:37,748 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 01:07:37,748 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 01:07:37,748 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 01:07:37,749 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 01:07:37,749 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 01:07:37,749 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 01:07:37,749 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 01:07:37,750 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 01:07:37,750 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 01:07:37,750 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 01:07:37,751 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 01:07:37,751 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 01:07:37,751 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 01:07:37,751 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 01:07:37,752 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 01:07:37,752 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 01:07:37,752 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 01:07:37,752 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 01:07:37,752 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:07:37,753 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 01:07:37,753 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 01:07:37,753 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 01:07:37,753 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 01:07:37,757 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 01:07:37,757 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 01:07:37,757 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 01:07:37,757 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 01:07:37,757 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 01:07:37,758 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 01:07:37,758 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 -> 3bf7b579398dce65888a9d1c64f7ca367e99603e81f845cd2926f3955a32b276
[2024-03-12 01:07:37,927 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 01:07:37,947 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 01:07:37,949 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 01:07:37,950 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 01:07:37,952 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 01:07:37,952 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-12 01:07:39,023 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 01:07:39,198 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 01:07:39,198 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-struct-race.i
[2024-03-12 01:07:39,210 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8a5fab061/8a115e816e0644929cde2a6b9a3598ef/FLAG8f2440d96
[2024-03-12 01:07:39,220 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8a5fab061/8a115e816e0644929cde2a6b9a3598ef
[2024-03-12 01:07:39,222 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 01:07:39,223 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 01:07:39,224 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 01:07:39,224 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 01:07:39,228 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 01:07:39,229 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,230 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43e2c6b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39, skipping insertion in model container
[2024-03-12 01:07:39,230 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,267 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 01:07:39,533 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:07:39,540 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 01:07:39,577 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 01:07:39,635 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 01:07:39,635 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39 WrapperNode
[2024-03-12 01:07:39,636 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 01:07:39,636 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 01:07:39,637 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 01:07:39,637 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 01:07:39,642 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:07:39" (1/1) ...
[2024-03-12 01:07:39,656 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:07:39" (1/1) ...
[2024-03-12 01:07:39,675 INFO  L138                Inliner]: procedures = 265, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80
[2024-03-12 01:07:39,675 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 01:07:39,676 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 01:07:39,676 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 01:07:39,676 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 01:07:39,683 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,683 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,687 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,687 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,693 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,696 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,698 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,699 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,701 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 01:07:39,702 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 01:07:39,702 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 01:07:39,702 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 01:07:39,702 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (1/1) ...
[2024-03-12 01:07:39,707 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 01:07:39,715 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:07:39,727 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:07:39,730 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:07:39,760 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 01:07:39,761 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 01:07:39,761 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 01:07:39,761 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 01:07:39,763 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:07:39,928 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 01:07:39,929 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 01:07:40,081 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 01:07:40,089 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 01:07:40,089 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 01:07:40,090 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:07:40 BoogieIcfgContainer
[2024-03-12 01:07:40,090 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 01:07:40,092 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 01:07:40,092 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 01:07:40,094 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 01:07:40,095 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 01:07:39" (1/3) ...
[2024-03-12 01:07:40,095 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ffb398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:07:40, skipping insertion in model container
[2024-03-12 01:07:40,095 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 01:07:39" (2/3) ...
[2024-03-12 01:07:40,095 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29ffb398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 01:07:40, skipping insertion in model container
[2024-03-12 01:07:40,096 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 01:07:40" (3/3) ...
[2024-03-12 01:07:40,096 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-struct-race.i
[2024-03-12 01:07:40,102 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 01:07:40,109 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 01:07:40,109 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations.
[2024-03-12 01:07:40,110 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 01:07:40,151 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 01:07:40,176 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 102 places, 103 transitions, 213 flow
[2024-03-12 01:07:40,219 INFO  L124   PetriNetUnfolderBase]: 6/152 cut-off events.
[2024-03-12 01:07:40,220 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 01:07:40,224 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 157 conditions, 152 events. 6/152 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 308 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 73. Up to 4 conditions per place. 
[2024-03-12 01:07:40,224 INFO  L82        GeneralOperation]: Start removeDead. Operand has 102 places, 103 transitions, 213 flow
[2024-03-12 01:07:40,227 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 102 places, 103 transitions, 213 flow
[2024-03-12 01:07:40,235 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:07:40,240 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;@50fad0a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:07:40,240 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 7 error locations.
[2024-03-12 01:07:40,249 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:07:40,249 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-12 01:07:40,249 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:07:40,249 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:40,250 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]
[2024-03-12 01:07:40,250 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:07:40,261 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:40,261 INFO  L85        PathProgramCache]: Analyzing trace with hash -1691916919, now seen corresponding path program 1 times
[2024-03-12 01:07:40,268 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:40,268 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949265254]
[2024-03-12 01:07:40,268 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:40,269 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:40,369 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:40,773 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:07:40,774 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:40,774 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949265254]
[2024-03-12 01:07:40,774 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949265254] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:40,774 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:40,775 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:40,776 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440308030]
[2024-03-12 01:07:40,777 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:40,783 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:07:40,788 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:40,805 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:07:40,806 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:07:41,039 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 72 out of 103
[2024-03-12 01:07:41,042 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 103 transitions, 213 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:07:41,042 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:41,042 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 103
[2024-03-12 01:07:41,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:41,173 INFO  L124   PetriNetUnfolderBase]: 117/574 cut-off events.
[2024-03-12 01:07:41,174 INFO  L125   PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES.
[2024-03-12 01:07:41,175 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 886 conditions, 574 events. 117/574 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3185 event pairs, 6 based on Foata normal form. 13/537 useless extension candidates. Maximal degree in co-relation 751. Up to 194 conditions per place. 
[2024-03-12 01:07:41,178 INFO  L140   encePairwiseOnDemand]: 77/103 looper letters, 38 selfloop transitions, 29 changer transitions 1/139 dead transitions.
[2024-03-12 01:07:41,178 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 139 transitions, 422 flow
[2024-03-12 01:07:41,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:41,181 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:41,188 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 507 transitions.
[2024-03-12 01:07:41,190 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8203883495145631
[2024-03-12 01:07:41,191 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 507 transitions.
[2024-03-12 01:07:41,191 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 507 transitions.
[2024-03-12 01:07:41,193 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:41,206 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 507 transitions.
[2024-03-12 01:07:41,211 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 84.5) internal successors, (507), 6 states have internal predecessors, (507), 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:07:41,216 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:07:41,217 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:07:41,220 INFO  L175             Difference]: Start difference. First operand has 102 places, 103 transitions, 213 flow. Second operand 6 states and 507 transitions.
[2024-03-12 01:07:41,222 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 139 transitions, 422 flow
[2024-03-12 01:07:41,227 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 139 transitions, 422 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:07:41,231 INFO  L231             Difference]: Finished difference. Result has 112 places, 128 transitions, 425 flow
[2024-03-12 01:07:41,232 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=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=425, PETRI_PLACES=112, PETRI_TRANSITIONS=128}
[2024-03-12 01:07:41,235 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 10 predicate places.
[2024-03-12 01:07:41,235 INFO  L495      AbstractCegarLoop]: Abstraction has has 112 places, 128 transitions, 425 flow
[2024-03-12 01:07:41,236 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:07:41,236 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:41,236 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]
[2024-03-12 01:07:41,236 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 01:07:41,236 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:07:41,237 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:41,237 INFO  L85        PathProgramCache]: Analyzing trace with hash -1385440213, now seen corresponding path program 1 times
[2024-03-12 01:07:41,237 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:41,238 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246702617]
[2024-03-12 01:07:41,238 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:41,238 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:41,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:41,330 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:07:41,331 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:41,331 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246702617]
[2024-03-12 01:07:41,331 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246702617] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:41,331 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:41,331 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:41,331 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502030285]
[2024-03-12 01:07:41,331 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:41,332 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:07:41,333 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:41,333 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:07:41,333 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:07:41,408 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 87 out of 103
[2024-03-12 01:07:41,409 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 128 transitions, 425 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:07:41,409 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:41,409 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 103
[2024-03-12 01:07:41,409 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:41,473 INFO  L124   PetriNetUnfolderBase]: 82/524 cut-off events.
[2024-03-12 01:07:41,474 INFO  L125   PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES.
[2024-03-12 01:07:41,476 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 956 conditions, 524 events. 82/524 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2922 event pairs, 4 based on Foata normal form. 1/496 useless extension candidates. Maximal degree in co-relation 765. Up to 98 conditions per place. 
[2024-03-12 01:07:41,477 INFO  L140   encePairwiseOnDemand]: 95/103 looper letters, 11 selfloop transitions, 2 changer transitions 5/133 dead transitions.
[2024-03-12 01:07:41,477 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 133 transitions, 471 flow
[2024-03-12 01:07:41,477 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:41,478 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:41,479 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 541 transitions.
[2024-03-12 01:07:41,479 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8754045307443366
[2024-03-12 01:07:41,479 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 541 transitions.
[2024-03-12 01:07:41,479 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 541 transitions.
[2024-03-12 01:07:41,480 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:41,480 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 541 transitions.
[2024-03-12 01:07:41,481 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 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:07:41,483 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:07:41,483 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:07:41,483 INFO  L175             Difference]: Start difference. First operand has 112 places, 128 transitions, 425 flow. Second operand 6 states and 541 transitions.
[2024-03-12 01:07:41,483 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 133 transitions, 471 flow
[2024-03-12 01:07:41,487 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 133 transitions, 471 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:07:41,489 INFO  L231             Difference]: Finished difference. Result has 120 places, 128 transitions, 443 flow
[2024-03-12 01:07:41,489 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=103, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=443, PETRI_PLACES=120, PETRI_TRANSITIONS=128}
[2024-03-12 01:07:41,490 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places.
[2024-03-12 01:07:41,490 INFO  L495      AbstractCegarLoop]: Abstraction has has 120 places, 128 transitions, 443 flow
[2024-03-12 01:07:41,490 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:07:41,490 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:41,490 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:07:41,491 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 01:07:41,491 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:07:41,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:41,491 INFO  L85        PathProgramCache]: Analyzing trace with hash 73880186, now seen corresponding path program 1 times
[2024-03-12 01:07:41,491 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:41,492 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766350077]
[2024-03-12 01:07:41,492 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:41,492 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:41,511 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:41,745 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:07:41,746 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:41,746 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766350077]
[2024-03-12 01:07:41,746 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766350077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:41,746 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:41,746 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:41,747 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376756147]
[2024-03-12 01:07:41,747 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:41,747 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:07:41,747 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:41,748 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:07:41,748 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:07:41,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 73 out of 103
[2024-03-12 01:07:41,842 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 128 transitions, 443 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:07:41,842 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:41,842 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 103
[2024-03-12 01:07:41,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:42,114 INFO  L124   PetriNetUnfolderBase]: 338/1193 cut-off events.
[2024-03-12 01:07:42,115 INFO  L125   PetriNetUnfolderBase]: For 436/520 co-relation queries the response was YES.
[2024-03-12 01:07:42,118 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2762 conditions, 1193 events. 338/1193 cut-off events. For 436/520 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8265 event pairs, 67 based on Foata normal form. 14/1141 useless extension candidates. Maximal degree in co-relation 2692. Up to 597 conditions per place. 
[2024-03-12 01:07:42,121 INFO  L140   encePairwiseOnDemand]: 80/103 looper letters, 49 selfloop transitions, 82 changer transitions 2/209 dead transitions.
[2024-03-12 01:07:42,121 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 209 transitions, 1045 flow
[2024-03-12 01:07:42,122 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:42,122 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:42,123 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 535 transitions.
[2024-03-12 01:07:42,123 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8656957928802589
[2024-03-12 01:07:42,123 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 535 transitions.
[2024-03-12 01:07:42,123 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 535 transitions.
[2024-03-12 01:07:42,124 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:42,124 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 535 transitions.
[2024-03-12 01:07:42,125 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:07:42,126 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:07:42,127 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:07:42,127 INFO  L175             Difference]: Start difference. First operand has 120 places, 128 transitions, 443 flow. Second operand 6 states and 535 transitions.
[2024-03-12 01:07:42,127 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 209 transitions, 1045 flow
[2024-03-12 01:07:42,132 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 209 transitions, 1031 flow, removed 5 selfloop flow, removed 5 redundant places.
[2024-03-12 01:07:42,134 INFO  L231             Difference]: Finished difference. Result has 122 places, 207 transitions, 1149 flow
[2024-03-12 01:07:42,134 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=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1149, PETRI_PLACES=122, PETRI_TRANSITIONS=207}
[2024-03-12 01:07:42,135 INFO  L281   CegarLoopForPetriNet]: 102 programPoint places, 20 predicate places.
[2024-03-12 01:07:42,135 INFO  L495      AbstractCegarLoop]: Abstraction has has 122 places, 207 transitions, 1149 flow
[2024-03-12 01:07:42,136 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:07:42,136 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:42,136 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1]
[2024-03-12 01:07:42,136 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 01:07:42,136 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 4 more)] ===
[2024-03-12 01:07:42,137 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:42,137 INFO  L85        PathProgramCache]: Analyzing trace with hash -2142844699, now seen corresponding path program 1 times
[2024-03-12 01:07:42,137 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:42,137 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69193895]
[2024-03-12 01:07:42,137 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:42,137 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:42,160 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:07:42,160 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 01:07:42,172 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 01:07:42,190 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 01:07:42,191 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 01:07:42,191 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining)
[2024-03-12 01:07:42,193 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining)
[2024-03-12 01:07:42,193 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining)
[2024-03-12 01:07:42,193 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining)
[2024-03-12 01:07:42,194 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining)
[2024-03-12 01:07:42,194 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining)
[2024-03-12 01:07:42,194 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining)
[2024-03-12 01:07:42,194 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 01:07:42,195 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1]
[2024-03-12 01:07:42,197 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 01:07:42,197 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 01:07:42,214 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 01:07:42,217 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 121 transitions, 258 flow
[2024-03-12 01:07:42,240 INFO  L124   PetriNetUnfolderBase]: 11/271 cut-off events.
[2024-03-12 01:07:42,240 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 01:07:42,241 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 283 conditions, 271 events. 11/271 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 656 event pairs, 0 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 154. Up to 8 conditions per place. 
[2024-03-12 01:07:42,241 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 121 transitions, 258 flow
[2024-03-12 01:07:42,242 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 121 transitions, 258 flow
[2024-03-12 01:07:42,243 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 01:07:42,244 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;@50fad0a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 01:07:42,244 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 8 error locations.
[2024-03-12 01:07:42,247 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 01:07:42,247 INFO  L124   PetriNetUnfolderBase]: 3/47 cut-off events.
[2024-03-12 01:07:42,247 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 01:07:42,247 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:42,247 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]
[2024-03-12 01:07:42,247 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:07:42,248 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:42,248 INFO  L85        PathProgramCache]: Analyzing trace with hash 508585762, now seen corresponding path program 1 times
[2024-03-12 01:07:42,248 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:42,248 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606980011]
[2024-03-12 01:07:42,248 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:42,248 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:42,258 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:42,419 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:07:42,419 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:42,419 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606980011]
[2024-03-12 01:07:42,419 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606980011] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:42,419 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:42,419 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:42,420 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403096174]
[2024-03-12 01:07:42,420 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:42,420 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:07:42,420 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:42,421 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:07:42,421 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:07:42,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 121
[2024-03-12 01:07:42,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 121 transitions, 258 flow. Second operand  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:07:42,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:42,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 121
[2024-03-12 01:07:42,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:43,157 INFO  L124   PetriNetUnfolderBase]: 1710/4914 cut-off events.
[2024-03-12 01:07:43,158 INFO  L125   PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES.
[2024-03-12 01:07:43,163 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7978 conditions, 4914 events. 1710/4914 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 40601 event pairs, 258 based on Foata normal form. 85/4617 useless extension candidates. Maximal degree in co-relation 4669. Up to 2239 conditions per place. 
[2024-03-12 01:07:43,199 INFO  L140   encePairwiseOnDemand]: 91/121 looper letters, 46 selfloop transitions, 48 changer transitions 1/178 dead transitions.
[2024-03-12 01:07:43,200 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 178 transitions, 571 flow
[2024-03-12 01:07:43,200 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:43,201 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:43,201 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions.
[2024-03-12 01:07:43,202 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8347107438016529
[2024-03-12 01:07:43,202 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 606 transitions.
[2024-03-12 01:07:43,202 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions.
[2024-03-12 01:07:43,202 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:43,202 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions.
[2024-03-12 01:07:43,204 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 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:07:43,205 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:43,205 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:43,205 INFO  L175             Difference]: Start difference. First operand has 121 places, 121 transitions, 258 flow. Second operand 6 states and 606 transitions.
[2024-03-12 01:07:43,205 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 178 transitions, 571 flow
[2024-03-12 01:07:43,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 178 transitions, 571 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:07:43,209 INFO  L231             Difference]: Finished difference. Result has 131 places, 165 transitions, 592 flow
[2024-03-12 01:07:43,209 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=592, PETRI_PLACES=131, PETRI_TRANSITIONS=165}
[2024-03-12 01:07:43,209 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-12 01:07:43,210 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 165 transitions, 592 flow
[2024-03-12 01:07:43,210 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 85.16666666666667) internal successors, (511), 6 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:07:43,210 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:43,210 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]
[2024-03-12 01:07:43,210 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-03-12 01:07:43,210 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:07:43,211 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:43,211 INFO  L85        PathProgramCache]: Analyzing trace with hash -955128949, now seen corresponding path program 1 times
[2024-03-12 01:07:43,211 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:43,211 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520808891]
[2024-03-12 01:07:43,211 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:43,211 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:43,222 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:43,269 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:07:43,270 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:43,270 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520808891]
[2024-03-12 01:07:43,270 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520808891] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:43,270 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:43,270 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:43,270 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109889536]
[2024-03-12 01:07:43,270 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:43,271 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 01:07:43,271 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:43,271 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 01:07:43,271 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 01:07:43,319 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 121
[2024-03-12 01:07:43,320 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 165 transitions, 592 flow. Second operand  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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:07:43,320 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:43,320 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 121
[2024-03-12 01:07:43,320 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:43,597 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([285] L1029-5-->L1029-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][108], [136#true, 106#L1029-6true, Black: 124#true, Black: 128#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 20#L1017-6true, Black: 127#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 129#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 87#L1017-7true])
[2024-03-12 01:07:43,598 INFO  L294   olderBase$Statistics]: this new event has 83 ancestors and is not cut-off event
[2024-03-12 01:07:43,598 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-12 01:07:43,598 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-12 01:07:43,598 INFO  L297   olderBase$Statistics]:   existing Event has 83 ancestors and is not cut-off event
[2024-03-12 01:07:43,648 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([285] L1029-5-->L1029-6: Formula: (let ((.cse0 (select |v_#race_20| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0)))  InVars {#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_20|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][108], [136#true, 106#L1029-6true, Black: 124#true, 20#L1017-6true, Black: 128#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 32#L1017-8true, Black: 127#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 126#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), threadThread1of2ForFork0InUse, threadThread2of2ForFork0InUse, 129#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0))])
[2024-03-12 01:07:43,648 INFO  L294   olderBase$Statistics]: this new event has 84 ancestors and is not cut-off event
[2024-03-12 01:07:43,648 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-12 01:07:43,648 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-12 01:07:43,649 INFO  L297   olderBase$Statistics]:   existing Event has 84 ancestors and is not cut-off event
[2024-03-12 01:07:43,724 INFO  L124   PetriNetUnfolderBase]: 1272/4234 cut-off events.
[2024-03-12 01:07:43,725 INFO  L125   PetriNetUnfolderBase]: For 859/866 co-relation queries the response was YES.
[2024-03-12 01:07:43,732 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8176 conditions, 4234 events. 1272/4234 cut-off events. For 859/866 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 36690 event pairs, 190 based on Foata normal form. 1/4001 useless extension candidates. Maximal degree in co-relation 4667. Up to 1362 conditions per place. 
[2024-03-12 01:07:43,745 INFO  L140   encePairwiseOnDemand]: 113/121 looper letters, 14 selfloop transitions, 2 changer transitions 5/171 dead transitions.
[2024-03-12 01:07:43,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 171 transitions, 646 flow
[2024-03-12 01:07:43,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:43,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:43,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 640 transitions.
[2024-03-12 01:07:43,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8815426997245179
[2024-03-12 01:07:43,748 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 640 transitions.
[2024-03-12 01:07:43,748 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 640 transitions.
[2024-03-12 01:07:43,748 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:43,748 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 640 transitions.
[2024-03-12 01:07:43,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.66666666666667) internal successors, (640), 6 states have internal predecessors, (640), 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:07:43,750 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:43,751 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:43,751 INFO  L175             Difference]: Start difference. First operand has 131 places, 165 transitions, 592 flow. Second operand 6 states and 640 transitions.
[2024-03-12 01:07:43,751 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 171 transitions, 646 flow
[2024-03-12 01:07:43,757 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 171 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 01:07:43,759 INFO  L231             Difference]: Finished difference. Result has 139 places, 166 transitions, 614 flow
[2024-03-12 01:07:43,759 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=592, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=614, PETRI_PLACES=139, PETRI_TRANSITIONS=166}
[2024-03-12 01:07:43,760 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-12 01:07:43,760 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 166 transitions, 614 flow
[2024-03-12 01:07:43,760 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 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:07:43,760 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:43,760 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:07:43,760 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-03-12 01:07:43,760 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:07:43,761 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:43,761 INFO  L85        PathProgramCache]: Analyzing trace with hash 1006173482, now seen corresponding path program 1 times
[2024-03-12 01:07:43,761 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:43,761 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615190298]
[2024-03-12 01:07:43,761 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:43,761 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:43,774 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:43,981 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:07:43,981 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:43,981 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615190298]
[2024-03-12 01:07:43,981 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615190298] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:07:43,981 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:07:43,981 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:07:43,981 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146021237]
[2024-03-12 01:07:43,982 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:07:43,982 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:07:43,982 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:43,982 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:07:43,982 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:07:44,125 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-03-12 01:07:44,126 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 166 transitions, 614 flow. Second operand  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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:07:44,126 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:44,126 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-03-12 01:07:44,126 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:45,383 INFO  L124   PetriNetUnfolderBase]: 4894/11716 cut-off events.
[2024-03-12 01:07:45,383 INFO  L125   PetriNetUnfolderBase]: For 5280/6910 co-relation queries the response was YES.
[2024-03-12 01:07:45,405 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 28887 conditions, 11716 events. 4894/11716 cut-off events. For 5280/6910 co-relation queries the response was YES. Maximal size of possible extension queue 453. Compared 105320 event pairs, 1127 based on Foata normal form. 45/11069 useless extension candidates. Maximal degree in co-relation 28816. Up to 6768 conditions per place. 
[2024-03-12 01:07:45,486 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 80 selfloop transitions, 142 changer transitions 0/311 dead transitions.
[2024-03-12 01:07:45,486 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 311 transitions, 1722 flow
[2024-03-12 01:07:45,486 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:07:45,487 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:07:45,488 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions.
[2024-03-12 01:07:45,488 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8774104683195593
[2024-03-12 01:07:45,488 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 637 transitions.
[2024-03-12 01:07:45,488 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 637 transitions.
[2024-03-12 01:07:45,489 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:45,489 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 637 transitions.
[2024-03-12 01:07:45,490 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.16666666666667) internal successors, (637), 6 states have internal predecessors, (637), 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:07:45,491 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:45,491 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:07:45,491 INFO  L175             Difference]: Start difference. First operand has 139 places, 166 transitions, 614 flow. Second operand 6 states and 637 transitions.
[2024-03-12 01:07:45,491 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 311 transitions, 1722 flow
[2024-03-12 01:07:45,503 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 311 transitions, 1710 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 01:07:45,506 INFO  L231             Difference]: Finished difference. Result has 142 places, 303 transitions, 1900 flow
[2024-03-12 01:07:45,507 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1900, PETRI_PLACES=142, PETRI_TRANSITIONS=303}
[2024-03-12 01:07:45,507 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 21 predicate places.
[2024-03-12 01:07:45,507 INFO  L495      AbstractCegarLoop]: Abstraction has has 142 places, 303 transitions, 1900 flow
[2024-03-12 01:07:45,508 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.0) internal successors, (522), 6 states have internal predecessors, (522), 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:07:45,508 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:45,508 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:07:45,508 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 01:07:45,508 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:07:45,508 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:45,508 INFO  L85        PathProgramCache]: Analyzing trace with hash 1649160194, now seen corresponding path program 1 times
[2024-03-12 01:07:45,509 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:45,509 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946318573]
[2024-03-12 01:07:45,509 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:45,509 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:45,524 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:45,858 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:07:45,859 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:45,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946318573]
[2024-03-12 01:07:45,859 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946318573] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:07:45,859 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551150401]
[2024-03-12 01:07:45,860 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:45,860 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:07:45,860 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:07:45,867 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:07:45,869 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:07:45,971 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:45,973 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 24 conjunts are in the unsatisfiable core
[2024-03-12 01:07:45,976 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:07:46,158 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:07:46,192 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:07:46,229 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:07:46,229 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:07:46,273 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:07:46,273 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:07:46,324 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:07:46,325 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:07:46,334 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:07:46,334 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:07:46,360 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-12 01:07:46,394 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_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-12 01:07:46,415 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_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_255 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_255) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))))) is different from false
[2024-03-12 01:07:46,600 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked.
[2024-03-12 01:07:46,600 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [551150401] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:07:46,600 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:07:46,600 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 29
[2024-03-12 01:07:46,600 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025249929]
[2024-03-12 01:07:46,600 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:07:46,601 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-12 01:07:46,601 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:46,602 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-12 01:07:46,602 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=604, Unknown=3, NotChecked=156, Total=870
[2024-03-12 01:07:46,604 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 58 out of 121
[2024-03-12 01:07:46,605 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 303 transitions, 1900 flow. Second operand  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 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:07:46,605 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:46,605 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 121
[2024-03-12 01:07:46,605 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:50,716 INFO  L124   PetriNetUnfolderBase]: 13429/26305 cut-off events.
[2024-03-12 01:07:50,717 INFO  L125   PetriNetUnfolderBase]: For 27116/27150 co-relation queries the response was YES.
[2024-03-12 01:07:50,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 84177 conditions, 26305 events. 13429/26305 cut-off events. For 27116/27150 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 234245 event pairs, 1506 based on Foata normal form. 356/25178 useless extension candidates. Maximal degree in co-relation 71500. Up to 12677 conditions per place. 
[2024-03-12 01:07:50,868 INFO  L140   encePairwiseOnDemand]: 98/121 looper letters, 510 selfloop transitions, 206 changer transitions 1/775 dead transitions.
[2024-03-12 01:07:50,868 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 775 transitions, 6168 flow
[2024-03-12 01:07:50,869 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. 
[2024-03-12 01:07:50,869 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2024-03-12 01:07:50,870 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1139 transitions.
[2024-03-12 01:07:50,871 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6723730814639906
[2024-03-12 01:07:50,871 INFO  L72            ComplementDD]: Start complementDD. Operand 14 states and 1139 transitions.
[2024-03-12 01:07:50,871 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 14 states and 1139 transitions.
[2024-03-12 01:07:50,872 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:50,872 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1139 transitions.
[2024-03-12 01:07:50,874 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 15 states, 14 states have (on average 81.35714285714286) internal successors, (1139), 14 states have internal predecessors, (1139), 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:07:50,876 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 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:07:50,876 INFO  L81            ComplementDD]: Finished complementDD. Result  has 15 states, 15 states have (on average 121.0) internal successors, (1815), 15 states have internal predecessors, (1815), 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:07:50,876 INFO  L175             Difference]: Start difference. First operand has 142 places, 303 transitions, 1900 flow. Second operand 14 states and 1139 transitions.
[2024-03-12 01:07:50,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 775 transitions, 6168 flow
[2024-03-12 01:07:51,197 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 775 transitions, 6114 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-03-12 01:07:51,204 INFO  L231             Difference]: Finished difference. Result has 164 places, 488 transitions, 4174 flow
[2024-03-12 01:07:51,204 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=1846, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4174, PETRI_PLACES=164, PETRI_TRANSITIONS=488}
[2024-03-12 01:07:51,204 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 43 predicate places.
[2024-03-12 01:07:51,205 INFO  L495      AbstractCegarLoop]: Abstraction has has 164 places, 488 transitions, 4174 flow
[2024-03-12 01:07:51,205 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 60.2) internal successors, (1806), 30 states have internal predecessors, (1806), 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:07:51,205 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:07:51,205 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:07:51,211 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:07:51,409 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:07:51,410 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:07:51,411 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:07:51,411 INFO  L85        PathProgramCache]: Analyzing trace with hash 439180956, now seen corresponding path program 1 times
[2024-03-12 01:07:51,412 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:07:51,412 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219762802]
[2024-03-12 01:07:51,412 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:51,412 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:07:51,432 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:51,772 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:07:51,773 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:07:51,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219762802]
[2024-03-12 01:07:51,773 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219762802] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:07:51,773 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587296895]
[2024-03-12 01:07:51,773 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:07:51,773 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:07:51,773 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:07:51,774 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:07:51,778 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:07:51,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:07:51,864 INFO  L262         TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 20 conjunts are in the unsatisfiable core
[2024-03-12 01:07:51,869 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:07:52,045 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:07:52,073 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:07:52,113 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:07:52,164 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:07:52,392 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:07:52,393 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:07:52,427 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:07:52,427 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:07:52,450 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0))) is different from false
[2024-03-12 01:07:52,563 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store |c_#race| v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0))))) is different from false
[2024-03-12 01:07:52,612 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_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21)))))) is different from false
[2024-03-12 01:07:52,658 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_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)) (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= 0 (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1))))))))) is different from false
[2024-03-12 01:07:52,699 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) (.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse3 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0) .cse2 0) .cse3 0)))) (and (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2) 0)))) (forall ((v_threadThread1of2ForFork0_~t~0.base_21 Int)) (or (< c_threadThread1of2ForFork0_~arg.base v_threadThread1of2ForFork0_~t~0.base_21) (forall ((v_ArrVal_333 (Array Int Int))) (= (select (select (store .cse0 v_threadThread1of2ForFork0_~t~0.base_21 v_ArrVal_333) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse3) 0))))))) is different from false
[2024-03-12 01:07:52,729 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:07:52,729 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 33 treesize of output 49
[2024-03-12 01:07:52,735 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:07:52,735 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 60 treesize of output 34
[2024-03-12 01:07:52,738 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 5 treesize of output 3
[2024-03-12 01:07:52,746 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:07:52,747 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 1
[2024-03-12 01:07:52,752 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:07:52,752 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 1
[2024-03-12 01:07:52,758 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:07:52,758 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 1
[2024-03-12 01:07:52,876 INFO  L134       CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-12 01:07:52,876 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587296895] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:07:52,876 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:07:52,876 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 33
[2024-03-12 01:07:52,876 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26893143]
[2024-03-12 01:07:52,876 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:07:52,877 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 34 states
[2024-03-12 01:07:52,878 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:07:52,878 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants.
[2024-03-12 01:07:52,878 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=701, Unknown=5, NotChecked=290, Total=1122
[2024-03-12 01:07:52,939 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 121
[2024-03-12 01:07:52,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 488 transitions, 4174 flow. Second operand  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 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:07:52,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:07:52,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 121
[2024-03-12 01:07:52,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:07:58,724 INFO  L124   PetriNetUnfolderBase]: 15344/30434 cut-off events.
[2024-03-12 01:07:58,725 INFO  L125   PetriNetUnfolderBase]: For 76190/76418 co-relation queries the response was YES.
[2024-03-12 01:07:58,810 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 121317 conditions, 30434 events. 15344/30434 cut-off events. For 76190/76418 co-relation queries the response was YES. Maximal size of possible extension queue 955. Compared 272369 event pairs, 1348 based on Foata normal form. 210/28774 useless extension candidates. Maximal degree in co-relation 113712. Up to 13023 conditions per place. 
[2024-03-12 01:07:58,922 INFO  L140   encePairwiseOnDemand]: 87/121 looper letters, 554 selfloop transitions, 282 changer transitions 4/904 dead transitions.
[2024-03-12 01:07:58,922 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 904 transitions, 8990 flow
[2024-03-12 01:07:58,923 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. 
[2024-03-12 01:07:58,923 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2024-03-12 01:07:58,925 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1187 transitions.
[2024-03-12 01:07:58,925 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6539944903581267
[2024-03-12 01:07:58,925 INFO  L72            ComplementDD]: Start complementDD. Operand 15 states and 1187 transitions.
[2024-03-12 01:07:58,926 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 15 states and 1187 transitions.
[2024-03-12 01:07:58,926 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:07:58,926 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1187 transitions.
[2024-03-12 01:07:58,928 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 16 states, 15 states have (on average 79.13333333333334) internal successors, (1187), 15 states have internal predecessors, (1187), 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:07:58,930 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 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:07:58,931 INFO  L81            ComplementDD]: Finished complementDD. Result  has 16 states, 16 states have (on average 121.0) internal successors, (1936), 16 states have internal predecessors, (1936), 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:07:58,931 INFO  L175             Difference]: Start difference. First operand has 164 places, 488 transitions, 4174 flow. Second operand 15 states and 1187 transitions.
[2024-03-12 01:07:58,931 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 904 transitions, 8990 flow
[2024-03-12 01:08:00,404 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 904 transitions, 8964 flow, removed 8 selfloop flow, removed 4 redundant places.
[2024-03-12 01:08:00,413 INFO  L231             Difference]: Finished difference. Result has 183 places, 643 transitions, 7009 flow
[2024-03-12 01:08:00,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=4150, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=142, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7009, PETRI_PLACES=183, PETRI_TRANSITIONS=643}
[2024-03-12 01:08:00,414 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 62 predicate places.
[2024-03-12 01:08:00,414 INFO  L495      AbstractCegarLoop]: Abstraction has has 183 places, 643 transitions, 7009 flow
[2024-03-12 01:08:00,415 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 34 states, 34 states have (on average 62.05882352941177) internal successors, (2110), 34 states have internal predecessors, (2110), 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:08:00,415 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:00,415 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:08:00,422 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-03-12 01:08:00,616 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,SelfDestructingSolverStorable8
[2024-03-12 01:08:00,617 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:00,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:00,617 INFO  L85        PathProgramCache]: Analyzing trace with hash 485479165, now seen corresponding path program 1 times
[2024-03-12 01:08:00,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:00,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660271615]
[2024-03-12 01:08:00,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:00,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:00,638 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:00,852 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:08:00,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:00,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660271615]
[2024-03-12 01:08:00,853 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660271615] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:00,853 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:00,854 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:00,854 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046760518]
[2024-03-12 01:08:00,854 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:00,855 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:00,855 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:00,856 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:00,856 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:01,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 93 out of 121
[2024-03-12 01:08:01,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 643 transitions, 7009 flow. Second operand  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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:08:01,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:01,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 121
[2024-03-12 01:08:01,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:04,114 INFO  L124   PetriNetUnfolderBase]: 8449/19290 cut-off events.
[2024-03-12 01:08:04,115 INFO  L125   PetriNetUnfolderBase]: For 90805/92367 co-relation queries the response was YES.
[2024-03-12 01:08:04,183 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 88676 conditions, 19290 events. 8449/19290 cut-off events. For 90805/92367 co-relation queries the response was YES. Maximal size of possible extension queue 663. Compared 178455 event pairs, 714 based on Foata normal form. 220/18908 useless extension candidates. Maximal degree in co-relation 85078. Up to 8359 conditions per place. 
[2024-03-12 01:08:04,262 INFO  L140   encePairwiseOnDemand]: 106/121 looper letters, 376 selfloop transitions, 259 changer transitions 0/893 dead transitions.
[2024-03-12 01:08:04,263 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 893 transitions, 11552 flow
[2024-03-12 01:08:04,263 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:04,264 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:04,265 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 623 transitions.
[2024-03-12 01:08:04,265 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8581267217630854
[2024-03-12 01:08:04,265 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 623 transitions.
[2024-03-12 01:08:04,265 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 623 transitions.
[2024-03-12 01:08:04,265 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:04,266 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 623 transitions.
[2024-03-12 01:08:04,267 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 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:08:04,268 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:08:04,268 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:08:04,268 INFO  L175             Difference]: Start difference. First operand has 183 places, 643 transitions, 7009 flow. Second operand 6 states and 623 transitions.
[2024-03-12 01:08:04,268 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 893 transitions, 11552 flow
[2024-03-12 01:08:04,977 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 893 transitions, 11519 flow, removed 0 selfloop flow, removed 5 redundant places.
[2024-03-12 01:08:04,987 INFO  L231             Difference]: Finished difference. Result has 188 places, 891 transitions, 11450 flow
[2024-03-12 01:08:04,988 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=6976, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=643, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=11450, PETRI_PLACES=188, PETRI_TRANSITIONS=891}
[2024-03-12 01:08:04,989 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 67 predicate places.
[2024-03-12 01:08:04,989 INFO  L495      AbstractCegarLoop]: Abstraction has has 188 places, 891 transitions, 11450 flow
[2024-03-12 01:08:04,989 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 94.5) internal successors, (567), 6 states have internal predecessors, (567), 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:08:04,989 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:04,989 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 01:08:04,989 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 01:08:04,989 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:04,990 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:04,990 INFO  L85        PathProgramCache]: Analyzing trace with hash 1064692363, now seen corresponding path program 1 times
[2024-03-12 01:08:04,990 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:04,990 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736844032]
[2024-03-12 01:08:04,990 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:04,990 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:05,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:05,220 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-03-12 01:08:05,220 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:05,220 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736844032]
[2024-03-12 01:08:05,220 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736844032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 01:08:05,220 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 01:08:05,220 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 01:08:05,220 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620606856]
[2024-03-12 01:08:05,220 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 01:08:05,221 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 01:08:05,221 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:05,221 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 01:08:05,221 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 01:08:05,370 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 85 out of 121
[2024-03-12 01:08:05,371 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 891 transitions, 11450 flow. Second operand  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:05,371 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:05,371 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 121
[2024-03-12 01:08:05,371 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:11,638 INFO  L124   PetriNetUnfolderBase]: 15893/34835 cut-off events.
[2024-03-12 01:08:11,639 INFO  L125   PetriNetUnfolderBase]: For 182336/194206 co-relation queries the response was YES.
[2024-03-12 01:08:11,795 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164201 conditions, 34835 events. 15893/34835 cut-off events. For 182336/194206 co-relation queries the response was YES. Maximal size of possible extension queue 1317. Compared 354859 event pairs, 1992 based on Foata normal form. 661/34012 useless extension candidates. Maximal degree in co-relation 158902. Up to 19960 conditions per place. 
[2024-03-12 01:08:11,931 INFO  L140   encePairwiseOnDemand]: 94/121 looper letters, 685 selfloop transitions, 495 changer transitions 4/1322 dead transitions.
[2024-03-12 01:08:11,931 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 1322 transitions, 18790 flow
[2024-03-12 01:08:11,932 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 01:08:11,932 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 01:08:11,933 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions.
[2024-03-12 01:08:11,933 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.871900826446281
[2024-03-12 01:08:11,933 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 633 transitions.
[2024-03-12 01:08:11,933 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 633 transitions.
[2024-03-12 01:08:11,934 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:11,934 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 633 transitions.
[2024-03-12 01:08:11,935 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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:08:11,935 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:08:11,936 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 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:08:11,936 INFO  L175             Difference]: Start difference. First operand has 188 places, 891 transitions, 11450 flow. Second operand 6 states and 633 transitions.
[2024-03-12 01:08:11,936 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 1322 transitions, 18790 flow
[2024-03-12 01:08:13,968 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1322 transitions, 18574 flow, removed 108 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:13,984 INFO  L231             Difference]: Finished difference. Result has 198 places, 1314 transitions, 18684 flow
[2024-03-12 01:08:13,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=11342, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=891, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=549, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=18684, PETRI_PLACES=198, PETRI_TRANSITIONS=1314}
[2024-03-12 01:08:13,985 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 77 predicate places.
[2024-03-12 01:08:13,985 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 1314 transitions, 18684 flow
[2024-03-12 01:08:13,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 87.16666666666667) internal successors, (523), 6 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 01:08:13,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:13,985 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:08:13,985 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 01:08:13,986 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:13,986 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:13,986 INFO  L85        PathProgramCache]: Analyzing trace with hash -2136617976, now seen corresponding path program 1 times
[2024-03-12 01:08:13,986 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:13,986 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041513870]
[2024-03-12 01:08:13,986 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:13,986 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:14,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:14,693 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:08:14,693 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:14,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041513870]
[2024-03-12 01:08:14,694 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041513870] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:08:14,694 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1960334820]
[2024-03-12 01:08:14,694 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:14,694 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:14,694 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:08:14,695 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:08:14,701 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:08:14,802 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:14,804 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 48 conjunts are in the unsatisfiable core
[2024-03-12 01:08:14,813 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:08:14,821 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:08:14,832 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:08:14,833 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14
[2024-03-12 01:08:14,908 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:08:14,920 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 01:08:14,920 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:08:15,086 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:08:15,086 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 34 treesize of output 33
[2024-03-12 01:08:15,209 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:08:15,228 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:08:15,289 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 21 treesize of output 20
[2024-03-12 01:08:15,336 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:08:15,336 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 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:08:15,393 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:08:15,393 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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:08:15,617 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:08:15,674 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:08:15,700 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:08:15,721 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:08:15,741 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:08:15,778 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:08:15,792 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:08:15,792 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:08:15,817 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset)))) is different from false
[2024-03-12 01:08:15,847 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))) is different from false
[2024-03-12 01:08:15,900 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|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse0 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))))) is different from false
[2024-03-12 01:08:16,039 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))))) is different from false
[2024-03-12 01:08:16,063 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_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_522 (Array Int Int)) (v_ArrVal_521 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_521) .cse1 v_ArrVal_522) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-12 01:08:16,389 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:08:16,398 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:08:16,530 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:08:16,531 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1960334820] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:08:16,531 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:08:16,531 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 42
[2024-03-12 01:08:16,531 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724307443]
[2024-03-12 01:08:16,531 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:08:16,532 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-03-12 01:08:16,533 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:16,533 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-03-12 01:08:16,534 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1267, Unknown=11, NotChecked=380, Total=1806
[2024-03-12 01:08:16,569 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-12 01:08:16,571 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 1314 transitions, 18684 flow. Second operand  has 43 states, 43 states have (on average 52.116279069767444) internal successors, (2241), 43 states have internal predecessors, (2241), 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:08:16,571 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:16,571 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-12 01:08:16,571 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:08:35,824 INFO  L124   PetriNetUnfolderBase]: 31367/58993 cut-off events.
[2024-03-12 01:08:35,825 INFO  L125   PetriNetUnfolderBase]: For 386487/386623 co-relation queries the response was YES.
[2024-03-12 01:08:36,184 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 310839 conditions, 58993 events. 31367/58993 cut-off events. For 386487/386623 co-relation queries the response was YES. Maximal size of possible extension queue 1837. Compared 555786 event pairs, 3321 based on Foata normal form. 52/58794 useless extension candidates. Maximal degree in co-relation 289877. Up to 36625 conditions per place. 
[2024-03-12 01:08:36,435 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 1775 selfloop transitions, 460 changer transitions 22/2308 dead transitions.
[2024-03-12 01:08:36,436 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 2308 transitions, 34801 flow
[2024-03-12 01:08:36,436 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. 
[2024-03-12 01:08:36,436 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 35 states.
[2024-03-12 01:08:36,440 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 2206 transitions.
[2024-03-12 01:08:36,441 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5208972845336481
[2024-03-12 01:08:36,441 INFO  L72            ComplementDD]: Start complementDD. Operand 35 states and 2206 transitions.
[2024-03-12 01:08:36,441 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 35 states and 2206 transitions.
[2024-03-12 01:08:36,442 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:08:36,442 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 35 states and 2206 transitions.
[2024-03-12 01:08:36,446 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 36 states, 35 states have (on average 63.02857142857143) internal successors, (2206), 35 states have internal predecessors, (2206), 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:08:36,450 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 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:08:36,451 INFO  L81            ComplementDD]: Finished complementDD. Result  has 36 states, 36 states have (on average 121.0) internal successors, (4356), 36 states have internal predecessors, (4356), 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:08:36,451 INFO  L175             Difference]: Start difference. First operand has 198 places, 1314 transitions, 18684 flow. Second operand 35 states and 2206 transitions.
[2024-03-12 01:08:36,451 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 2308 transitions, 34801 flow
[2024-03-12 01:08:44,063 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 2308 transitions, 34477 flow, removed 162 selfloop flow, removed 0 redundant places.
[2024-03-12 01:08:44,090 INFO  L231             Difference]: Finished difference. Result has 250 places, 1645 transitions, 24839 flow
[2024-03-12 01:08:44,091 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=18432, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=24839, PETRI_PLACES=250, PETRI_TRANSITIONS=1645}
[2024-03-12 01:08:44,091 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 129 predicate places.
[2024-03-12 01:08:44,091 INFO  L495      AbstractCegarLoop]: Abstraction has has 250 places, 1645 transitions, 24839 flow
[2024-03-12 01:08:44,092 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 43 states, 43 states have (on average 52.116279069767444) internal successors, (2241), 43 states have internal predecessors, (2241), 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:08:44,092 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:08:44,092 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:08:44,099 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:08:44,293 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:44,297 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:08:44,297 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:08:44,298 INFO  L85        PathProgramCache]: Analyzing trace with hash -251565582, now seen corresponding path program 2 times
[2024-03-12 01:08:44,298 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:08:44,298 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6795140]
[2024-03-12 01:08:44,298 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:08:44,298 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:08:44,319 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:08:44,880 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:08:44,880 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:08:44,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6795140]
[2024-03-12 01:08:44,880 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6795140] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:08:44,880 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352112992]
[2024-03-12 01:08:44,880 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 01:08:44,881 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:08:44,881 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:08:44,882 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:08:44,885 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:08:45,019 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:08:45,019 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:08:45,021 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-03-12 01:08:45,027 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:08:45,044 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:08:45,119 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:08:45,119 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:08:45,289 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:08:45,290 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:08:45,399 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:08:45,400 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:08:45,473 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:08:45,484 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:08:45,491 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:08:45,501 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:08:45,501 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:08:45,516 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:08:45,517 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:08:45,539 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:08:45,546 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:08:45,546 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:08:45,568 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1))))) is different from false
[2024-03-12 01:08:45,585 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_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_622 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:08:45,601 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_622 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_622 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_622 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_622 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_622) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:08:45,682 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_613) |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:08:45,688 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (not (= c_threadThread1of2ForFork0_~arg.base (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~arg.base v_ArrVal_613) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-12 01:08:45,728 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_613 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_613) |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:08:45,785 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (not (= |c_ULTIMATE.start_main_~t~1#1.base| (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_612) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-12 01:08:45,804 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int)) (v_ArrVal_613 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_612) |c_ULTIMATE.start_main_#t~malloc7#1.base| v_ArrVal_613) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~malloc7#1.base|))) is different from false
[2024-03-12 01:08:45,895 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:08:45,900 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:08:45,905 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:08:46,001 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:08:46,001 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:08:46,044 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:08:46,044 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [352112992] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:08:46,044 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:08:46,045 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 39
[2024-03-12 01:08:46,045 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251165520]
[2024-03-12 01:08:46,045 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:08:46,045 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 40 states
[2024-03-12 01:08:46,046 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:08:46,046 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants.
[2024-03-12 01:08:46,046 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=885, Unknown=18, NotChecked=536, Total=1560
[2024-03-12 01:08:46,142 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-12 01:08:46,144 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 1645 transitions, 24839 flow. Second operand  has 40 states, 40 states have (on average 51.95) internal successors, (2078), 40 states have internal predecessors, (2078), 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:08:46,144 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:08:46,144 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-12 01:08:46,144 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:09:16,507 INFO  L124   PetriNetUnfolderBase]: 41864/77234 cut-off events.
[2024-03-12 01:09:16,508 INFO  L125   PetriNetUnfolderBase]: For 623285/623795 co-relation queries the response was YES.
[2024-03-12 01:09:17,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 450191 conditions, 77234 events. 41864/77234 cut-off events. For 623285/623795 co-relation queries the response was YES. Maximal size of possible extension queue 2526. Compared 746442 event pairs, 5130 based on Foata normal form. 397/77330 useless extension candidates. Maximal degree in co-relation 449363. Up to 41532 conditions per place. 
[2024-03-12 01:09:17,543 INFO  L140   encePairwiseOnDemand]: 77/121 looper letters, 2332 selfloop transitions, 1031 changer transitions 27/3441 dead transitions.
[2024-03-12 01:09:17,543 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 3441 transitions, 56941 flow
[2024-03-12 01:09:17,544 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. 
[2024-03-12 01:09:17,544 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 34 states.
[2024-03-12 01:09:17,546 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2218 transitions.
[2024-03-12 01:09:17,546 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5391346621293145
[2024-03-12 01:09:17,546 INFO  L72            ComplementDD]: Start complementDD. Operand 34 states and 2218 transitions.
[2024-03-12 01:09:17,546 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 34 states and 2218 transitions.
[2024-03-12 01:09:17,547 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:09:17,548 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 2218 transitions.
[2024-03-12 01:09:17,551 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 35 states, 34 states have (on average 65.23529411764706) internal successors, (2218), 34 states have internal predecessors, (2218), 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:09:17,555 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 35 states, 35 states have (on average 121.0) internal successors, (4235), 35 states have internal predecessors, (4235), 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:09:17,556 INFO  L81            ComplementDD]: Finished complementDD. Result  has 35 states, 35 states have (on average 121.0) internal successors, (4235), 35 states have internal predecessors, (4235), 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:09:17,556 INFO  L175             Difference]: Start difference. First operand has 250 places, 1645 transitions, 24839 flow. Second operand 34 states and 2218 transitions.
[2024-03-12 01:09:17,556 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 3441 transitions, 56941 flow
[2024-03-12 01:09:32,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 3441 transitions, 56779 flow, removed 75 selfloop flow, removed 6 redundant places.
[2024-03-12 01:09:32,902 INFO  L231             Difference]: Finished difference. Result has 291 places, 2415 transitions, 42532 flow
[2024-03-12 01:09:32,903 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=24717, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=351, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=921, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=42532, PETRI_PLACES=291, PETRI_TRANSITIONS=2415}
[2024-03-12 01:09:32,903 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 170 predicate places.
[2024-03-12 01:09:32,904 INFO  L495      AbstractCegarLoop]: Abstraction has has 291 places, 2415 transitions, 42532 flow
[2024-03-12 01:09:32,904 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 40 states, 40 states have (on average 51.95) internal successors, (2078), 40 states have internal predecessors, (2078), 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:09:32,904 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:09:32,905 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:09:32,912 INFO  L540       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-03-12 01:09:33,105 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,SelfDestructingSolverStorable12
[2024-03-12 01:09:33,106 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:09:33,106 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:09:33,106 INFO  L85        PathProgramCache]: Analyzing trace with hash 1151282604, now seen corresponding path program 3 times
[2024-03-12 01:09:33,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:09:33,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487862580]
[2024-03-12 01:09:33,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:09:33,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:09:33,131 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:09:33,716 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:09:33,716 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:09:33,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487862580]
[2024-03-12 01:09:33,717 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487862580] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:09:33,717 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576226193]
[2024-03-12 01:09:33,717 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 01:09:33,717 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:09:33,717 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:09:33,718 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:09:33,720 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:09:33,858 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 01:09:33,859 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:09:33,860 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 68 conjunts are in the unsatisfiable core
[2024-03-12 01:09:33,866 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:09:33,959 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:09:34,008 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:09:34,008 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:09:34,113 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:09:34,128 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-03-12 01:09:34,128 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:09:34,461 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-03-12 01:09:34,462 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:09:34,697 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:09:34,739 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:09:34,813 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:09:34,896 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:09:35,323 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:09:35,381 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 30 treesize of output 21
[2024-03-12 01:09:35,409 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:09:35,480 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:09:35,515 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:09:35,541 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:09:35,635 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:09:35,690 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:09:35,690 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:09:35,715 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-12 01:09:35,757 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-12 01:09:35,813 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_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))))) is different from false
[2024-03-12 01:09:35,837 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) .cse0))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-03-12 01:09:35,862 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_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) .cse1 v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) .cse1 v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) .cse1 v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) .cse0) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_721 (Array Int Int)) (v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (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_721) c_threadThread1of2ForFork0_~t~0.base) .cse0 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_726) .cse1 v_ArrVal_727) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))))) is different from false
[2024-03-12 01:09:36,560 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:09:36,561 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 3 case distinctions, treesize of input 196 treesize of output 188
[2024-03-12 01:09:36,575 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:09:36,575 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 129 treesize of output 83
[2024-03-12 01:09:36,583 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:09:36,589 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:09:36,605 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,606 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,608 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,609 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,614 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 01:09:36,614 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 3 case distinctions, treesize of input 30 treesize of output 1
[2024-03-12 01:09:36,616 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,617 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:09:36,622 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 01:09:36,622 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 3 case distinctions, treesize of input 28 treesize of output 1
[2024-03-12 01:09:37,453 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:09:37,464 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:09:37,680 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:09:37,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576226193] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:09:37,681 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:09:37,681 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 21] total 58
[2024-03-12 01:09:37,681 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420245776]
[2024-03-12 01:09:37,681 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:09:37,682 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2024-03-12 01:09:37,682 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:09:37,683 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2024-03-12 01:09:37,683 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2625, Unknown=11, NotChecked=540, Total=3422
[2024-03-12 01:09:37,869 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 34 out of 121
[2024-03-12 01:09:37,871 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 291 places, 2415 transitions, 42532 flow. Second operand  has 59 states, 59 states have (on average 36.13559322033898) internal successors, (2132), 59 states have internal predecessors, (2132), 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:09:37,871 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:09:37,871 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 121
[2024-03-12 01:09:37,871 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:10:29,921 INFO  L124   PetriNetUnfolderBase]: 45820/84484 cut-off events.
[2024-03-12 01:10:29,921 INFO  L125   PetriNetUnfolderBase]: For 943619/944316 co-relation queries the response was YES.
[2024-03-12 01:10:30,850 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 539102 conditions, 84484 events. 45820/84484 cut-off events. For 943619/944316 co-relation queries the response was YES. Maximal size of possible extension queue 2648. Compared 817047 event pairs, 4564 based on Foata normal form. 353/84403 useless extension candidates. Maximal degree in co-relation 538228. Up to 54584 conditions per place. 
[2024-03-12 01:10:31,339 INFO  L140   encePairwiseOnDemand]: 67/121 looper letters, 2570 selfloop transitions, 1120 changer transitions 24/3750 dead transitions.
[2024-03-12 01:10:31,340 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 350 places, 3750 transitions, 68915 flow
[2024-03-12 01:10:31,341 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. 
[2024-03-12 01:10:31,341 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 61 states.
[2024-03-12 01:10:31,343 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 2806 transitions.
[2024-03-12 01:10:31,344 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.38016528925619836
[2024-03-12 01:10:31,344 INFO  L72            ComplementDD]: Start complementDD. Operand 61 states and 2806 transitions.
[2024-03-12 01:10:31,344 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 61 states and 2806 transitions.
[2024-03-12 01:10:31,345 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:10:31,345 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 61 states and 2806 transitions.
[2024-03-12 01:10:31,349 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 62 states, 61 states have (on average 46.0) internal successors, (2806), 61 states have internal predecessors, (2806), 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:10:31,355 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 62 states, 62 states have (on average 121.0) internal successors, (7502), 62 states have internal predecessors, (7502), 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:10:31,357 INFO  L81            ComplementDD]: Finished complementDD. Result  has 62 states, 62 states have (on average 121.0) internal successors, (7502), 62 states have internal predecessors, (7502), 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:10:31,357 INFO  L175             Difference]: Start difference. First operand has 291 places, 2415 transitions, 42532 flow. Second operand 61 states and 2806 transitions.
[2024-03-12 01:10:31,357 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 350 places, 3750 transitions, 68915 flow
[2024-03-12 01:10:56,859 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 3750 transitions, 68361 flow, removed 216 selfloop flow, removed 21 redundant places.
[2024-03-12 01:10:56,912 INFO  L231             Difference]: Finished difference. Result has 341 places, 2840 transitions, 53980 flow
[2024-03-12 01:10:56,914 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=42055, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=738, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=53980, PETRI_PLACES=341, PETRI_TRANSITIONS=2840}
[2024-03-12 01:10:56,915 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 220 predicate places.
[2024-03-12 01:10:56,915 INFO  L495      AbstractCegarLoop]: Abstraction has has 341 places, 2840 transitions, 53980 flow
[2024-03-12 01:10:56,916 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 59 states, 59 states have (on average 36.13559322033898) internal successors, (2132), 59 states have internal predecessors, (2132), 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:10:56,916 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:10:56,916 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:10:56,921 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:10:57,117 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:10:57,118 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:10:57,118 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:10:57,119 INFO  L85        PathProgramCache]: Analyzing trace with hash -955480852, now seen corresponding path program 4 times
[2024-03-12 01:10:57,119 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:10:57,119 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118022602]
[2024-03-12 01:10:57,120 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:10:57,120 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:10:57,142 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:10:57,700 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:10:57,700 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:10:57,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118022602]
[2024-03-12 01:10:57,701 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118022602] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:10:57,701 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479794438]
[2024-03-12 01:10:57,701 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-03-12 01:10:57,701 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:10:57,701 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:10:57,703 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:10:57,704 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:10:57,858 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-03-12 01:10:57,859 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:10:57,861 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 60 conjunts are in the unsatisfiable core
[2024-03-12 01:10:57,875 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:10:57,884 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:10:57,909 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 01:10:57,909 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:10:57,982 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:57,989 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:10:57,989 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:10:58,174 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:10:58,175 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:10:58,302 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:58,303 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:10:58,398 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:10:58,446 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:10:58,496 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:10:58,559 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:10:58,623 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:10:58,691 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:58,694 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:10:58,728 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:58,729 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:10:58,751 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:58,752 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:10:58,782 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:10:58,783 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:10:58,868 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:10:58,928 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:10:58,929 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:10:58,948 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_832 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_832 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_832 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_832 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3))))) is different from false
[2024-03-12 01:11:19,928 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_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-12 01:11:19,951 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_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse2)))))) is different from false
[2024-03-12 01:11:20,140 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 2)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) .cse1 v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) .cse1 v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) .cse1 v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_832 (Array Int Int)) (v_ArrVal_831 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_831) .cse1 v_ArrVal_832) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:11:20,159 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:20,160 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:11:20,168 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:11:20,168 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:11:20,176 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:11:20,181 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:11:20,203 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:11:20,203 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:11:20,212 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:11:20,212 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:11:20,223 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:11:20,223 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:11:20,681 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:11:20,701 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:11:20,930 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:11:20,930 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [479794438] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:11:20,931 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:11:20,931 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 45
[2024-03-12 01:11:20,931 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252822769]
[2024-03-12 01:11:20,932 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:11:20,932 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 46 states
[2024-03-12 01:11:20,933 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:11:20,933 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants.
[2024-03-12 01:11:20,934 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1511, Unknown=60, NotChecked=332, Total=2070
[2024-03-12 01:11:21,271 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-12 01:11:21,273 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 2840 transitions, 53980 flow. Second operand  has 46 states, 46 states have (on average 52.04347826086956) internal successors, (2394), 46 states have internal predecessors, (2394), 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:11:21,273 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:11:21,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-12 01:11:21,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:12:14,195 INFO  L124   PetriNetUnfolderBase]: 44984/83413 cut-off events.
[2024-03-12 01:12:14,195 INFO  L125   PetriNetUnfolderBase]: For 1179927/1180701 co-relation queries the response was YES.
[2024-03-12 01:12:15,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 579886 conditions, 83413 events. 44984/83413 cut-off events. For 1179927/1180701 co-relation queries the response was YES. Maximal size of possible extension queue 2740. Compared 813845 event pairs, 4739 based on Foata normal form. 376/83626 useless extension candidates. Maximal degree in co-relation 577900. Up to 52590 conditions per place. 
[2024-03-12 01:12:15,560 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 2826 selfloop transitions, 1110 changer transitions 18/4035 dead transitions.
[2024-03-12 01:12:15,561 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 4035 transitions, 82330 flow
[2024-03-12 01:12:15,562 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. 
[2024-03-12 01:12:15,562 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 36 states.
[2024-03-12 01:12:15,563 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2302 transitions.
[2024-03-12 01:12:15,564 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5284664830119375
[2024-03-12 01:12:15,564 INFO  L72            ComplementDD]: Start complementDD. Operand 36 states and 2302 transitions.
[2024-03-12 01:12:15,564 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 36 states and 2302 transitions.
[2024-03-12 01:12:15,565 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:12:15,565 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 2302 transitions.
[2024-03-12 01:12:15,568 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 37 states, 36 states have (on average 63.94444444444444) internal successors, (2302), 36 states have internal predecessors, (2302), 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:12:15,570 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 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:12:15,571 INFO  L81            ComplementDD]: Finished complementDD. Result  has 37 states, 37 states have (on average 121.0) internal successors, (4477), 37 states have internal predecessors, (4477), 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:12:15,571 INFO  L175             Difference]: Start difference. First operand has 341 places, 2840 transitions, 53980 flow. Second operand 36 states and 2302 transitions.
[2024-03-12 01:12:15,571 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 4035 transitions, 82330 flow
[2024-03-12 01:12:38,904 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 4035 transitions, 81056 flow, removed 445 selfloop flow, removed 32 redundant places.
[2024-03-12 01:12:38,965 INFO  L231             Difference]: Finished difference. Result has 356 places, 3212 transitions, 65618 flow
[2024-03-12 01:12:38,967 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=52921, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2840, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=782, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1925, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=65618, PETRI_PLACES=356, PETRI_TRANSITIONS=3212}
[2024-03-12 01:12:38,967 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 235 predicate places.
[2024-03-12 01:12:38,968 INFO  L495      AbstractCegarLoop]: Abstraction has has 356 places, 3212 transitions, 65618 flow
[2024-03-12 01:12:38,968 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 46 states, 46 states have (on average 52.04347826086956) internal successors, (2394), 46 states have internal predecessors, (2394), 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:12:38,968 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:12:38,968 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:12:38,977 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:12:39,169 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,SelfDestructingSolverStorable14
[2024-03-12 01:12:39,170 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:12:39,170 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:12:39,171 INFO  L85        PathProgramCache]: Analyzing trace with hash -616044336, now seen corresponding path program 5 times
[2024-03-12 01:12:39,171 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:12:39,172 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143238327]
[2024-03-12 01:12:39,172 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:12:39,172 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:12:39,194 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:12:40,019 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 01:12:40,019 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:12:40,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143238327]
[2024-03-12 01:12:40,020 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143238327] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:12:40,020 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440964759]
[2024-03-12 01:12:40,020 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-03-12 01:12:40,020 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:12:40,021 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:12:40,022 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:12:40,023 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:12:40,191 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 01:12:40,191 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:12:40,193 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 58 conjunts are in the unsatisfiable core
[2024-03-12 01:12:40,199 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:12:40,244 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:12:40,377 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:12:40,378 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:12:40,752 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:12:40,753 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:12:40,994 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:12:40,995 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:12:41,064 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:12:41,139 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:12:41,439 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:12:41,515 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:12:41,639 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:12:41,641 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 30 treesize of output 21
[2024-03-12 01:12:41,663 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:12:41,664 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 30 treesize of output 21
[2024-03-12 01:12:41,703 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:12:41,704 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 30 treesize of output 21
[2024-03-12 01:12:41,729 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:12:41,729 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 30 treesize of output 21
[2024-03-12 01:12:41,840 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:12:41,923 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:12:41,990 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:12:41,990 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:12:42,020 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_936 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 3)))) (forall ((v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2))))) is different from false
[2024-03-12 01:12:42,040 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_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_936 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-12 01:12:42,091 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933))) (store .cse0 c_threadThread1of2ForFork0_~t~0.base (store (select .cse0 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse2 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933))) (store .cse2 c_threadThread1of2ForFork0_~t~0.base (store (select .cse2 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (let ((.cse3 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933))) (store .cse3 c_threadThread1of2ForFork0_~t~0.base (store (select .cse3 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (let ((.cse4 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933))) (store .cse4 c_threadThread1of2ForFork0_~t~0.base (store (select .cse4 c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|))) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))))) is different from false
[2024-03-12 01:12:42,176 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 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) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:12:42,219 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|))) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ c_threadThread1of2ForFork0_~t~0.offset 3))) (and (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse3) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-12 01:12:42,397 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 2))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~t~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse4 |c_threadThread1of2ForFork0_#t~nondet4|) .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_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse3))) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) .cse4) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_933 (Array Int Int)) (v_ArrVal_936 (Array Int Int))) (= (select (select (store (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_933) c_threadThread1of2ForFork0_~t~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)) .cse2 v_ArrVal_936) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:12:42,417 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:42,417 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 3 case distinctions, treesize of input 55 treesize of output 65
[2024-03-12 01:12:42,426 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:42,426 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 53
[2024-03-12 01:12:42,434 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 15 treesize of output 11
[2024-03-12 01:12:42,438 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:12:42,454 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,455 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,458 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,459 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,465 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 01:12:42,465 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 3 case distinctions, treesize of input 28 treesize of output 1
[2024-03-12 01:12:42,467 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,468 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 01:12:42,472 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 01:12:42,473 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 3 case distinctions, treesize of input 30 treesize of output 1
[2024-03-12 01:12:42,913 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:12:42,925 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:12:43,074 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:12:43,075 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:12:43,148 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:12:43,148 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440964759] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:12:43,149 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:12:43,149 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 46
[2024-03-12 01:12:43,149 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431252040]
[2024-03-12 01:12:43,150 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:12:43,150 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2024-03-12 01:12:43,151 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:12:43,152 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2024-03-12 01:12:43,152 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1499, Unknown=9, NotChecked=498, Total=2162
[2024-03-12 01:12:43,287 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-12 01:12:43,289 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 3212 transitions, 65618 flow. Second operand  has 47 states, 47 states have (on average 52.02127659574468) internal successors, (2445), 47 states have internal predecessors, (2445), 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:12:43,289 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:12:43,289 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-12 01:12:43,290 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:13:40,002 INFO  L124   PetriNetUnfolderBase]: 45253/83952 cut-off events.
[2024-03-12 01:13:40,002 INFO  L125   PetriNetUnfolderBase]: For 1388001/1388889 co-relation queries the response was YES.
[2024-03-12 01:13:41,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 612790 conditions, 83952 events. 45253/83952 cut-off events. For 1388001/1388889 co-relation queries the response was YES. Maximal size of possible extension queue 2762. Compared 820981 event pairs, 4665 based on Foata normal form. 453/84241 useless extension candidates. Maximal degree in co-relation 601811. Up to 53175 conditions per place. 
[2024-03-12 01:13:41,742 INFO  L140   encePairwiseOnDemand]: 78/121 looper letters, 2863 selfloop transitions, 1217 changer transitions 14/4175 dead transitions.
[2024-03-12 01:13:41,743 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 4175 transitions, 89377 flow
[2024-03-12 01:13:41,744 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. 
[2024-03-12 01:13:41,744 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 38 states.
[2024-03-12 01:13:41,745 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2425 transitions.
[2024-03-12 01:13:41,746 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5274032187907786
[2024-03-12 01:13:41,746 INFO  L72            ComplementDD]: Start complementDD. Operand 38 states and 2425 transitions.
[2024-03-12 01:13:41,746 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 38 states and 2425 transitions.
[2024-03-12 01:13:41,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:13:41,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 2425 transitions.
[2024-03-12 01:13:41,749 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 39 states, 38 states have (on average 63.81578947368421) internal successors, (2425), 38 states have internal predecessors, (2425), 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:13:41,753 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 39 states, 39 states have (on average 121.0) internal successors, (4719), 39 states have internal predecessors, (4719), 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:13:41,753 INFO  L81            ComplementDD]: Finished complementDD. Result  has 39 states, 39 states have (on average 121.0) internal successors, (4719), 39 states have internal predecessors, (4719), 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:13:41,753 INFO  L175             Difference]: Start difference. First operand has 356 places, 3212 transitions, 65618 flow. Second operand 38 states and 2425 transitions.
[2024-03-12 01:13:41,753 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 4175 transitions, 89377 flow
[2024-03-12 01:14:22,947 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 4175 transitions, 88679 flow, removed 225 selfloop flow, removed 21 redundant places.
[2024-03-12 01:14:23,014 INFO  L231             Difference]: Finished difference. Result has 381 places, 3408 transitions, 74030 flow
[2024-03-12 01:14:23,016 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=64962, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2073, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=74030, PETRI_PLACES=381, PETRI_TRANSITIONS=3408}
[2024-03-12 01:14:23,017 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 260 predicate places.
[2024-03-12 01:14:23,017 INFO  L495      AbstractCegarLoop]: Abstraction has has 381 places, 3408 transitions, 74030 flow
[2024-03-12 01:14:23,017 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 52.02127659574468) internal successors, (2445), 47 states have internal predecessors, (2445), 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:14:23,017 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:14:23,018 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:14:23,023 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-03-12 01:14:23,218 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,SelfDestructingSolverStorable15
[2024-03-12 01:14:23,218 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:14:23,219 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:14:23,220 INFO  L85        PathProgramCache]: Analyzing trace with hash 753974903, now seen corresponding path program 1 times
[2024-03-12 01:14:23,220 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:14:23,220 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713210667]
[2024-03-12 01:14:23,220 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:14:23,220 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:14:23,243 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:14:23,869 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:14:23,869 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:14:23,869 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713210667]
[2024-03-12 01:14:23,869 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713210667] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:14:23,870 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86252694]
[2024-03-12 01:14:23,870 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:14:23,870 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:14:23,870 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:14:23,871 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:14:23,873 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:14:24,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:14:24,011 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-03-12 01:14:24,015 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:14:24,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:14:24,055 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 01:14:24,055 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:14:24,170 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:14:24,183 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:14:24,183 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:14:24,432 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:14:24,432 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:14:24,621 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 01:14:24,622 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:14:24,716 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:14:24,739 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:14:24,752 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:14:24,772 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:14:24,772 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:14:24,793 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:14:24,793 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:14:24,818 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:14:24,834 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:14:24,834 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:14:24,864 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)))) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse0)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse0)) 0)))) is different from false
[2024-03-12 01:14:24,885 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse2)) 0)))))) is different from false
[2024-03-12 01:14:24,907 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) (.cse3 (+ 3 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2))) (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|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse1) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse2)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3) 0)))))) is different from false
[2024-03-12 01:14:24,932 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)) (.cse2 (+ 2 |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) (.cse3 (+ 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) .cse2 0) .cse3 0)))) (and (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) (+ |c_ULTIMATE.start_main_#t~mem13#1.offset| .cse1)) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse2) 0)) (forall ((v_ArrVal_1033 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse3))) (forall ((v_ArrVal_1033 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1033) |c_ULTIMATE.start_main_#t~mem13#1.base|) .cse4) 0)))))) is different from false
[2024-03-12 01:14:24,957 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:14:24,957 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:14:24,964 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:14:24,965 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:14:24,977 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:14:24,977 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:14:24,988 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:14:24,988 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:14:24,995 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-03-12 01:14:24,996 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:14:25,045 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_threadThread1of2ForFork0_~t~0.base v_ArrVal_1028) |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:14:25,173 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1028) |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:14:25,180 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem10#1.base| v_ArrVal_1027) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1028) |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:14:25,202 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1028 (Array Int Int)) (v_ArrVal_1027 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_1027) |c_ULTIMATE.start_main_~t~1#1.base| v_ArrVal_1028) |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:14:25,368 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 163 treesize of output 119
[2024-03-12 01:14:25,374 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:14:25,381 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:14:25,596 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:14:25,596 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [86252694] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:14:25,596 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:14:25,596 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 18] total 40
[2024-03-12 01:14:25,597 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182896644]
[2024-03-12 01:14:25,597 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:14:25,598 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 41 states
[2024-03-12 01:14:25,598 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:14:25,599 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants.
[2024-03-12 01:14:25,599 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=945, Unknown=22, NotChecked=552, Total=1640
[2024-03-12 01:14:25,845 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 46 out of 121
[2024-03-12 01:14:25,847 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 3408 transitions, 74030 flow. Second operand  has 41 states, 41 states have (on average 47.97560975609756) internal successors, (1967), 41 states have internal predecessors, (1967), 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:14:25,847 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:14:25,847 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 121
[2024-03-12 01:14:25,847 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:15:28,120 INFO  L124   PetriNetUnfolderBase]: 43841/83260 cut-off events.
[2024-03-12 01:15:28,120 INFO  L125   PetriNetUnfolderBase]: For 1513953/1514973 co-relation queries the response was YES.
[2024-03-12 01:15:29,321 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 622209 conditions, 83260 events. 43841/83260 cut-off events. For 1513953/1514973 co-relation queries the response was YES. Maximal size of possible extension queue 2718. Compared 830893 event pairs, 4620 based on Foata normal form. 517/83497 useless extension candidates. Maximal degree in co-relation 611939. Up to 37902 conditions per place. 
[2024-03-12 01:15:29,807 INFO  L140   encePairwiseOnDemand]: 90/121 looper letters, 3569 selfloop transitions, 1217 changer transitions 1/4906 dead transitions.
[2024-03-12 01:15:29,808 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 413 places, 4906 transitions, 110861 flow
[2024-03-12 01:15:29,809 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. 
[2024-03-12 01:15:29,809 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 33 states.
[2024-03-12 01:15:29,810 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 1924 transitions.
[2024-03-12 01:15:29,811 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4818432256448785
[2024-03-12 01:15:29,811 INFO  L72            ComplementDD]: Start complementDD. Operand 33 states and 1924 transitions.
[2024-03-12 01:15:29,811 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 33 states and 1924 transitions.
[2024-03-12 01:15:29,811 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:15:29,811 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 1924 transitions.
[2024-03-12 01:15:29,813 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 34 states, 33 states have (on average 58.303030303030305) internal successors, (1924), 33 states have internal predecessors, (1924), 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:15:29,816 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 34 states, 34 states have (on average 121.0) internal successors, (4114), 34 states have internal predecessors, (4114), 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:15:29,816 INFO  L81            ComplementDD]: Finished complementDD. Result  has 34 states, 34 states have (on average 121.0) internal successors, (4114), 34 states have internal predecessors, (4114), 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:15:29,817 INFO  L175             Difference]: Start difference. First operand has 381 places, 3408 transitions, 74030 flow. Second operand 33 states and 1924 transitions.
[2024-03-12 01:15:29,817 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 413 places, 4906 transitions, 110861 flow
[2024-03-12 01:16:19,734 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 4906 transitions, 110085 flow, removed 222 selfloop flow, removed 25 redundant places.
[2024-03-12 01:16:19,813 INFO  L231             Difference]: Finished difference. Result has 400 places, 3940 transitions, 89866 flow
[2024-03-12 01:16:19,815 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=73328, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=735, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2508, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=89866, PETRI_PLACES=400, PETRI_TRANSITIONS=3940}
[2024-03-12 01:16:19,815 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 279 predicate places.
[2024-03-12 01:16:19,816 INFO  L495      AbstractCegarLoop]: Abstraction has has 400 places, 3940 transitions, 89866 flow
[2024-03-12 01:16:19,816 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 41 states, 41 states have (on average 47.97560975609756) internal successors, (1967), 41 states have internal predecessors, (1967), 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:16:19,816 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 01:16:19,816 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:16:19,823 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-03-12 01:16:20,017 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-03-12 01:16:20,018 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 5 more)] ===
[2024-03-12 01:16:20,018 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 01:16:20,018 INFO  L85        PathProgramCache]: Analyzing trace with hash 1935570114, now seen corresponding path program 6 times
[2024-03-12 01:16:20,019 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 01:16:20,019 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575075023]
[2024-03-12 01:16:20,019 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 01:16:20,019 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 01:16:20,039 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 01:16:20,567 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:16:20,567 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 01:16:20,567 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575075023]
[2024-03-12 01:16:20,568 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575075023] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 01:16:20,568 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22023189]
[2024-03-12 01:16:20,568 INFO  L93    rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE
[2024-03-12 01:16:20,568 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 01:16:20,568 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 01:16:20,569 INFO  L229       MonitoredProcess]: Starting monitored process 10 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:16:20,580 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-03-12 01:16:20,723 INFO  L228   tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s)
[2024-03-12 01:16:20,723 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 01:16:20,725 INFO  L262         TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 52 conjunts are in the unsatisfiable core
[2024-03-12 01:16:20,729 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 01:16:20,772 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:16:20,885 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 01:16:20,885 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:16:21,183 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-03-12 01:16:21,184 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:16:21,425 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:16:21,545 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:16:21,599 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:16:21,649 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:16:21,720 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:16:21,792 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:16:21,850 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:16:21,850 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 01:16:22,041 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_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 2)))) (forall ((v_ArrVal_1132 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse1)))))) is different from false
[2024-03-12 01:16:22,060 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_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) (+ c_threadThread1of2ForFork0_~t~0.offset 1)))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1132 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|))))) is different from false
[2024-03-12 01:16:22,080 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_threadThread1of2ForFork0_~t~0.offset 1)) (.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 (store (select |c_#race| c_threadThread1of2ForFork0_~t~0.base) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse1))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) c_threadThread1of2ForFork0_~t~0.offset))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse2))) (forall ((v_ArrVal_1132 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem13#1.base| v_ArrVal_1132) c_threadThread1of2ForFork0_~t~0.base) .cse3)))))) is different from false
[2024-03-12 01:16:22,098 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:16:22,098 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 33 treesize of output 49
[2024-03-12 01:16:22,106 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 01:16:22,107 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 80 treesize of output 30
[2024-03-12 01:16:22,119 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:16:22,119 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:16:22,126 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:16:22,127 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:16:22,133 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 01:16:22,133 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:16:22,449 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 45 treesize of output 29
[2024-03-12 01:16:22,453 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:16:22,520 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:16:22,564 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:16:22,564 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [22023189] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 01:16:22,564 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 01:16:22,564 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 42
[2024-03-12 01:16:22,564 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31548945]
[2024-03-12 01:16:22,564 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 01:16:22,565 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 43 states
[2024-03-12 01:16:22,565 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 01:16:22,566 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants.
[2024-03-12 01:16:22,566 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1375, Unknown=45, NotChecked=234, Total=1806
[2024-03-12 01:16:22,836 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 121
[2024-03-12 01:16:22,838 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 3940 transitions, 89866 flow. Second operand  has 43 states, 43 states have (on average 52.04651162790697) internal successors, (2238), 43 states have internal predecessors, (2238), 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:16:22,838 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 01:16:22,838 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 121
[2024-03-12 01:16:22,838 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 01:18:06,996 INFO  L124   PetriNetUnfolderBase]: 72919/133557 cut-off events.
[2024-03-12 01:18:06,996 INFO  L125   PetriNetUnfolderBase]: For 2726242/2727449 co-relation queries the response was YES.
[2024-03-12 01:18:09,346 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1065358 conditions, 133557 events. 72919/133557 cut-off events. For 2726242/2727449 co-relation queries the response was YES. Maximal size of possible extension queue 4376. Compared 1383384 event pairs, 10070 based on Foata normal form. 691/134087 useless extension candidates. Maximal degree in co-relation 1054140. Up to 59185 conditions per place. 
[2024-03-12 01:18:10,117 INFO  L140   encePairwiseOnDemand]: 76/121 looper letters, 5490 selfloop transitions, 2198 changer transitions 22/7791 dead transitions.
[2024-03-12 01:18:10,117 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 7791 transitions, 186280 flow
[2024-03-12 01:18:10,118 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-12 01:18:10,118 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-12 01:18:10,119 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 1975 transitions.
[2024-03-12 01:18:10,120 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5440771349862259
[2024-03-12 01:18:10,120 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 1975 transitions.
[2024-03-12 01:18:10,120 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 1975 transitions.
[2024-03-12 01:18:10,121 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 01:18:10,121 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 1975 transitions.
[2024-03-12 01:18:10,123 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 65.83333333333333) internal successors, (1975), 30 states have internal predecessors, (1975), 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:18:10,126 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 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:18:10,126 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 121.0) internal successors, (3751), 31 states have internal predecessors, (3751), 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:18:10,126 INFO  L175             Difference]: Start difference. First operand has 400 places, 3940 transitions, 89866 flow. Second operand 30 states and 1975 transitions.
[2024-03-12 01:18:10,126 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 7791 transitions, 186280 flow
Killed by 15
