./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-array-ptr-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-array-ptr-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 cdc29b1387e45581e85156fffd575b453d917f4ddb28253ae99e3d1d59c02f74
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-03-12 00:17:25,885 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-03-12 00:17:25,924 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-03-12 00:17:25,928 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-03-12 00:17:25,928 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-03-12 00:17:25,943 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-03-12 00:17:25,944 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-03-12 00:17:25,944 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-03-12 00:17:25,944 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-03-12 00:17:25,945 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-03-12 00:17:25,945 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-03-12 00:17:25,946 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-03-12 00:17:25,946 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-03-12 00:17:25,946 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-03-12 00:17:25,947 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-03-12 00:17:25,947 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-03-12 00:17:25,947 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-03-12 00:17:25,947 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-03-12 00:17:25,948 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-03-12 00:17:25,948 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-03-12 00:17:25,948 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-03-12 00:17:25,949 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-03-12 00:17:25,949 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-03-12 00:17:25,949 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-03-12 00:17:25,949 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-03-12 00:17:25,950 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-03-12 00:17:25,950 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-03-12 00:17:25,950 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-03-12 00:17:25,950 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-03-12 00:17:25,950 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-03-12 00:17:25,951 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:17:25,951 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-03-12 00:17:25,951 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-03-12 00:17:25,951 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-03-12 00:17:25,951 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-03-12 00:17:25,952 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-03-12 00:17:25,953 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 -> cdc29b1387e45581e85156fffd575b453d917f4ddb28253ae99e3d1d59c02f74
[2024-03-12 00:17:26,142 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-03-12 00:17:26,170 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-03-12 00:17:26,172 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-03-12 00:17:26,173 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-03-12 00:17:26,174 INFO  L274        PluginConnector]: CDTParser initialized
[2024-03-12 00:17:26,175 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i
[2024-03-12 00:17:27,332 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-03-12 00:17:27,529 INFO  L384              CDTParser]: Found 1 translation units.
[2024-03-12 00:17:27,530 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-array-ptr-race.i
[2024-03-12 00:17:27,542 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/379ecbaa2/e29248a388a24c77868d5f0065173711/FLAG00a87bdc9
[2024-03-12 00:17:27,552 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/379ecbaa2/e29248a388a24c77868d5f0065173711
[2024-03-12 00:17:27,554 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-03-12 00:17:27,555 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-03-12 00:17:27,556 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-03-12 00:17:27,556 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-03-12 00:17:27,560 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-03-12 00:17:27,560 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,561 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@510c1cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27, skipping insertion in model container
[2024-03-12 00:17:27,561 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,598 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-03-12 00:17:27,854 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:17:27,861 INFO  L202         MainTranslator]: Completed pre-run
[2024-03-12 00:17:27,905 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-03-12 00:17:27,942 INFO  L206         MainTranslator]: Completed translation
[2024-03-12 00:17:27,943 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27 WrapperNode
[2024-03-12 00:17:27,943 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-03-12 00:17:27,945 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-03-12 00:17:27,945 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-03-12 00:17:27,945 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-03-12 00:17:27,950 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,965 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,985 INFO  L138                Inliner]: procedures = 265, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 99
[2024-03-12 00:17:27,985 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-03-12 00:17:27,986 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-03-12 00:17:27,986 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-03-12 00:17:27,986 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-03-12 00:17:27,993 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,993 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,997 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:27,997 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,005 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,008 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,031 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,035 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,037 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-03-12 00:17:28,038 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-03-12 00:17:28,038 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-03-12 00:17:28,038 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-03-12 00:17:28,040 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (1/1) ...
[2024-03-12 00:17:28,044 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-03-12 00:17:28,051 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:17:28,064 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 00:17:28,067 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 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-03-12 00:17:28,099 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-03-12 00:17:28,099 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-03-12 00:17:28,100 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-03-12 00:17:28,100 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-03-12 00:17:28,101 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 00:17:28,251 INFO  L241             CfgBuilder]: Building ICFG
[2024-03-12 00:17:28,253 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-03-12 00:17:28,449 INFO  L282             CfgBuilder]: Performing block encoding
[2024-03-12 00:17:28,457 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-03-12 00:17:28,458 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-03-12 00:17:28,459 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:17:28 BoogieIcfgContainer
[2024-03-12 00:17:28,459 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-03-12 00:17:28,460 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-03-12 00:17:28,461 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-03-12 00:17:28,463 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-03-12 00:17:28,463 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.03 12:17:27" (1/3) ...
[2024-03-12 00:17:28,463 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b348659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:17:28, skipping insertion in model container
[2024-03-12 00:17:28,463 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.03 12:17:27" (2/3) ...
[2024-03-12 00:17:28,464 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b348659 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.03 12:17:28, skipping insertion in model container
[2024-03-12 00:17:28,464 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.03 12:17:28" (3/3) ...
[2024-03-12 00:17:28,465 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-array-ptr-race.i
[2024-03-12 00:17:28,471 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-03-12 00:17:28,478 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-03-12 00:17:28,478 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations.
[2024-03-12 00:17:28,478 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-03-12 00:17:28,525 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-03-12 00:17:28,553 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 121 places, 122 transitions, 251 flow
[2024-03-12 00:17:28,604 INFO  L124   PetriNetUnfolderBase]: 6/188 cut-off events.
[2024-03-12 00:17:28,604 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-03-12 00:17:28,608 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 193 conditions, 188 events. 6/188 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 378 event pairs, 0 based on Foata normal form. 0/166 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. 
[2024-03-12 00:17:28,608 INFO  L82        GeneralOperation]: Start removeDead. Operand has 121 places, 122 transitions, 251 flow
[2024-03-12 00:17:28,611 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 121 places, 122 transitions, 251 flow
[2024-03-12 00:17:28,618 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:17:28,624 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;@541df568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:17:28,624 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 9 error locations.
[2024-03-12 00:17:28,632 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:17:28,633 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-12 00:17:28,633 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:17:28,633 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:28,633 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:28,634 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:28,637 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:28,638 INFO  L85        PathProgramCache]: Analyzing trace with hash -1959977170, now seen corresponding path program 1 times
[2024-03-12 00:17:28,644 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:28,644 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545748611]
[2024-03-12 00:17:28,644 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:28,645 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:28,738 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:29,131 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 00:17:29,132 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:29,132 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545748611]
[2024-03-12 00:17:29,133 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545748611] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:29,133 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:29,133 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:29,134 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083374223]
[2024-03-12 00:17:29,135 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:29,141 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:29,146 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:29,164 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:29,164 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:29,618 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 97 out of 122
[2024-03-12 00:17:29,622 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 251 flow. Second operand  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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 00:17:29,622 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:29,622 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 122
[2024-03-12 00:17:29,622 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:29,745 INFO  L124   PetriNetUnfolderBase]: 81/497 cut-off events.
[2024-03-12 00:17:29,745 INFO  L125   PetriNetUnfolderBase]: For 4/8 co-relation queries the response was YES.
[2024-03-12 00:17:29,747 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 711 conditions, 497 events. 81/497 cut-off events. For 4/8 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2315 event pairs, 6 based on Foata normal form. 12/466 useless extension candidates. Maximal degree in co-relation 591. Up to 140 conditions per place. 
[2024-03-12 00:17:29,750 INFO  L140   encePairwiseOnDemand]: 102/122 looper letters, 28 selfloop transitions, 24 changer transitions 1/149 dead transitions.
[2024-03-12 00:17:29,750 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 149 transitions, 409 flow
[2024-03-12 00:17:29,751 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:29,753 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:29,761 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-12 00:17:29,764 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-12 00:17:29,764 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-12 00:17:29,765 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-12 00:17:29,767 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:29,769 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-12 00:17:29,773 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 00:17:29,779 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:29,779 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:29,781 INFO  L175             Difference]: Start difference. First operand has 121 places, 122 transitions, 251 flow. Second operand 6 states and 641 transitions.
[2024-03-12 00:17:29,781 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 149 transitions, 409 flow
[2024-03-12 00:17:29,784 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 149 transitions, 409 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:17:29,788 INFO  L231             Difference]: Finished difference. Result has 131 places, 142 transitions, 421 flow
[2024-03-12 00:17:29,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=421, PETRI_PLACES=131, PETRI_TRANSITIONS=142}
[2024-03-12 00:17:29,792 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 10 predicate places.
[2024-03-12 00:17:29,793 INFO  L495      AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 421 flow
[2024-03-12 00:17:29,793 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 states 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 00:17:29,793 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:29,793 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]
[2024-03-12 00:17:29,793 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-03-12 00:17:29,794 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:29,794 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:29,794 INFO  L85        PathProgramCache]: Analyzing trace with hash -1181633295, now seen corresponding path program 1 times
[2024-03-12 00:17:29,795 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:29,795 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882427669]
[2024-03-12 00:17:29,795 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:29,795 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:29,815 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:29,871 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 00:17:29,871 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:29,871 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882427669]
[2024-03-12 00:17:29,871 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882427669] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:29,871 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:29,872 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:29,872 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957016519]
[2024-03-12 00:17:29,872 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:29,873 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:17:29,873 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:29,873 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:17:29,874 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:17:29,933 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 122
[2024-03-12 00:17:29,934 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 421 flow. Second operand  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 00:17:29,934 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:29,934 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 122
[2024-03-12 00:17:29,934 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:29,997 INFO  L124   PetriNetUnfolderBase]: 59/485 cut-off events.
[2024-03-12 00:17:29,997 INFO  L125   PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES.
[2024-03-12 00:17:29,999 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 788 conditions, 485 events. 59/485 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2140 event pairs, 3 based on Foata normal form. 1/457 useless extension candidates. Maximal degree in co-relation 609. Up to 73 conditions per place. 
[2024-03-12 00:17:30,000 INFO  L140   encePairwiseOnDemand]: 114/122 looper letters, 11 selfloop transitions, 6 changer transitions 1/147 dead transitions.
[2024-03-12 00:17:30,000 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 467 flow
[2024-03-12 00:17:30,000 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:30,001 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:30,002 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 655 transitions.
[2024-03-12 00:17:30,002 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.894808743169399
[2024-03-12 00:17:30,002 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 655 transitions.
[2024-03-12 00:17:30,002 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 655 transitions.
[2024-03-12 00:17:30,003 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:30,003 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 655 transitions.
[2024-03-12 00:17:30,004 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states 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 00:17:30,006 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:30,006 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:30,006 INFO  L175             Difference]: Start difference. First operand has 131 places, 142 transitions, 421 flow. Second operand 6 states and 655 transitions.
[2024-03-12 00:17:30,006 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 467 flow
[2024-03-12 00:17:30,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 467 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:17:30,011 INFO  L231             Difference]: Finished difference. Result has 139 places, 146 transitions, 463 flow
[2024-03-12 00:17:30,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=463, PETRI_PLACES=139, PETRI_TRANSITIONS=146}
[2024-03-12 00:17:30,012 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 18 predicate places.
[2024-03-12 00:17:30,012 INFO  L495      AbstractCegarLoop]: Abstraction has has 139 places, 146 transitions, 463 flow
[2024-03-12 00:17:30,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states 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 00:17:30,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:30,013 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]
[2024-03-12 00:17:30,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-03-12 00:17:30,013 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:30,014 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:30,014 INFO  L85        PathProgramCache]: Analyzing trace with hash -1309427349, now seen corresponding path program 1 times
[2024-03-12 00:17:30,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:30,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997774293]
[2024-03-12 00:17:30,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:30,015 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:30,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:30,217 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 00:17:30,217 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:30,217 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997774293]
[2024-03-12 00:17:30,217 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997774293] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:30,218 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:30,218 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:30,218 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341961227]
[2024-03-12 00:17:30,218 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:30,219 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:30,219 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:30,219 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:30,220 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:30,514 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 91 out of 122
[2024-03-12 00:17:30,515 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 146 transitions, 463 flow. Second operand  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 00:17:30,516 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:30,516 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 122
[2024-03-12 00:17:30,516 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:30,687 INFO  L124   PetriNetUnfolderBase]: 207/964 cut-off events.
[2024-03-12 00:17:30,687 INFO  L125   PetriNetUnfolderBase]: For 329/329 co-relation queries the response was YES.
[2024-03-12 00:17:30,691 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1947 conditions, 964 events. 207/964 cut-off events. For 329/329 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5981 event pairs, 9 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1814. Up to 294 conditions per place. 
[2024-03-12 00:17:30,693 INFO  L140   encePairwiseOnDemand]: 99/122 looper letters, 51 selfloop transitions, 50 changer transitions 4/206 dead transitions.
[2024-03-12 00:17:30,693 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 206 transitions, 900 flow
[2024-03-12 00:17:30,694 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:30,694 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:30,696 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions.
[2024-03-12 00:17:30,697 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8415300546448088
[2024-03-12 00:17:30,697 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 616 transitions.
[2024-03-12 00:17:30,698 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions.
[2024-03-12 00:17:30,698 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:30,699 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions.
[2024-03-12 00:17:30,701 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 00:17:30,704 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:30,705 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:30,705 INFO  L175             Difference]: Start difference. First operand has 139 places, 146 transitions, 463 flow. Second operand 6 states and 616 transitions.
[2024-03-12 00:17:30,706 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 206 transitions, 900 flow
[2024-03-12 00:17:30,710 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 206 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:17:30,713 INFO  L231             Difference]: Finished difference. Result has 148 places, 192 transitions, 919 flow
[2024-03-12 00:17:30,713 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=919, PETRI_PLACES=148, PETRI_TRANSITIONS=192}
[2024-03-12 00:17:30,714 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 27 predicate places.
[2024-03-12 00:17:30,714 INFO  L495      AbstractCegarLoop]: Abstraction has has 148 places, 192 transitions, 919 flow
[2024-03-12 00:17:30,714 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 92.16666666666667) internal successors, (553), 6 states have internal predecessors, (553), 0 states have call successors, (0), 0 states 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 00:17:30,714 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:30,715 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]
[2024-03-12 00:17:30,715 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-03-12 00:17:30,715 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:30,715 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:30,715 INFO  L85        PathProgramCache]: Analyzing trace with hash 892950531, now seen corresponding path program 1 times
[2024-03-12 00:17:30,716 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:30,716 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651209867]
[2024-03-12 00:17:30,716 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:30,716 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:30,739 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:30,982 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 00:17:30,982 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:30,983 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651209867]
[2024-03-12 00:17:30,983 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651209867] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:30,983 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:30,983 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:30,983 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626081131]
[2024-03-12 00:17:30,983 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:30,984 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:30,984 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:30,984 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:30,984 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:31,069 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 84 out of 122
[2024-03-12 00:17:31,070 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 192 transitions, 919 flow. Second operand  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:17:31,070 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:31,070 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 122
[2024-03-12 00:17:31,071 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:31,474 INFO  L124   PetriNetUnfolderBase]: 589/1947 cut-off events.
[2024-03-12 00:17:31,474 INFO  L125   PetriNetUnfolderBase]: For 1481/1602 co-relation queries the response was YES.
[2024-03-12 00:17:31,497 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 1947 events. 589/1947 cut-off events. For 1481/1602 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14403 event pairs, 94 based on Foata normal form. 19/1861 useless extension candidates. Maximal degree in co-relation 4914. Up to 1020 conditions per place. 
[2024-03-12 00:17:31,504 INFO  L140   encePairwiseOnDemand]: 91/122 looper letters, 98 selfloop transitions, 120 changer transitions 6/314 dead transitions.
[2024-03-12 00:17:31,505 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 314 transitions, 1919 flow
[2024-03-12 00:17:31,505 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:31,505 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:31,506 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 641 transitions.
[2024-03-12 00:17:31,506 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8756830601092896
[2024-03-12 00:17:31,507 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 641 transitions.
[2024-03-12 00:17:31,507 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 641 transitions.
[2024-03-12 00:17:31,507 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:31,507 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 641 transitions.
[2024-03-12 00:17:31,509 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 106.83333333333333) internal successors, (641), 6 states have internal predecessors, (641), 0 states have call successors, (0), 0 states 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 00:17:31,510 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:31,510 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:31,510 INFO  L175             Difference]: Start difference. First operand has 148 places, 192 transitions, 919 flow. Second operand 6 states and 641 transitions.
[2024-03-12 00:17:31,510 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 314 transitions, 1919 flow
[2024-03-12 00:17:31,519 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 314 transitions, 1907 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-03-12 00:17:31,523 INFO  L231             Difference]: Finished difference. Result has 151 places, 308 transitions, 2003 flow
[2024-03-12 00:17:31,523 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=907, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2003, PETRI_PLACES=151, PETRI_TRANSITIONS=308}
[2024-03-12 00:17:31,525 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 30 predicate places.
[2024-03-12 00:17:31,525 INFO  L495      AbstractCegarLoop]: Abstraction has has 151 places, 308 transitions, 2003 flow
[2024-03-12 00:17:31,525 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 86.66666666666667) internal successors, (520), 6 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 00:17:31,525 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:31,526 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:31,526 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-03-12 00:17:31,526 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:31,527 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:31,527 INFO  L85        PathProgramCache]: Analyzing trace with hash -1455306383, now seen corresponding path program 1 times
[2024-03-12 00:17:31,527 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:31,528 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735654296]
[2024-03-12 00:17:31,528 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:31,528 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:31,560 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:31,965 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:31,965 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:31,965 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735654296]
[2024-03-12 00:17:31,966 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735654296] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:17:31,966 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799205448]
[2024-03-12 00:17:31,966 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:31,966 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:17:31,966 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:17:31,971 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 00:17:31,976 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 00:17:32,074 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:32,077 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-03-12 00:17:32,087 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:17:32,211 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 00:17:32,247 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 00:17:32,247 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 11 treesize of output 11
[2024-03-12 00:17:32,362 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 16 treesize of output 8
[2024-03-12 00:17:32,365 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:17:32,634 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 00:17:32,680 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 00:17:32,728 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 00:17:33,001 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 30 treesize of output 21
[2024-03-12 00:17:33,062 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:17:33,064 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 3 case distinctions, treesize of input 33 treesize of output 38
[2024-03-12 00:17:33,103 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:33,103 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:17:33,151 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) c_threadThread1of1ForFork0_~p~0.offset) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_191) c_threadThread1of1ForFork0_~p~0.base) (+ c_threadThread1of1ForFork0_~p~0.offset 1)) |c_threadThread1of1ForFork0_#t~nondet4|))) is different from false
[2024-03-12 00:17:33,642 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:17:33,643 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 30 treesize of output 41
[2024-03-12 00:17:33,650 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:17:33,650 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 62 treesize of output 28
[2024-03-12 00:17:33,662 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 00:17:33,663 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 3 case distinctions, treesize of input 28 treesize of output 1
[2024-03-12 00:17:33,671 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 00:17:33,672 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 3 case distinctions, treesize of input 30 treesize of output 1
[2024-03-12 00:17:33,942 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 8 treesize of output 4
[2024-03-12 00:17:33,945 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 17 treesize of output 9
[2024-03-12 00:17:33,999 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-12 00:17:34,000 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [799205448] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:17:34,000 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:17:34,000 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 17] total 46
[2024-03-12 00:17:34,000 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505988900]
[2024-03-12 00:17:34,000 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:17:34,002 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2024-03-12 00:17:34,003 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:34,003 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2024-03-12 00:17:34,004 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=1842, Unknown=6, NotChecked=88, Total=2162
[2024-03-12 00:17:34,465 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 31 out of 122
[2024-03-12 00:17:34,468 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 308 transitions, 2003 flow. Second operand  has 47 states, 47 states have (on average 33.702127659574465) internal successors, (1584), 47 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states 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 00:17:34,468 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:34,468 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 122
[2024-03-12 00:17:34,468 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:41,330 INFO  L124   PetriNetUnfolderBase]: 1369/3443 cut-off events.
[2024-03-12 00:17:41,330 INFO  L125   PetriNetUnfolderBase]: For 5126/5128 co-relation queries the response was YES.
[2024-03-12 00:17:41,335 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 12002 conditions, 3443 events. 1369/3443 cut-off events. For 5126/5128 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 24492 event pairs, 95 based on Foata normal form. 67/3465 useless extension candidates. Maximal degree in co-relation 11703. Up to 1115 conditions per place. 
[2024-03-12 00:17:41,346 INFO  L140   encePairwiseOnDemand]: 74/122 looper letters, 507 selfloop transitions, 269 changer transitions 75/883 dead transitions.
[2024-03-12 00:17:41,346 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 883 transitions, 6755 flow
[2024-03-12 00:17:41,346 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. 
[2024-03-12 00:17:41,346 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 68 states.
[2024-03-12 00:17:41,353 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 2710 transitions.
[2024-03-12 00:17:41,355 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.32666345226615234
[2024-03-12 00:17:41,355 INFO  L72            ComplementDD]: Start complementDD. Operand 68 states and 2710 transitions.
[2024-03-12 00:17:41,355 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 68 states and 2710 transitions.
[2024-03-12 00:17:41,356 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:41,357 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 68 states and 2710 transitions.
[2024-03-12 00:17:41,364 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 69 states, 68 states have (on average 39.85294117647059) internal successors, (2710), 68 states have internal predecessors, (2710), 0 states have call successors, (0), 0 states 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 00:17:41,373 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 69 states, 69 states have (on average 122.0) internal successors, (8418), 69 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states 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 00:17:41,374 INFO  L81            ComplementDD]: Finished complementDD. Result  has 69 states, 69 states have (on average 122.0) internal successors, (8418), 69 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states 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 00:17:41,374 INFO  L175             Difference]: Start difference. First operand has 151 places, 308 transitions, 2003 flow. Second operand 68 states and 2710 transitions.
[2024-03-12 00:17:41,374 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 883 transitions, 6755 flow
[2024-03-12 00:17:41,403 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 883 transitions, 6665 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-12 00:17:41,414 INFO  L231             Difference]: Finished difference. Result has 243 places, 469 transitions, 3984 flow
[2024-03-12 00:17:41,414 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=1913, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=68, PETRI_FLOW=3984, PETRI_PLACES=243, PETRI_TRANSITIONS=469}
[2024-03-12 00:17:41,417 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 122 predicate places.
[2024-03-12 00:17:41,417 INFO  L495      AbstractCegarLoop]: Abstraction has has 243 places, 469 transitions, 3984 flow
[2024-03-12 00:17:41,418 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 33.702127659574465) internal successors, (1584), 47 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states 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 00:17:41,418 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:41,418 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:41,426 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 00:17:41,621 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:17:41,622 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:41,623 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:41,623 INFO  L85        PathProgramCache]: Analyzing trace with hash 978018084, now seen corresponding path program 1 times
[2024-03-12 00:17:41,623 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:41,623 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31954248]
[2024-03-12 00:17:41,623 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:41,623 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:41,653 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:42,056 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:42,056 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:42,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31954248]
[2024-03-12 00:17:42,057 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31954248] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:17:42,057 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549228495]
[2024-03-12 00:17:42,057 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:42,057 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:17:42,057 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:17:42,058 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 00:17:42,060 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 00:17:42,169 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:42,170 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-12 00:17:42,174 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:17:42,184 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 00:17:42,217 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 00:17:42,218 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 11 treesize of output 11
[2024-03-12 00:17:42,263 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 16 treesize of output 8
[2024-03-12 00:17:42,432 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 00:17:42,462 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 00:17:42,502 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 00:17:42,557 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 00:17:42,616 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 00:17:42,648 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:42,649 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:17:42,759 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0))))) is different from false
[2024-03-12 00:17:42,798 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_291 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of1ForFork0_~p~0.base v_ArrVal_291) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))))) is different from false
[2024-03-12 00:17:42,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 17 treesize of output 9
[2024-03-12 00:17:42,917 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked.
[2024-03-12 00:17:42,917 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [549228495] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:17:42,917 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:17:42,917 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-12 00:17:42,917 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12425489]
[2024-03-12 00:17:42,918 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:17:42,918 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-12 00:17:42,918 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:42,919 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-12 00:17:42,919 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=646, Unknown=11, NotChecked=106, Total=870
[2024-03-12 00:17:43,177 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 50 out of 122
[2024-03-12 00:17:43,179 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 469 transitions, 3984 flow. Second operand  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states 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 00:17:43,179 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:43,179 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 122
[2024-03-12 00:17:43,179 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:45,042 INFO  L124   PetriNetUnfolderBase]: 1075/2953 cut-off events.
[2024-03-12 00:17:45,042 INFO  L125   PetriNetUnfolderBase]: For 12209/12216 co-relation queries the response was YES.
[2024-03-12 00:17:45,050 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13000 conditions, 2953 events. 1075/2953 cut-off events. For 12209/12216 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 21503 event pairs, 207 based on Foata normal form. 31/2924 useless extension candidates. Maximal degree in co-relation 12661. Up to 1430 conditions per place. 
[2024-03-12 00:17:45,060 INFO  L140   encePairwiseOnDemand]: 107/122 looper letters, 398 selfloop transitions, 35 changer transitions 44/576 dead transitions.
[2024-03-12 00:17:45,060 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 576 transitions, 5538 flow
[2024-03-12 00:17:45,061 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2024-03-12 00:17:45,061 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 18 states.
[2024-03-12 00:17:45,063 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1088 transitions.
[2024-03-12 00:17:45,063 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.49544626593806923
[2024-03-12 00:17:45,063 INFO  L72            ComplementDD]: Start complementDD. Operand 18 states and 1088 transitions.
[2024-03-12 00:17:45,063 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 18 states and 1088 transitions.
[2024-03-12 00:17:45,064 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:45,064 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1088 transitions.
[2024-03-12 00:17:45,066 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 19 states, 18 states have (on average 60.44444444444444) internal successors, (1088), 18 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states 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 00:17:45,068 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states 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 00:17:45,068 INFO  L81            ComplementDD]: Finished complementDD. Result  has 19 states, 19 states have (on average 122.0) internal successors, (2318), 19 states have internal predecessors, (2318), 0 states have call successors, (0), 0 states 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 00:17:45,068 INFO  L175             Difference]: Start difference. First operand has 243 places, 469 transitions, 3984 flow. Second operand 18 states and 1088 transitions.
[2024-03-12 00:17:45,068 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 576 transitions, 5538 flow
[2024-03-12 00:17:45,125 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 576 transitions, 5325 flow, removed 63 selfloop flow, removed 20 redundant places.
[2024-03-12 00:17:45,131 INFO  L231             Difference]: Finished difference. Result has 235 places, 437 transitions, 3501 flow
[2024-03-12 00:17:45,132 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3779, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3501, PETRI_PLACES=235, PETRI_TRANSITIONS=437}
[2024-03-12 00:17:45,132 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 114 predicate places.
[2024-03-12 00:17:45,132 INFO  L495      AbstractCegarLoop]: Abstraction has has 235 places, 437 transitions, 3501 flow
[2024-03-12 00:17:45,133 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 52.3) internal successors, (1569), 30 states have internal predecessors, (1569), 0 states have call successors, (0), 0 states 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 00:17:45,133 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:45,133 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, 1]
[2024-03-12 00:17:45,140 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-03-12 00:17:45,334 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,SelfDestructingSolverStorable5
[2024-03-12 00:17:45,334 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:45,335 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:45,335 INFO  L85        PathProgramCache]: Analyzing trace with hash -1004989113, now seen corresponding path program 1 times
[2024-03-12 00:17:45,335 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:45,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570126682]
[2024-03-12 00:17:45,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:45,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:45,358 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:45,621 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 00:17:45,621 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:45,621 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570126682]
[2024-03-12 00:17:45,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570126682] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:45,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:45,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:45,621 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763909066]
[2024-03-12 00:17:45,621 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:45,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:45,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:45,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:45,622 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:45,940 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 100 out of 122
[2024-03-12 00:17:45,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 437 transitions, 3501 flow. Second operand  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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 00:17:45,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:45,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 122
[2024-03-12 00:17:45,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:46,296 INFO  L124   PetriNetUnfolderBase]: 613/2198 cut-off events.
[2024-03-12 00:17:46,297 INFO  L125   PetriNetUnfolderBase]: For 7675/7725 co-relation queries the response was YES.
[2024-03-12 00:17:46,303 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8474 conditions, 2198 events. 613/2198 cut-off events. For 7675/7725 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 16986 event pairs, 44 based on Foata normal form. 2/2165 useless extension candidates. Maximal degree in co-relation 8296. Up to 506 conditions per place. 
[2024-03-12 00:17:46,311 INFO  L140   encePairwiseOnDemand]: 111/122 looper letters, 134 selfloop transitions, 37 changer transitions 18/477 dead transitions.
[2024-03-12 00:17:46,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 477 transitions, 4293 flow
[2024-03-12 00:17:46,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:46,312 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:46,313 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 642 transitions.
[2024-03-12 00:17:46,313 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8770491803278688
[2024-03-12 00:17:46,313 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 642 transitions.
[2024-03-12 00:17:46,313 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 642 transitions.
[2024-03-12 00:17:46,313 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:46,313 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 642 transitions.
[2024-03-12 00:17:46,314 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 107.0) internal successors, (642), 6 states have internal predecessors, (642), 0 states have call successors, (0), 0 states 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 00:17:46,315 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:46,315 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-03-12 00:17:46,316 INFO  L175             Difference]: Start difference. First operand has 235 places, 437 transitions, 3501 flow. Second operand 6 states and 642 transitions.
[2024-03-12 00:17:46,316 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 477 transitions, 4293 flow
[2024-03-12 00:17:46,354 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 477 transitions, 4206 flow, removed 10 selfloop flow, removed 17 redundant places.
[2024-03-12 00:17:46,360 INFO  L231             Difference]: Finished difference. Result has 227 places, 459 transitions, 3902 flow
[2024-03-12 00:17:46,360 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=122, PETRI_DIFFERENCE_MINUEND_FLOW=3422, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3902, PETRI_PLACES=227, PETRI_TRANSITIONS=459}
[2024-03-12 00:17:46,360 INFO  L281   CegarLoopForPetriNet]: 121 programPoint places, 106 predicate places.
[2024-03-12 00:17:46,360 INFO  L495      AbstractCegarLoop]: Abstraction has has 227 places, 459 transitions, 3902 flow
[2024-03-12 00:17:46,361 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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 00:17:46,361 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:46,361 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:46,361 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-03-12 00:17:46,361 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 6 more)] ===
[2024-03-12 00:17:46,362 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:46,362 INFO  L85        PathProgramCache]: Analyzing trace with hash 218317082, now seen corresponding path program 1 times
[2024-03-12 00:17:46,362 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:46,362 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464384945]
[2024-03-12 00:17:46,362 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:46,362 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:46,388 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:17:46,389 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-03-12 00:17:46,404 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-03-12 00:17:46,421 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-03-12 00:17:46,421 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-03-12 00:17:46,422 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining)
[2024-03-12 00:17:46,423 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining)
[2024-03-12 00:17:46,424 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining)
[2024-03-12 00:17:46,424 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-03-12 00:17:46,425 INFO  L445         BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:46,426 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-03-12 00:17:46,427 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-03-12 00:17:46,441 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-03-12 00:17:46,442 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 140 places, 140 transitions, 296 flow
[2024-03-12 00:17:46,461 INFO  L124   PetriNetUnfolderBase]: 11/335 cut-off events.
[2024-03-12 00:17:46,461 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-03-12 00:17:46,461 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 347 conditions, 335 events. 11/335 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 756 event pairs, 0 based on Foata normal form. 0/296 useless extension candidates. Maximal degree in co-relation 190. Up to 8 conditions per place. 
[2024-03-12 00:17:46,461 INFO  L82        GeneralOperation]: Start removeDead. Operand has 140 places, 140 transitions, 296 flow
[2024-03-12 00:17:46,462 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 140 places, 140 transitions, 296 flow
[2024-03-12 00:17:46,463 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-03-12 00:17:46,464 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;@541df568, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-03-12 00:17:46,464 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 10 error locations.
[2024-03-12 00:17:46,466 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-03-12 00:17:46,466 INFO  L124   PetriNetUnfolderBase]: 3/42 cut-off events.
[2024-03-12 00:17:46,466 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-03-12 00:17:46,466 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:46,466 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:46,466 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:17:46,466 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:46,466 INFO  L85        PathProgramCache]: Analyzing trace with hash -322910802, now seen corresponding path program 1 times
[2024-03-12 00:17:46,466 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:46,467 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640185895]
[2024-03-12 00:17:46,467 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:46,467 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:46,474 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:46,637 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 00:17:46,637 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:46,637 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640185895]
[2024-03-12 00:17:46,637 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640185895] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:46,637 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:46,637 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:46,638 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318935249]
[2024-03-12 00:17:46,638 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:46,638 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:46,638 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:46,638 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:46,639 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:46,924 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 109 out of 140
[2024-03-12 00:17:46,924 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 140 transitions, 296 flow. Second operand  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 00:17:46,925 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:46,925 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 140
[2024-03-12 00:17:46,925 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:47,354 INFO  L124   PetriNetUnfolderBase]: 1139/4013 cut-off events.
[2024-03-12 00:17:47,354 INFO  L125   PetriNetUnfolderBase]: For 95/183 co-relation queries the response was YES.
[2024-03-12 00:17:47,358 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6043 conditions, 4013 events. 1139/4013 cut-off events. For 95/183 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31865 event pairs, 192 based on Foata normal form. 74/3754 useless extension candidates. Maximal degree in co-relation 2969. Up to 1538 conditions per place. 
[2024-03-12 00:17:47,368 INFO  L140   encePairwiseOnDemand]: 116/140 looper letters, 36 selfloop transitions, 43 changer transitions 1/188 dead transitions.
[2024-03-12 00:17:47,368 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 188 transitions, 558 flow
[2024-03-12 00:17:47,369 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:47,369 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:47,369 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 740 transitions.
[2024-03-12 00:17:47,370 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8809523809523809
[2024-03-12 00:17:47,370 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 740 transitions.
[2024-03-12 00:17:47,370 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 740 transitions.
[2024-03-12 00:17:47,370 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:47,370 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 740 transitions.
[2024-03-12 00:17:47,371 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states 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 00:17:47,372 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:47,372 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:47,372 INFO  L175             Difference]: Start difference. First operand has 140 places, 140 transitions, 296 flow. Second operand 6 states and 740 transitions.
[2024-03-12 00:17:47,372 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 188 transitions, 558 flow
[2024-03-12 00:17:47,373 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 188 transitions, 558 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:17:47,374 INFO  L231             Difference]: Finished difference. Result has 150 places, 179 transitions, 588 flow
[2024-03-12 00:17:47,374 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=588, PETRI_PLACES=150, PETRI_TRANSITIONS=179}
[2024-03-12 00:17:47,375 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 10 predicate places.
[2024-03-12 00:17:47,375 INFO  L495      AbstractCegarLoop]: Abstraction has has 150 places, 179 transitions, 588 flow
[2024-03-12 00:17:47,375 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states 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 00:17:47,375 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:47,375 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]
[2024-03-12 00:17:47,376 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-03-12 00:17:47,376 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:17:47,376 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:47,376 INFO  L85        PathProgramCache]: Analyzing trace with hash -690971267, now seen corresponding path program 1 times
[2024-03-12 00:17:47,376 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:47,376 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903156412]
[2024-03-12 00:17:47,376 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:47,376 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:47,385 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:47,416 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 00:17:47,416 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:47,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903156412]
[2024-03-12 00:17:47,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903156412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:47,416 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:47,416 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:47,417 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897213240]
[2024-03-12 00:17:47,417 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:47,417 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-03-12 00:17:47,417 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:47,417 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-03-12 00:17:47,417 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-03-12 00:17:47,480 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 122 out of 140
[2024-03-12 00:17:47,481 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 179 transitions, 588 flow. Second operand  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 00:17:47,481 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:47,481 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 140
[2024-03-12 00:17:47,481 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:47,767 INFO  L124   PetriNetUnfolderBase]: 890/3527 cut-off events.
[2024-03-12 00:17:47,767 INFO  L125   PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES.
[2024-03-12 00:17:47,773 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6149 conditions, 3527 events. 890/3527 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28451 event pairs, 150 based on Foata normal form. 1/3305 useless extension candidates. Maximal degree in co-relation 3349. Up to 983 conditions per place. 
[2024-03-12 00:17:47,779 INFO  L140   encePairwiseOnDemand]: 132/140 looper letters, 14 selfloop transitions, 6 changer transitions 1/185 dead transitions.
[2024-03-12 00:17:47,779 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 185 transitions, 642 flow
[2024-03-12 00:17:47,780 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:47,780 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:47,781 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 754 transitions.
[2024-03-12 00:17:47,781 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8976190476190476
[2024-03-12 00:17:47,781 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 754 transitions.
[2024-03-12 00:17:47,781 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 754 transitions.
[2024-03-12 00:17:47,781 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:47,781 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 754 transitions.
[2024-03-12 00:17:47,782 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 125.66666666666667) internal successors, (754), 6 states have internal predecessors, (754), 0 states have call successors, (0), 0 states 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 00:17:47,783 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:47,784 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:47,784 INFO  L175             Difference]: Start difference. First operand has 150 places, 179 transitions, 588 flow. Second operand 6 states and 754 transitions.
[2024-03-12 00:17:47,784 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 185 transitions, 642 flow
[2024-03-12 00:17:47,787 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 185 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-03-12 00:17:47,788 INFO  L231             Difference]: Finished difference. Result has 158 places, 184 transitions, 634 flow
[2024-03-12 00:17:47,789 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=634, PETRI_PLACES=158, PETRI_TRANSITIONS=184}
[2024-03-12 00:17:47,789 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 18 predicate places.
[2024-03-12 00:17:47,789 INFO  L495      AbstractCegarLoop]: Abstraction has has 158 places, 184 transitions, 634 flow
[2024-03-12 00:17:47,790 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states 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 00:17:47,790 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:47,790 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]
[2024-03-12 00:17:47,790 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-03-12 00:17:47,790 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:17:47,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:47,790 INFO  L85        PathProgramCache]: Analyzing trace with hash 1016193771, now seen corresponding path program 1 times
[2024-03-12 00:17:47,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:47,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682400097]
[2024-03-12 00:17:47,790 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:47,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:47,798 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:47,915 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 00:17:47,915 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:47,916 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682400097]
[2024-03-12 00:17:47,916 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682400097] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:47,916 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:47,916 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:47,916 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410643677]
[2024-03-12 00:17:47,916 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:47,916 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:47,916 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:47,917 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:47,917 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:48,179 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 103 out of 140
[2024-03-12 00:17:48,180 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 184 transitions, 634 flow. Second operand  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 00:17:48,180 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:48,180 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 140
[2024-03-12 00:17:48,180 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:49,162 INFO  L124   PetriNetUnfolderBase]: 3173/8712 cut-off events.
[2024-03-12 00:17:49,163 INFO  L125   PetriNetUnfolderBase]: For 4360/4371 co-relation queries the response was YES.
[2024-03-12 00:17:49,181 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 8712 events. 3173/8712 cut-off events. For 4360/4371 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 76078 event pairs, 410 based on Foata normal form. 7/8207 useless extension candidates. Maximal degree in co-relation 19323. Up to 3775 conditions per place. 
[2024-03-12 00:17:49,210 INFO  L140   encePairwiseOnDemand]: 113/140 looper letters, 78 selfloop transitions, 104 changer transitions 4/300 dead transitions.
[2024-03-12 00:17:49,210 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 300 transitions, 1529 flow
[2024-03-12 00:17:49,211 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:49,211 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:49,212 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions.
[2024-03-12 00:17:49,212 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8511904761904762
[2024-03-12 00:17:49,212 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 715 transitions.
[2024-03-12 00:17:49,212 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions.
[2024-03-12 00:17:49,212 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:49,212 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions.
[2024-03-12 00:17:49,214 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 00:17:49,215 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:49,215 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:49,215 INFO  L175             Difference]: Start difference. First operand has 158 places, 184 transitions, 634 flow. Second operand 6 states and 715 transitions.
[2024-03-12 00:17:49,215 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 300 transitions, 1529 flow
[2024-03-12 00:17:49,222 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 300 transitions, 1527 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-03-12 00:17:49,225 INFO  L231             Difference]: Finished difference. Result has 167 places, 284 transitions, 1638 flow
[2024-03-12 00:17:49,225 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1638, PETRI_PLACES=167, PETRI_TRANSITIONS=284}
[2024-03-12 00:17:49,226 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 27 predicate places.
[2024-03-12 00:17:49,226 INFO  L495      AbstractCegarLoop]: Abstraction has has 167 places, 284 transitions, 1638 flow
[2024-03-12 00:17:49,226 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 104.16666666666667) internal successors, (625), 6 states have internal predecessors, (625), 0 states have call successors, (0), 0 states 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 00:17:49,226 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:49,226 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]
[2024-03-12 00:17:49,226 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-03-12 00:17:49,227 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:17:49,227 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:49,227 INFO  L85        PathProgramCache]: Analyzing trace with hash 821111039, now seen corresponding path program 1 times
[2024-03-12 00:17:49,227 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:49,227 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674460195]
[2024-03-12 00:17:49,227 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:49,227 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:49,244 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:49,449 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 00:17:49,449 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:49,449 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674460195]
[2024-03-12 00:17:49,449 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674460195] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:17:49,449 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:17:49,450 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:17:49,450 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807308320]
[2024-03-12 00:17:49,450 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:17:49,450 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:17:49,451 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:49,451 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:17:49,451 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:17:49,581 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 96 out of 140
[2024-03-12 00:17:49,582 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 284 transitions, 1638 flow. Second operand  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:17:49,582 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:49,582 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 140
[2024-03-12 00:17:49,582 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:17:51,963 INFO  L124   PetriNetUnfolderBase]: 8683/19946 cut-off events.
[2024-03-12 00:17:51,963 INFO  L125   PetriNetUnfolderBase]: For 22993/25165 co-relation queries the response was YES.
[2024-03-12 00:17:52,008 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 59186 conditions, 19946 events. 8683/19946 cut-off events. For 22993/25165 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 186144 event pairs, 1558 based on Foata normal form. 67/18966 useless extension candidates. Maximal degree in co-relation 20685. Up to 11899 conditions per place. 
[2024-03-12 00:17:52,073 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 173 selfloop transitions, 249 changer transitions 0/525 dead transitions.
[2024-03-12 00:17:52,073 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 525 transitions, 3950 flow
[2024-03-12 00:17:52,074 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:17:52,074 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:17:52,075 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 743 transitions.
[2024-03-12 00:17:52,075 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8845238095238095
[2024-03-12 00:17:52,075 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 743 transitions.
[2024-03-12 00:17:52,075 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 743 transitions.
[2024-03-12 00:17:52,075 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:17:52,075 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 743 transitions.
[2024-03-12 00:17:52,076 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 123.83333333333333) internal successors, (743), 6 states have internal predecessors, (743), 0 states have call successors, (0), 0 states 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 00:17:52,077 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:52,077 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:17:52,077 INFO  L175             Difference]: Start difference. First operand has 167 places, 284 transitions, 1638 flow. Second operand 6 states and 743 transitions.
[2024-03-12 00:17:52,077 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 525 transitions, 3950 flow
[2024-03-12 00:17:52,104 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 525 transitions, 3940 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-03-12 00:17:52,109 INFO  L231             Difference]: Finished difference. Result has 171 places, 517 transitions, 4284 flow
[2024-03-12 00:17:52,110 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4284, PETRI_PLACES=171, PETRI_TRANSITIONS=517}
[2024-03-12 00:17:52,110 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 31 predicate places.
[2024-03-12 00:17:52,110 INFO  L495      AbstractCegarLoop]: Abstraction has has 171 places, 517 transitions, 4284 flow
[2024-03-12 00:17:52,110 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states 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 00:17:52,110 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:17:52,111 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:17:52,111 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-03-12 00:17:52,111 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:17:52,111 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:17:52,111 INFO  L85        PathProgramCache]: Analyzing trace with hash -1141486319, now seen corresponding path program 1 times
[2024-03-12 00:17:52,111 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:17:52,111 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123268746]
[2024-03-12 00:17:52,111 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:52,111 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:17:52,128 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:52,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:52,505 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:17:52,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123268746]
[2024-03-12 00:17:52,505 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123268746] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:17:52,505 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953378253]
[2024-03-12 00:17:52,505 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:17:52,506 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:17:52,506 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:17:52,507 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 00:17:52,509 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 00:17:52,592 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:17:52,594 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core
[2024-03-12 00:17:52,601 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:17:52,605 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 00:17:52,615 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 00:17:52,615 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 11 treesize of output 11
[2024-03-12 00:17:52,680 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 16 treesize of output 8
[2024-03-12 00:17:52,683 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:17:52,824 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 00:17:52,847 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 00:17:52,889 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 00:17:52,928 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 00:17:53,072 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 00:17:53,106 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:17:53,106 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:17:53,131 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-12 00:17:53,254 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-12 00:17:53,277 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_581 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_581) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-12 00:17:53,367 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 8 treesize of output 4
[2024-03-12 00:17:53,369 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 17 treesize of output 9
[2024-03-12 00:17:53,396 INFO  L134       CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-12 00:17:53,396 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [953378253] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:17:53,397 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:17:53,397 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 29
[2024-03-12 00:17:53,397 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031402819]
[2024-03-12 00:17:53,397 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:17:53,398 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-12 00:17:53,399 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:17:53,399 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-12 00:17:53,400 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=607, Unknown=3, NotChecked=156, Total=870
[2024-03-12 00:17:53,653 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 51 out of 140
[2024-03-12 00:17:53,655 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 517 transitions, 4284 flow. Second operand  has 30 states, 30 states have (on average 53.833333333333336) internal successors, (1615), 30 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 00:17:53,655 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:17:53,655 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 140
[2024-03-12 00:17:53,655 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:18:04,322 INFO  L124   PetriNetUnfolderBase]: 28885/54773 cut-off events.
[2024-03-12 00:18:04,322 INFO  L125   PetriNetUnfolderBase]: For 96298/96335 co-relation queries the response was YES.
[2024-03-12 00:18:04,464 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 191013 conditions, 54773 events. 28885/54773 cut-off events. For 96298/96335 co-relation queries the response was YES. Maximal size of possible extension queue 1543. Compared 516545 event pairs, 7011 based on Foata normal form. 385/52624 useless extension candidates. Maximal degree in co-relation 120775. Up to 22271 conditions per place. 
[2024-03-12 00:18:04,651 INFO  L140   encePairwiseOnDemand]: 100/140 looper letters, 891 selfloop transitions, 662 changer transitions 2/1606 dead transitions.
[2024-03-12 00:18:04,651 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 1606 transitions, 15946 flow
[2024-03-12 00:18:04,652 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. 
[2024-03-12 00:18:04,652 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 32 states.
[2024-03-12 00:18:04,654 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 2231 transitions.
[2024-03-12 00:18:04,655 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.4979910714285714
[2024-03-12 00:18:04,655 INFO  L72            ComplementDD]: Start complementDD. Operand 32 states and 2231 transitions.
[2024-03-12 00:18:04,655 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 32 states and 2231 transitions.
[2024-03-12 00:18:04,655 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:18:04,655 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 32 states and 2231 transitions.
[2024-03-12 00:18:04,658 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 33 states, 32 states have (on average 69.71875) internal successors, (2231), 32 states have internal predecessors, (2231), 0 states have call successors, (0), 0 states 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 00:18:04,662 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states 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 00:18:04,663 INFO  L81            ComplementDD]: Finished complementDD. Result  has 33 states, 33 states have (on average 140.0) internal successors, (4620), 33 states have internal predecessors, (4620), 0 states have call successors, (0), 0 states 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 00:18:04,663 INFO  L175             Difference]: Start difference. First operand has 171 places, 517 transitions, 4284 flow. Second operand 32 states and 2231 transitions.
[2024-03-12 00:18:04,663 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 1606 transitions, 15946 flow
[2024-03-12 00:18:05,585 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 1606 transitions, 15856 flow, removed 45 selfloop flow, removed 0 redundant places.
[2024-03-12 00:18:05,599 INFO  L231             Difference]: Finished difference. Result has 223 places, 1096 transitions, 13003 flow
[2024-03-12 00:18:05,599 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=4194, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=253, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=13003, PETRI_PLACES=223, PETRI_TRANSITIONS=1096}
[2024-03-12 00:18:05,600 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 83 predicate places.
[2024-03-12 00:18:05,600 INFO  L495      AbstractCegarLoop]: Abstraction has has 223 places, 1096 transitions, 13003 flow
[2024-03-12 00:18:05,601 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 53.833333333333336) internal successors, (1615), 30 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states 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 00:18:05,601 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:18:05,601 INFO  L208   CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:18:05,608 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 00:18:05,801 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:18:05,802 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:18:05,803 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:18:05,803 INFO  L85        PathProgramCache]: Analyzing trace with hash 1525661182, now seen corresponding path program 1 times
[2024-03-12 00:18:05,803 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:18:05,803 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016230168]
[2024-03-12 00:18:05,804 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:18:05,804 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:18:05,830 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:18:06,130 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:18:06,130 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:18:06,130 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016230168]
[2024-03-12 00:18:06,131 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016230168] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:18:06,131 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109311314]
[2024-03-12 00:18:06,131 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:18:06,131 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:18:06,131 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:18:06,132 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 00:18:06,133 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 00:18:06,255 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:18:06,256 INFO  L262         TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 27 conjunts are in the unsatisfiable core
[2024-03-12 00:18:06,260 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:18:06,265 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 00:18:06,285 INFO  L349             Elim1Store]: treesize reduction 4, result has 50.0 percent of original size
[2024-03-12 00:18:06,286 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 11 treesize of output 11
[2024-03-12 00:18:06,322 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 16 treesize of output 8
[2024-03-12 00:18:06,449 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 00:18:06,470 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 00:18:06,509 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 00:18:06,545 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 00:18:06,594 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 00:18:06,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:18:06,621 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:18:06,635 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)))) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0))) is different from false
[2024-03-12 00:18:06,653 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0))))) is different from false
[2024-03-12 00:18:06,669 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0))))) is different from false
[2024-03-12 00:18:06,688 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 1)) (.cse1 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 2)) (.cse2 (+ |c_ULTIMATE.start_main_~#datas~0#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_679 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_679) |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse3) 0))))) is different from false
[2024-03-12 00:18:06,704 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:18:06,705 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 51
[2024-03-12 00:18:06,712 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:18:06,713 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 64 treesize of output 36
[2024-03-12 00:18:06,716 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 7 treesize of output 3
[2024-03-12 00:18:06,725 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:18:06,726 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 1
[2024-03-12 00:18:06,732 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:18:06,732 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 00:18:06,739 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:18:06,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 1 new quantified variables, introduced 4 case distinctions, treesize of input 35 treesize of output 1
[2024-03-12 00:18:06,777 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 17 treesize of output 9
[2024-03-12 00:18:06,780 INFO  L134       CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked.
[2024-03-12 00:18:06,780 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [109311314] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:18:06,780 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:18:06,780 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29
[2024-03-12 00:18:06,780 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040708868]
[2024-03-12 00:18:06,780 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:18:06,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 30 states
[2024-03-12 00:18:06,781 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:18:06,781 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants.
[2024-03-12 00:18:06,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=560, Unknown=4, NotChecked=204, Total=870
[2024-03-12 00:18:06,864 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 59 out of 140
[2024-03-12 00:18:06,866 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 1096 transitions, 13003 flow. Second operand  has 30 states, 30 states have (on average 61.266666666666666) internal successors, (1838), 30 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states 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 00:18:06,866 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:18:06,866 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 140
[2024-03-12 00:18:06,866 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:18:20,040 INFO  L124   PetriNetUnfolderBase]: 28453/54075 cut-off events.
[2024-03-12 00:18:20,040 INFO  L125   PetriNetUnfolderBase]: For 208422/208447 co-relation queries the response was YES.
[2024-03-12 00:18:20,348 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 237818 conditions, 54075 events. 28453/54075 cut-off events. For 208422/208447 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 501969 event pairs, 4795 based on Foata normal form. 256/51386 useless extension candidates. Maximal degree in co-relation 218636. Up to 15898 conditions per place. 
[2024-03-12 00:18:20,706 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1319 selfloop transitions, 813 changer transitions 0/2200 dead transitions.
[2024-03-12 00:18:20,707 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 2200 transitions, 27966 flow
[2024-03-12 00:18:20,708 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. 
[2024-03-12 00:18:20,708 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30 states.
[2024-03-12 00:18:20,709 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 2293 transitions.
[2024-03-12 00:18:20,710 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.545952380952381
[2024-03-12 00:18:20,710 INFO  L72            ComplementDD]: Start complementDD. Operand 30 states and 2293 transitions.
[2024-03-12 00:18:20,710 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 30 states and 2293 transitions.
[2024-03-12 00:18:20,711 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:18:20,711 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 30 states and 2293 transitions.
[2024-03-12 00:18:20,714 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 31 states, 30 states have (on average 76.43333333333334) internal successors, (2293), 30 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states 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 00:18:20,717 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states 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 00:18:20,717 INFO  L81            ComplementDD]: Finished complementDD. Result  has 31 states, 31 states have (on average 140.0) internal successors, (4340), 31 states have internal predecessors, (4340), 0 states have call successors, (0), 0 states 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 00:18:20,718 INFO  L175             Difference]: Start difference. First operand has 223 places, 1096 transitions, 13003 flow. Second operand 30 states and 2293 transitions.
[2024-03-12 00:18:20,718 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 2200 transitions, 27966 flow
[2024-03-12 00:18:24,691 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 2200 transitions, 27895 flow, removed 30 selfloop flow, removed 5 redundant places.
[2024-03-12 00:18:24,715 INFO  L231             Difference]: Finished difference. Result has 263 places, 1510 transitions, 21452 flow
[2024-03-12 00:18:24,716 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=12933, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=467, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=498, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=21452, PETRI_PLACES=263, PETRI_TRANSITIONS=1510}
[2024-03-12 00:18:24,716 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places.
[2024-03-12 00:18:24,716 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 1510 transitions, 21452 flow
[2024-03-12 00:18:24,717 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 30 states, 30 states have (on average 61.266666666666666) internal successors, (1838), 30 states have internal predecessors, (1838), 0 states have call successors, (0), 0 states 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 00:18:24,717 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:18:24,717 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, 1]
[2024-03-12 00:18:24,721 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-03-12 00:18:24,918 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,SelfDestructingSolverStorable13
[2024-03-12 00:18:24,918 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:18:24,919 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:18:24,919 INFO  L85        PathProgramCache]: Analyzing trace with hash 659297603, now seen corresponding path program 1 times
[2024-03-12 00:18:24,920 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:18:24,920 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424487331]
[2024-03-12 00:18:24,920 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:18:24,920 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:18:24,938 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:18:25,089 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 00:18:25,090 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:18:25,090 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424487331]
[2024-03-12 00:18:25,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424487331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-03-12 00:18:25,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-03-12 00:18:25,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-03-12 00:18:25,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301282627]
[2024-03-12 00:18:25,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-03-12 00:18:25,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-03-12 00:18:25,091 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:18:25,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-03-12 00:18:25,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-03-12 00:18:25,400 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 112 out of 140
[2024-03-12 00:18:25,401 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1510 transitions, 21452 flow. Second operand  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 00:18:25,401 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:18:25,401 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 140
[2024-03-12 00:18:25,401 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:18:31,239 INFO  L124   PetriNetUnfolderBase]: 12002/27588 cut-off events.
[2024-03-12 00:18:31,239 INFO  L125   PetriNetUnfolderBase]: For 159252/161313 co-relation queries the response was YES.
[2024-03-12 00:18:31,405 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 135081 conditions, 27588 events. 12002/27588 cut-off events. For 159252/161313 co-relation queries the response was YES. Maximal size of possible extension queue 813. Compared 267794 event pairs, 934 based on Foata normal form. 205/26924 useless extension candidates. Maximal degree in co-relation 134080. Up to 10841 conditions per place. 
[2024-03-12 00:18:31,516 INFO  L140   encePairwiseOnDemand]: 125/140 looper letters, 1123 selfloop transitions, 180 changer transitions 0/1687 dead transitions.
[2024-03-12 00:18:31,516 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 1687 transitions, 26473 flow
[2024-03-12 00:18:31,517 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-03-12 00:18:31,517 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-03-12 00:18:31,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 737 transitions.
[2024-03-12 00:18:31,518 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8773809523809524
[2024-03-12 00:18:31,518 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 737 transitions.
[2024-03-12 00:18:31,518 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 737 transitions.
[2024-03-12 00:18:31,518 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:18:31,518 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 737 transitions.
[2024-03-12 00:18:31,519 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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 00:18:31,520 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:18:31,520 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 140.0) internal successors, (980), 7 states have internal predecessors, (980), 0 states have call successors, (0), 0 states 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 00:18:31,520 INFO  L175             Difference]: Start difference. First operand has 263 places, 1510 transitions, 21452 flow. Second operand 6 states and 737 transitions.
[2024-03-12 00:18:31,520 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 1687 transitions, 26473 flow
[2024-03-12 00:18:33,062 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 1687 transitions, 26265 flow, removed 82 selfloop flow, removed 10 redundant places.
[2024-03-12 00:18:33,084 INFO  L231             Difference]: Finished difference. Result has 263 places, 1685 transitions, 24494 flow
[2024-03-12 00:18:33,085 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=21244, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24494, PETRI_PLACES=263, PETRI_TRANSITIONS=1685}
[2024-03-12 00:18:33,085 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 123 predicate places.
[2024-03-12 00:18:33,085 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 1685 transitions, 24494 flow
[2024-03-12 00:18:33,085 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 113.5) internal successors, (681), 6 states have internal predecessors, (681), 0 states have call successors, (0), 0 states 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 00:18:33,085 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:18:33,085 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, 1, 1]
[2024-03-12 00:18:33,086 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-03-12 00:18:33,086 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:18:33,086 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:18:33,086 INFO  L85        PathProgramCache]: Analyzing trace with hash -1796263229, now seen corresponding path program 1 times
[2024-03-12 00:18:33,086 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:18:33,086 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702085135]
[2024-03-12 00:18:33,086 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:18:33,086 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:18:33,103 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:18:33,415 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 00:18:33,415 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:18:33,415 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702085135]
[2024-03-12 00:18:33,416 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702085135] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:18:33,416 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582982419]
[2024-03-12 00:18:33,416 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:18:33,416 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:18:33,416 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:18:33,417 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 00:18:33,418 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 00:18:33,548 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:18:33,550 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-03-12 00:18:33,557 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:18:33,667 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 17 treesize of output 9
[2024-03-12 00:18:33,857 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 00:18:33,895 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 00:18:33,942 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 00:18:33,986 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 00:18:34,038 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:18:34,040 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 00:18:34,076 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 00:18:34,076 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:18:34,173 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-12 00:18:34,192 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_824 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_824 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_824) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-12 00:18:34,353 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 15 treesize of output 7
[2024-03-12 00:18:34,358 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 8 treesize of output 4
[2024-03-12 00:18:34,403 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 00:18:34,403 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582982419] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:18:34,403 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:18:34,403 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13] total 34
[2024-03-12 00:18:34,403 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296877807]
[2024-03-12 00:18:34,403 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:18:34,404 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-12 00:18:34,404 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:18:34,404 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-12 00:18:34,405 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=928, Unknown=8, NotChecked=126, Total=1190
[2024-03-12 00:18:34,703 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 52 out of 140
[2024-03-12 00:18:34,704 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 1685 transitions, 24494 flow. Second operand  has 35 states, 35 states have (on average 55.02857142857143) internal successors, (1926), 35 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 00:18:34,704 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:18:34,704 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 140
[2024-03-12 00:18:34,704 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:18:57,724 INFO  L124   PetriNetUnfolderBase]: 36870/68515 cut-off events.
[2024-03-12 00:18:57,724 INFO  L125   PetriNetUnfolderBase]: For 388514/388654 co-relation queries the response was YES.
[2024-03-12 00:18:58,329 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 340328 conditions, 68515 events. 36870/68515 cut-off events. For 388514/388654 co-relation queries the response was YES. Maximal size of possible extension queue 1840. Compared 647290 event pairs, 9050 based on Foata normal form. 636/66129 useless extension candidates. Maximal degree in co-relation 337936. Up to 36409 conditions per place. 
[2024-03-12 00:18:58,614 INFO  L140   encePairwiseOnDemand]: 105/140 looper letters, 1683 selfloop transitions, 851 changer transitions 2/2601 dead transitions.
[2024-03-12 00:18:58,614 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 2601 transitions, 39014 flow
[2024-03-12 00:18:58,614 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-03-12 00:18:58,615 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-03-12 00:18:58,616 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1817 transitions.
[2024-03-12 00:18:58,616 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5191428571428571
[2024-03-12 00:18:58,616 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 1817 transitions.
[2024-03-12 00:18:58,616 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 1817 transitions.
[2024-03-12 00:18:58,617 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:18:58,617 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 1817 transitions.
[2024-03-12 00:18:58,619 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 72.68) internal successors, (1817), 25 states have internal predecessors, (1817), 0 states have call successors, (0), 0 states 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 00:18:58,622 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 140.0) internal successors, (3640), 26 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states 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 00:18:58,622 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 140.0) internal successors, (3640), 26 states have internal predecessors, (3640), 0 states have call successors, (0), 0 states 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 00:18:58,622 INFO  L175             Difference]: Start difference. First operand has 263 places, 1685 transitions, 24494 flow. Second operand 25 states and 1817 transitions.
[2024-03-12 00:18:58,622 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 2601 transitions, 39014 flow
[2024-03-12 00:19:08,426 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 2601 transitions, 38894 flow, removed 60 selfloop flow, removed 0 redundant places.
[2024-03-12 00:19:08,460 INFO  L231             Difference]: Finished difference. Result has 295 places, 2096 transitions, 33784 flow
[2024-03-12 00:19:08,461 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=24374, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=550, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=33784, PETRI_PLACES=295, PETRI_TRANSITIONS=2096}
[2024-03-12 00:19:08,462 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 155 predicate places.
[2024-03-12 00:19:08,462 INFO  L495      AbstractCegarLoop]: Abstraction has has 295 places, 2096 transitions, 33784 flow
[2024-03-12 00:19:08,462 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 55.02857142857143) internal successors, (1926), 35 states have internal predecessors, (1926), 0 states have call successors, (0), 0 states 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 00:19:08,462 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:19:08,462 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, 1, 1]
[2024-03-12 00:19:08,470 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 00:19:08,663 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:19:08,664 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:19:08,664 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:19:08,665 INFO  L85        PathProgramCache]: Analyzing trace with hash -246001469, now seen corresponding path program 1 times
[2024-03-12 00:19:08,665 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:19:08,665 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925322724]
[2024-03-12 00:19:08,665 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:19:08,666 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:19:08,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:19:09,068 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 00:19:09,068 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:19:09,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925322724]
[2024-03-12 00:19:09,068 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925322724] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:19:09,068 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1690151132]
[2024-03-12 00:19:09,068 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:19:09,069 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:19:09,069 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:19:09,070 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 00:19:09,071 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 00:19:09,178 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:19:09,179 INFO  L262         TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 25 conjunts are in the unsatisfiable core
[2024-03-12 00:19:09,183 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:19:09,262 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 17 treesize of output 9
[2024-03-12 00:19:09,481 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 00:19:09,513 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 00:19:09,558 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 00:19:09,605 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 00:19:09,651 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:19:09,652 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 00:19:09,697 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 00:19:09,698 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:19:09,731 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#race| c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |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 00:19:09,754 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1 0)))) (and (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-12 00:19:09,779 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 |c_ULTIMATE.start_main_~#tids~0#1.offset|)) (.cse1 (+ 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|) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) (+ |c_ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse1) 0)) (forall ((v_ArrVal_924 (Array Int Int))) (= 0 (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) .cse2))) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store .cse0 c_threadThread1of2ForFork0_~p~0.base v_ArrVal_924) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0))))) is different from false
[2024-03-12 00:19:09,948 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 15 treesize of output 7
[2024-03-12 00:19:09,996 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:19:09,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1690151132] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:19:09,997 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:19:09,997 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34
[2024-03-12 00:19:09,997 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119425869]
[2024-03-12 00:19:09,997 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:19:09,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 35 states
[2024-03-12 00:19:09,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:19:09,999 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants.
[2024-03-12 00:19:10,000 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=877, Unknown=3, NotChecked=186, Total=1190
[2024-03-12 00:19:10,003 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 60 out of 140
[2024-03-12 00:19:10,005 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 2096 transitions, 33784 flow. Second operand  has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states 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 00:19:10,005 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:19:10,005 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 140
[2024-03-12 00:19:10,043 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:19:37,427 INFO  L124   PetriNetUnfolderBase]: 38567/72242 cut-off events.
[2024-03-12 00:19:37,427 INFO  L125   PetriNetUnfolderBase]: For 571481/571689 co-relation queries the response was YES.
[2024-03-12 00:19:38,132 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 412563 conditions, 72242 events. 38567/72242 cut-off events. For 571481/571689 co-relation queries the response was YES. Maximal size of possible extension queue 1948. Compared 690553 event pairs, 5313 based on Foata normal form. 515/69183 useless extension candidates. Maximal degree in co-relation 409830. Up to 25382 conditions per place. 
[2024-03-12 00:19:38,446 INFO  L140   encePairwiseOnDemand]: 107/140 looper letters, 1989 selfloop transitions, 1271 changer transitions 0/3346 dead transitions.
[2024-03-12 00:19:38,446 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 3346 transitions, 57693 flow
[2024-03-12 00:19:38,447 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. 
[2024-03-12 00:19:38,447 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2024-03-12 00:19:38,448 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1680 transitions.
[2024-03-12 00:19:38,448 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5714285714285714
[2024-03-12 00:19:38,448 INFO  L72            ComplementDD]: Start complementDD. Operand 21 states and 1680 transitions.
[2024-03-12 00:19:38,449 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 21 states and 1680 transitions.
[2024-03-12 00:19:38,449 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:19:38,449 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1680 transitions.
[2024-03-12 00:19:38,451 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 22 states, 21 states have (on average 80.0) internal successors, (1680), 21 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 00:19:38,453 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states 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 00:19:38,453 INFO  L81            ComplementDD]: Finished complementDD. Result  has 22 states, 22 states have (on average 140.0) internal successors, (3080), 22 states have internal predecessors, (3080), 0 states have call successors, (0), 0 states 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 00:19:38,453 INFO  L175             Difference]: Start difference. First operand has 295 places, 2096 transitions, 33784 flow. Second operand 21 states and 1680 transitions.
[2024-03-12 00:19:38,453 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 3346 transitions, 57693 flow
[2024-03-12 00:20:00,979 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 3346 transitions, 57533 flow, removed 62 selfloop flow, removed 14 redundant places.
[2024-03-12 00:20:01,028 INFO  L231             Difference]: Finished difference. Result has 310 places, 2745 transitions, 50677 flow
[2024-03-12 00:20:01,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=33626, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2096, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=691, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=50677, PETRI_PLACES=310, PETRI_TRANSITIONS=2745}
[2024-03-12 00:20:01,030 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 170 predicate places.
[2024-03-12 00:20:01,030 INFO  L495      AbstractCegarLoop]: Abstraction has has 310 places, 2745 transitions, 50677 flow
[2024-03-12 00:20:01,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 35 states, 35 states have (on average 62.65714285714286) internal successors, (2193), 35 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states 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 00:20:01,031 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:20:01,031 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:20:01,038 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 00:20:01,232 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,SelfDestructingSolverStorable16
[2024-03-12 00:20:01,232 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:20:01,233 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:20:01,233 INFO  L85        PathProgramCache]: Analyzing trace with hash -1922724183, now seen corresponding path program 2 times
[2024-03-12 00:20:01,233 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:20:01,233 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343007119]
[2024-03-12 00:20:01,234 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:20:01,234 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:20:01,256 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:20:01,719 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:20:01,719 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:20:01,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343007119]
[2024-03-12 00:20:01,720 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343007119] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:20:01,720 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [293082460]
[2024-03-12 00:20:01,720 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:20:01,720 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:20:01,720 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:20:01,721 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 00:20:01,723 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 00:20:01,895 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:20:01,895 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:20:01,896 INFO  L262         TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjunts are in the unsatisfiable core
[2024-03-12 00:20:01,901 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:20:01,995 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 26 treesize of output 14
[2024-03-12 00:20:02,221 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 00:20:02,268 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 00:20:02,329 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:20:02,330 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 00:20:02,391 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:20:02,392 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 00:20:02,459 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:20:02,460 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 00:20:02,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:20:02,567 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 00:20:02,581 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:20:02,582 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:20:27,266 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)))))) is different from false
[2024-03-12 00:20:27,287 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse1) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1040 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1040) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-12 00:20:27,717 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 27 treesize of output 15
[2024-03-12 00:20:27,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-03-12 00:20:27,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [293082460] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:20:27,850 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:20:27,850 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38
[2024-03-12 00:20:27,850 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376566194]
[2024-03-12 00:20:27,850 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:20:27,851 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 39 states
[2024-03-12 00:20:27,852 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:20:27,853 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants.
[2024-03-12 00:20:27,853 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1167, Unknown=27, NotChecked=142, Total=1482
[2024-03-12 00:20:28,452 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 55 out of 140
[2024-03-12 00:20:28,454 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 2745 transitions, 50677 flow. Second operand  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states 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 00:20:28,454 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:20:28,455 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 140
[2024-03-12 00:20:28,455 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:21:15,971 INFO  L124   PetriNetUnfolderBase]: 44478/80919 cut-off events.
[2024-03-12 00:21:15,971 INFO  L125   PetriNetUnfolderBase]: For 796211/796308 co-relation queries the response was YES.
[2024-03-12 00:21:17,055 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 496640 conditions, 80919 events. 44478/80919 cut-off events. For 796211/796308 co-relation queries the response was YES. Maximal size of possible extension queue 2047. Compared 760981 event pairs, 5606 based on Foata normal form. 623/77786 useless extension candidates. Maximal degree in co-relation 493242. Up to 26071 conditions per place. 
[2024-03-12 00:21:17,404 INFO  L140   encePairwiseOnDemand]: 112/140 looper letters, 1815 selfloop transitions, 2024 changer transitions 1/3896 dead transitions.
[2024-03-12 00:21:17,404 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 3896 transitions, 73463 flow
[2024-03-12 00:21:17,405 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. 
[2024-03-12 00:21:17,405 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 31 states.
[2024-03-12 00:21:17,406 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2256 transitions.
[2024-03-12 00:21:17,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5198156682027649
[2024-03-12 00:21:17,407 INFO  L72            ComplementDD]: Start complementDD. Operand 31 states and 2256 transitions.
[2024-03-12 00:21:17,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 31 states and 2256 transitions.
[2024-03-12 00:21:17,407 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:21:17,408 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 31 states and 2256 transitions.
[2024-03-12 00:21:17,410 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 32 states, 31 states have (on average 72.7741935483871) internal successors, (2256), 31 states have internal predecessors, (2256), 0 states have call successors, (0), 0 states 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 00:21:17,413 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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 00:21:17,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 32 states, 32 states have (on average 140.0) internal successors, (4480), 32 states have internal predecessors, (4480), 0 states have call successors, (0), 0 states 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 00:21:17,413 INFO  L175             Difference]: Start difference. First operand has 310 places, 2745 transitions, 50677 flow. Second operand 31 states and 2256 transitions.
[2024-03-12 00:21:17,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 3896 transitions, 73463 flow
[2024-03-12 00:21:36,527 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 3896 transitions, 73338 flow, removed 36 selfloop flow, removed 10 redundant places.
[2024-03-12 00:21:36,585 INFO  L231             Difference]: Finished difference. Result has 342 places, 3237 transitions, 68372 flow
[2024-03-12 00:21:36,587 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=50576, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1643, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1029, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=68372, PETRI_PLACES=342, PETRI_TRANSITIONS=3237}
[2024-03-12 00:21:36,587 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 202 predicate places.
[2024-03-12 00:21:36,587 INFO  L495      AbstractCegarLoop]: Abstraction has has 342 places, 3237 transitions, 68372 flow
[2024-03-12 00:21:36,588 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 39 states, 39 states have (on average 57.87179487179487) internal successors, (2257), 39 states have internal predecessors, (2257), 0 states have call successors, (0), 0 states 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 00:21:36,588 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:21:36,588 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:21:36,595 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 00:21:36,789 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,SelfDestructingSolverStorable17
[2024-03-12 00:21:36,789 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:21:36,790 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:21:36,790 INFO  L85        PathProgramCache]: Analyzing trace with hash -983727366, now seen corresponding path program 1 times
[2024-03-12 00:21:36,790 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:21:36,790 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157991639]
[2024-03-12 00:21:36,791 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:21:36,791 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:21:36,817 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:21:37,761 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 00:21:37,761 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:21:37,761 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157991639]
[2024-03-12 00:21:37,761 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157991639] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:21:37,762 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322036243]
[2024-03-12 00:21:37,762 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:21:37,762 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:21:37,762 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:21:37,763 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 00:21:37,765 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 00:21:37,920 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:21:37,921 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-03-12 00:21:37,926 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:21:38,071 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 00:21:38,159 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-03-12 00:21:38,160 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 00:21:38,372 INFO  L349             Elim1Store]: treesize reduction 32, result has 45.8 percent of original size
[2024-03-12 00:21:38,372 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 2 case distinctions, treesize of input 23 treesize of output 33
[2024-03-12 00:21:38,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:21:38,501 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:21:38,502 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 32 treesize of output 30
[2024-03-12 00:21:38,871 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:21:39,510 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-12 00:21:39,510 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-03-12 00:21:39,558 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 18
[2024-03-12 00:21:40,263 INFO  L349             Elim1Store]: treesize reduction 36, result has 29.4 percent of original size
[2024-03-12 00:21:40,263 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 3 case distinctions, treesize of input 71 treesize of output 63
[2024-03-12 00:21:40,383 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 00:21:40,970 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 00:21:41,131 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:21:41,132 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 1 case distinctions, treesize of input 26 treesize of output 28
[2024-03-12 00:21:41,346 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:21:41,346 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 70 treesize of output 50
[2024-03-12 00:21:41,484 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 00:21:41,599 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:21:41,600 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 00:21:41,638 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:21:41,639 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 00:21:41,669 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:21:41,670 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 00:21:41,709 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:21:41,710 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 00:21:41,839 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 00:21:41,926 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 00:21:41,926 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:21:41,957 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))) is different from false
[2024-03-12 00:21:42,004 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false
[2024-03-12 00:21:42,075 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset))))))) is different from false
[2024-03-12 00:21:42,102 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~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_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-12 00:21:42,130 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse3 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|) .cse3 |c_threadThread1of2ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse2) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)))) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1164 (Array Int Int)) (v_ArrVal_1163 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_1163) .cse1 v_ArrVal_1164) c_threadThread1of2ForFork0_~p~0.base) .cse3)))))) is different from false
[2024-03-12 00:21:42,878 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 8 treesize of output 4
[2024-03-12 00:21:43,553 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:21:43,554 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 114 treesize of output 103
[2024-03-12 00:21:43,565 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 65 treesize of output 63
[2024-03-12 00:21:44,096 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 00:21:44,096 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [322036243] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:21:44,097 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:21:44,097 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25, 22] total 59
[2024-03-12 00:21:44,097 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913235084]
[2024-03-12 00:21:44,097 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:21:44,098 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 60 states
[2024-03-12 00:21:44,098 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:21:44,099 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants.
[2024-03-12 00:21:44,100 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=2751, Unknown=10, NotChecked=550, Total=3540
[2024-03-12 00:21:44,138 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 35 out of 140
[2024-03-12 00:21:44,140 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 3237 transitions, 68372 flow. Second operand  has 60 states, 60 states have (on average 37.43333333333333) internal successors, (2246), 60 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states 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 00:21:44,140 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:21:44,140 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 140
[2024-03-12 00:21:44,141 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:23:19,712 INFO  L124   PetriNetUnfolderBase]: 54966/98161 cut-off events.
[2024-03-12 00:23:19,712 INFO  L125   PetriNetUnfolderBase]: For 1471946/1471947 co-relation queries the response was YES.
[2024-03-12 00:23:20,912 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 657083 conditions, 98161 events. 54966/98161 cut-off events. For 1471946/1471947 co-relation queries the response was YES. Maximal size of possible extension queue 2298. Compared 910057 event pairs, 9865 based on Foata normal form. 71/93895 useless extension candidates. Maximal degree in co-relation 654576. Up to 49663 conditions per place. 
[2024-03-12 00:23:21,453 INFO  L140   encePairwiseOnDemand]: 69/140 looper letters, 4662 selfloop transitions, 1302 changer transitions 209/6208 dead transitions.
[2024-03-12 00:23:21,453 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 6208 transitions, 120372 flow
[2024-03-12 00:23:21,454 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. 
[2024-03-12 00:23:21,454 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 118 states.
[2024-03-12 00:23:21,458 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 5649 transitions.
[2024-03-12 00:23:21,460 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3419491525423729
[2024-03-12 00:23:21,460 INFO  L72            ComplementDD]: Start complementDD. Operand 118 states and 5649 transitions.
[2024-03-12 00:23:21,460 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 118 states and 5649 transitions.
[2024-03-12 00:23:21,461 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:23:21,461 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 118 states and 5649 transitions.
[2024-03-12 00:23:21,467 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 119 states, 118 states have (on average 47.8728813559322) internal successors, (5649), 118 states have internal predecessors, (5649), 0 states have call successors, (0), 0 states 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 00:23:21,478 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 119 states, 119 states have (on average 140.0) internal successors, (16660), 119 states have internal predecessors, (16660), 0 states have call successors, (0), 0 states 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 00:23:21,480 INFO  L81            ComplementDD]: Finished complementDD. Result  has 119 states, 119 states have (on average 140.0) internal successors, (16660), 119 states have internal predecessors, (16660), 0 states have call successors, (0), 0 states 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 00:23:21,480 INFO  L175             Difference]: Start difference. First operand has 342 places, 3237 transitions, 68372 flow. Second operand 118 states and 5649 transitions.
[2024-03-12 00:23:21,480 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 6208 transitions, 120372 flow
[2024-03-12 00:24:19,455 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 6208 transitions, 119410 flow, removed 438 selfloop flow, removed 16 redundant places.
[2024-03-12 00:24:19,546 INFO  L231             Difference]: Finished difference. Result has 497 places, 4317 transitions, 92465 flow
[2024-03-12 00:24:19,548 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=67852, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=3237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=407, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=118, PETRI_FLOW=92465, PETRI_PLACES=497, PETRI_TRANSITIONS=4317}
[2024-03-12 00:24:19,549 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 357 predicate places.
[2024-03-12 00:24:19,549 INFO  L495      AbstractCegarLoop]: Abstraction has has 497 places, 4317 transitions, 92465 flow
[2024-03-12 00:24:19,549 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 60 states, 60 states have (on average 37.43333333333333) internal successors, (2246), 60 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states 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 00:24:19,549 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:24:19,550 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, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:24:19,554 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 00:24:19,750 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:24:19,751 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:24:19,752 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:24:19,752 INFO  L85        PathProgramCache]: Analyzing trace with hash -2035886798, now seen corresponding path program 2 times
[2024-03-12 00:24:19,752 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:24:19,752 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445969817]
[2024-03-12 00:24:19,752 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:24:19,752 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:24:19,776 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:24:21,725 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 00:24:21,725 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:24:21,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445969817]
[2024-03-12 00:24:21,725 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445969817] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:24:21,725 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103831051]
[2024-03-12 00:24:21,726 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-03-12 00:24:21,726 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:24:21,726 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:24:21,727 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 00:24:21,728 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 00:24:21,868 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-03-12 00:24:21,869 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:24:21,871 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 59 conjunts are in the unsatisfiable core
[2024-03-12 00:24:21,876 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:24:21,939 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 00:24:22,098 INFO  L349             Elim1Store]: treesize reduction 27, result has 25.0 percent of original size
[2024-03-12 00:24:22,099 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18
[2024-03-12 00:24:22,210 INFO  L349             Elim1Store]: treesize reduction 20, result has 39.4 percent of original size
[2024-03-12 00:24:22,211 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22
[2024-03-12 00:24:22,523 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-03-12 00:24:23,191 INFO  L349             Elim1Store]: treesize reduction 40, result has 27.3 percent of original size
[2024-03-12 00:24:23,192 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 62
[2024-03-12 00:24:23,208 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 23 treesize of output 17
[2024-03-12 00:24:23,658 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:24:23,659 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 00:24:23,779 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 00:24:23,865 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 00:24:23,940 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 00:24:24,030 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 00:24:24,127 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 00:24:24,227 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 00:24:24,307 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 00:24:24,307 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:24:24,342 WARN  L854   $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 3 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))) is different from false
[2024-03-12 00:24:24,362 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ 2 c_threadThread1of2ForFork0_~p~0.offset)))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1))))))) is different from false
[2024-03-12 00:24:24,385 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (+ 2 c_threadThread1of2ForFork0_~p~0.offset)) (.cse2 (+ 3 c_threadThread1of2ForFork0_~p~0.offset))) (let ((.cse0 (store |c_#race| c_threadThread1of2ForFork0_~p~0.base (store (store (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) .cse1 |c_threadThread1of2ForFork0_#t~nondet4|) .cse2 |c_threadThread1of2ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset))) (forall ((v_ArrVal_1283 (Array Int Int))) (= (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) (+ c_threadThread1of2ForFork0_~p~0.offset 1)) |c_threadThread1of2ForFork0_#t~nondet4|)) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse1))) (forall ((v_ArrVal_1283 (Array Int Int))) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select (store .cse0 |c_ULTIMATE.start_main_#t~mem14#1.base| v_ArrVal_1283) c_threadThread1of2ForFork0_~p~0.base) .cse2)))))) is different from false
[2024-03-12 00:24:24,556 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:24:24,557 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 00:24:24,563 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:24:24,564 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 00:24:24,573 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:24:24,573 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 00:24:24,577 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:24:24,578 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 00:24:24,585 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-03-12 00:24:24,585 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 00:24:25,287 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#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_1275) |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1276) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) is different from false
[2024-03-12 00:24:25,322 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1275 (Array Int Int))) (not (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#datas~0#1.base|) |c_ULTIMATE.start_main_~#datas~0#1.offset|))) (= .cse0 (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_1275) .cse0 v_ArrVal_1276) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))))) is different from false
[2024-03-12 00:24:25,343 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 8 treesize of output 4
[2024-03-12 00:24:25,720 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:24:25,721 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 241 treesize of output 144
[2024-03-12 00:24:25,730 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 00:24:25,736 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-03-12 00:24:25,938 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:24:25,939 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 41 treesize of output 46
[2024-03-12 00:24:26,064 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 00:24:26,065 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103831051] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:24:26,065 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:24:26,065 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 20] total 60
[2024-03-12 00:24:26,065 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218871659]
[2024-03-12 00:24:26,065 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:24:26,066 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 61 states
[2024-03-12 00:24:26,067 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:24:26,067 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants.
[2024-03-12 00:24:26,068 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2844, Unknown=30, NotChecked=560, Total=3660
[2024-03-12 00:24:26,850 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 39 out of 140
[2024-03-12 00:24:26,851 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 497 places, 4317 transitions, 92465 flow. Second operand  has 61 states, 61 states have (on average 41.442622950819676) internal successors, (2528), 61 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states 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 00:24:26,852 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:24:26,852 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 140
[2024-03-12 00:24:26,852 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:26:01,241 INFO  L124   PetriNetUnfolderBase]: 56892/100958 cut-off events.
[2024-03-12 00:26:01,241 INFO  L125   PetriNetUnfolderBase]: For 1917511/1917980 co-relation queries the response was YES.
[2024-03-12 00:26:03,367 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 756052 conditions, 100958 events. 56892/100958 cut-off events. For 1917511/1917980 co-relation queries the response was YES. Maximal size of possible extension queue 2285. Compared 926855 event pairs, 13316 based on Foata normal form. 51/96581 useless extension candidates. Maximal degree in co-relation 754536. Up to 75323 conditions per place. 
[2024-03-12 00:26:03,886 INFO  L140   encePairwiseOnDemand]: 81/140 looper letters, 4521 selfloop transitions, 862 changer transitions 183/5604 dead transitions.
[2024-03-12 00:26:03,886 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 5604 transitions, 121542 flow
[2024-03-12 00:26:03,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. 
[2024-03-12 00:26:03,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 45 states.
[2024-03-12 00:26:03,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2411 transitions.
[2024-03-12 00:26:03,889 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.3826984126984127
[2024-03-12 00:26:03,889 INFO  L72            ComplementDD]: Start complementDD. Operand 45 states and 2411 transitions.
[2024-03-12 00:26:03,889 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 45 states and 2411 transitions.
[2024-03-12 00:26:03,890 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-03-12 00:26:03,890 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 45 states and 2411 transitions.
[2024-03-12 00:26:03,892 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 46 states, 45 states have (on average 53.577777777777776) internal successors, (2411), 45 states have internal predecessors, (2411), 0 states have call successors, (0), 0 states 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 00:26:03,896 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 46 states, 46 states have (on average 140.0) internal successors, (6440), 46 states have internal predecessors, (6440), 0 states have call successors, (0), 0 states 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 00:26:03,896 INFO  L81            ComplementDD]: Finished complementDD. Result  has 46 states, 46 states have (on average 140.0) internal successors, (6440), 46 states have internal predecessors, (6440), 0 states have call successors, (0), 0 states 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 00:26:03,896 INFO  L175             Difference]: Start difference. First operand has 497 places, 4317 transitions, 92465 flow. Second operand 45 states and 2411 transitions.
[2024-03-12 00:26:03,897 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 5604 transitions, 121542 flow
[2024-03-12 00:27:26,446 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 512 places, 5604 transitions, 120534 flow, removed 468 selfloop flow, removed 25 redundant places.
[2024-03-12 00:27:26,535 INFO  L231             Difference]: Finished difference. Result has 529 places, 4585 transitions, 100272 flow
[2024-03-12 00:27:26,538 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=140, PETRI_DIFFERENCE_MINUEND_FLOW=91689, PETRI_DIFFERENCE_MINUEND_PLACES=468, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=620, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=100272, PETRI_PLACES=529, PETRI_TRANSITIONS=4585}
[2024-03-12 00:27:26,538 INFO  L281   CegarLoopForPetriNet]: 140 programPoint places, 389 predicate places.
[2024-03-12 00:27:26,538 INFO  L495      AbstractCegarLoop]: Abstraction has has 529 places, 4585 transitions, 100272 flow
[2024-03-12 00:27:26,539 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 61 states, 61 states have (on average 41.442622950819676) internal successors, (2528), 61 states have internal predecessors, (2528), 0 states have call successors, (0), 0 states 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 00:27:26,539 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-03-12 00:27:26,539 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-03-12 00:27:26,548 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-03-12 00:27:26,739 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:27:26,740 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (and 7 more)] ===
[2024-03-12 00:27:26,741 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-03-12 00:27:26,741 INFO  L85        PathProgramCache]: Analyzing trace with hash 1527973436, now seen corresponding path program 3 times
[2024-03-12 00:27:26,741 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-03-12 00:27:26,741 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753605423]
[2024-03-12 00:27:26,742 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-03-12 00:27:26,742 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-03-12 00:27:26,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-03-12 00:27:28,640 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 00:27:28,641 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-03-12 00:27:28,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753605423]
[2024-03-12 00:27:28,641 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753605423] provided 0 perfect and 1 imperfect interpolant sequences
[2024-03-12 00:27:28,641 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166657379]
[2024-03-12 00:27:28,641 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-03-12 00:27:28,641 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-03-12 00:27:28,641 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-03-12 00:27:28,642 INFO  L229       MonitoredProcess]: Starting monitored process 11 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 00:27:28,644 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-03-12 00:27:28,819 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-03-12 00:27:28,820 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-03-12 00:27:28,821 INFO  L262         TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 47 conjunts are in the unsatisfiable core
[2024-03-12 00:27:28,828 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-03-12 00:27:28,868 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 00:27:28,982 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:27:28,983 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 18 treesize of output 13
[2024-03-12 00:27:29,067 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-03-12 00:27:29,067 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 00:27:29,746 INFO  L349             Elim1Store]: treesize reduction 44, result has 20.0 percent of original size
[2024-03-12 00:27:29,746 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 66
[2024-03-12 00:27:30,276 INFO  L349             Elim1Store]: treesize reduction 40, result has 21.6 percent of original size
[2024-03-12 00:27:30,276 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 52
[2024-03-12 00:27:30,319 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 00:27:30,443 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 00:27:30,750 INFO  L349             Elim1Store]: treesize reduction 3, result has 75.0 percent of original size
[2024-03-12 00:27:30,750 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 40
[2024-03-12 00:27:30,851 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:27:30,851 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 00:27:30,969 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:27:30,970 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25
[2024-03-12 00:27:30,995 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:27:30,995 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 00:27:31,131 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:27:31,132 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 00:27:31,158 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:27:31,159 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 00:27:31,181 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-03-12 00:27:31,182 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 00:27:31,309 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:27:31,310 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 47
[2024-03-12 00:27:31,321 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 00:27:31,321 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-03-12 00:27:38,363 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 00:27:38,368 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 00:27:38,368 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 1
[2024-03-12 00:27:38,370 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 00:27:38,375 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 00:27:38,375 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 00:27:38,377 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-03-12 00:27:38,381 INFO  L349             Elim1Store]: treesize reduction 28, result has 3.4 percent of original size
[2024-03-12 00:27:38,382 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 00:27:39,840 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:27:39,841 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 114 treesize of output 103
[2024-03-12 00:27:39,848 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 65 treesize of output 63
[2024-03-12 00:27:40,155 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-03-12 00:27:40,156 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 117 treesize of output 122
[2024-03-12 00:27:40,311 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 00:27:40,312 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [166657379] provided 0 perfect and 2 imperfect interpolant sequences
[2024-03-12 00:27:40,312 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-03-12 00:27:40,312 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 58
[2024-03-12 00:27:40,312 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174017518]
[2024-03-12 00:27:40,312 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-03-12 00:27:40,312 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 59 states
[2024-03-12 00:27:40,313 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-03-12 00:27:40,313 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants.
[2024-03-12 00:27:40,314 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=3150, Unknown=48, NotChecked=0, Total=3422
[2024-03-12 00:27:52,609 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 39 out of 140
[2024-03-12 00:27:52,611 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 4585 transitions, 100272 flow. Second operand  has 59 states, 59 states have (on average 41.45762711864407) internal successors, (2446), 59 states have internal predecessors, (2446), 0 states have call successors, (0), 0 states 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 00:27:52,611 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-03-12 00:27:52,611 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 140
[2024-03-12 00:27:52,611 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-03-12 00:28:11,856 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (let ((.cse1 (= (select |c_#valid| .cse0) 1)) (.cse5 (+ 2 .cse0)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= c_threadThread1of2ForFork0_~p~0.base .cse0)) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| .cse0)) (not (= c_threadThread1of2ForFork0_~arg.base .cse0)) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| |c_ULTIMATE.start_main_~#tids~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~#tids~0#1.base|) 1) (= |c_threadThread1of2ForFork0_#t~nondet4| (select (select |c_#race| c_threadThread1of2ForFork0_~p~0.base) c_threadThread1of2ForFork0_~p~0.offset)) (<= 0 c_threadThread1of2ForFork0_~p~0.offset) .cse1 (<= .cse2 |c_ULTIMATE.start_main_~#tids~0#1.base|) (forall ((v_ArrVal_1394 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem11#1.base| v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) |c_ULTIMATE.start_main_#t~mem9#1.base|))) (exists ((|ULTIMATE.start_main_~#datas~0#1.base| Int) (|ULTIMATE.start_main_~#datas~0#1.offset| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~#datas~0#1.base|) |ULTIMATE.start_main_~#datas~0#1.offset|))) (let ((.cse4 (+ .cse3 2))) (and (= .cse3 c_threadThread1of2ForFork0_~p~0.base) (not (= .cse3 .cse0)) (<= .cse4 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= .cse5 |ULTIMATE.start_main_~#datas~0#1.base|) (<= .cse4 |ULTIMATE.start_main_~#datas~0#1.base|))))) (not (= |c_ULTIMATE.start_main_~#tids~0#1.base| c_threadThread1of2ForFork0_~p~0.base)) (or (= .cse0 |c_ULTIMATE.start_main_~#datas~0#1.base|) .cse1) (<= .cse5 |c_ULTIMATE.start_main_~#tids~0#1.base|) (<= 0 c_threadThread1of2ForFork0_~arg.offset) (not (= c_threadThread1of2ForFork0_~arg.base |c_ULTIMATE.start_main_~#tids~0#1.base|)) (<= (+ .cse0 1) |c_#StackHeapBarrier|) (forall ((v_ArrVal_1394 (Array Int Int))) (not (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1394) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|)))) (<= 0 |c_threadThread1of2ForFork0_#in~arg.offset|) (<= .cse2 |c_ULTIMATE.start_main_~#datas~0#1.base|) (not (= |c_threadThread1of2ForFork0_#in~arg.base| |c_ULTIMATE.start_main_~#tids~0#1.base|)) (not (= |c_threadThread1of2ForFork0_#in~arg.base| .cse0)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) 0)))) is different from false
Killed by 15
