/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 21:19:18,830 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 21:19:18,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 21:19:18,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 21:19:18,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 21:19:18,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 21:19:18,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 21:19:18,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 21:19:18,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 21:19:18,924 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 21:19:18,925 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 21:19:18,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 21:19:18,925 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 21:19:18,926 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 21:19:18,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 21:19:18,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 21:19:18,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 21:19:18,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 21:19:18,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 21:19:18,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 21:19:18,927 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 21:19:18,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 21:19:18,928 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 21:19:18,928 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 21:19:18,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 21:19:18,928 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 21:19:18,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 21:19:18,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:19:18,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 21:19:18,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 21:19:18,930 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/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.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 21:19:19,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 21:19:19,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 21:19:19,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 21:19:19,178 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 21:19:19,180 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 21:19:19,181 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-25 21:19:20,095 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 21:19:20,281 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 21:19:20,282 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-three-array-max.wvr.c [2023-08-25 21:19:20,289 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11e88d87/50b7a548b05d459ca7a27d778949494a/FLAGc9ddbd20c [2023-08-25 21:19:20,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b11e88d87/50b7a548b05d459ca7a27d778949494a [2023-08-25 21:19:20,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 21:19:20,300 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 21:19:20,300 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 21:19:20,300 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 21:19:20,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 21:19:20,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b0e2468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20, skipping insertion in model container [2023-08-25 21:19:20,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,322 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 21:19:20,441 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:19:20,446 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 21:19:20,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 21:19:20,489 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:19:20,489 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 21:19:20,493 INFO L206 MainTranslator]: Completed translation [2023-08-25 21:19:20,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20 WrapperNode [2023-08-25 21:19:20,494 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 21:19:20,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 21:19:20,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 21:19:20,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 21:19:20,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,522 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,557 INFO L138 Inliner]: procedures = 26, calls = 58, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 381 [2023-08-25 21:19:20,558 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 21:19:20,558 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 21:19:20,558 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 21:19:20,558 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 21:19:20,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,575 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,597 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 21:19:20,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 21:19:20,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 21:19:20,616 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 21:19:20,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (1/1) ... [2023-08-25 21:19:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 21:19:20,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:20,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 21:19:20,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 21:19:20,669 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 21:19:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 21:19:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 21:19:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 21:19:20,670 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-25 21:19:20,670 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-25 21:19:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-25 21:19:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-25 21:19:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-25 21:19:20,671 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-25 21:19:20,671 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 21:19:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-25 21:19:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-25 21:19:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-25 21:19:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 21:19:20,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 21:19:20,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 21:19:20,673 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 21:19:20,785 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 21:19:20,787 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 21:19:21,378 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 21:19:21,462 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 21:19:21,462 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-25 21:19:21,464 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:19:21 BoogieIcfgContainer [2023-08-25 21:19:21,464 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 21:19:21,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 21:19:21,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 21:19:21,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 21:19:21,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 09:19:20" (1/3) ... [2023-08-25 21:19:21,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81ef187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:19:21, skipping insertion in model container [2023-08-25 21:19:21,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 09:19:20" (2/3) ... [2023-08-25 21:19:21,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@81ef187 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 09:19:21, skipping insertion in model container [2023-08-25 21:19:21,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 09:19:21" (3/3) ... [2023-08-25 21:19:21,468 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-three-array-max.wvr.c [2023-08-25 21:19:21,479 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 21:19:21,479 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 59 error locations. [2023-08-25 21:19:21,479 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 21:19:21,552 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 21:19:21,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 489 places, 506 transitions, 1036 flow [2023-08-25 21:19:21,741 INFO L124 PetriNetUnfolderBase]: 27/503 cut-off events. [2023-08-25 21:19:21,741 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:19:21,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 503 events. 27/503 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 651 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-25 21:19:21,747 INFO L82 GeneralOperation]: Start removeDead. Operand has 489 places, 506 transitions, 1036 flow [2023-08-25 21:19:21,755 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 475 places, 492 transitions, 1002 flow [2023-08-25 21:19:21,763 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 21:19:21,773 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-25 21:19:21,775 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 475 places, 492 transitions, 1002 flow [2023-08-25 21:19:21,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 492 transitions, 1002 flow [2023-08-25 21:19:21,835 INFO L124 PetriNetUnfolderBase]: 27/492 cut-off events. [2023-08-25 21:19:21,835 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-25 21:19:21,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 492 events. 27/492 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 652 event pairs, 0 based on Foata normal form. 0/407 useless extension candidates. Maximal degree in co-relation 404. Up to 2 conditions per place. [2023-08-25 21:19:21,844 INFO L119 LiptonReduction]: Number of co-enabled transitions 14004 [2023-08-25 21:19:50,133 INFO L134 LiptonReduction]: Checked pairs total: 116695 [2023-08-25 21:19:50,133 INFO L136 LiptonReduction]: Total number of compositions: 512 [2023-08-25 21:19:50,143 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 21:19:50,147 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5ccbe3ee, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 21:19:50,147 INFO L358 AbstractCegarLoop]: Starting to check reachability of 91 error locations. [2023-08-25 21:19:50,148 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 21:19:50,148 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-25 21:19:50,148 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 21:19:50,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:50,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-25 21:19:50,149 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:50,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:50,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1982, now seen corresponding path program 1 times [2023-08-25 21:19:50,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:50,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396530544] [2023-08-25 21:19:50,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:50,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:50,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:19:50,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:50,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396530544] [2023-08-25 21:19:50,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396530544] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:50,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:50,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-25 21:19:50,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999082791] [2023-08-25 21:19:50,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:50,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-25 21:19:50,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:50,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-25 21:19:50,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-25 21:19:50,239 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 464 out of 1018 [2023-08-25 21:19:50,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 144 transitions, 306 flow. Second operand has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:50,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 464 of 1018 [2023-08-25 21:19:50,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:50,589 INFO L124 PetriNetUnfolderBase]: 1139/2880 cut-off events. [2023-08-25 21:19:50,589 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2023-08-25 21:19:50,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 2880 events. 1139/2880 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 22220 event pairs, 599 based on Foata normal form. 437/2712 useless extension candidates. Maximal degree in co-relation 4044. Up to 1506 conditions per place. [2023-08-25 21:19:50,603 INFO L140 encePairwiseOnDemand]: 972/1018 looper letters, 36 selfloop transitions, 0 changer transitions 0/98 dead transitions. [2023-08-25 21:19:50,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 98 transitions, 286 flow [2023-08-25 21:19:50,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-25 21:19:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-25 21:19:50,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1010 transitions. [2023-08-25 21:19:50,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4960707269155206 [2023-08-25 21:19:50,617 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1010 transitions. [2023-08-25 21:19:50,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1010 transitions. [2023-08-25 21:19:50,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:50,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1010 transitions. [2023-08-25 21:19:50,625 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 505.0) internal successors, (1010), 2 states have internal predecessors, (1010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,632 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1018.0) internal successors, (3054), 3 states have internal predecessors, (3054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,633 INFO L175 Difference]: Start difference. First operand has 142 places, 144 transitions, 306 flow. Second operand 2 states and 1010 transitions. [2023-08-25 21:19:50,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 98 transitions, 286 flow [2023-08-25 21:19:50,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 274 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:19:50,639 INFO L231 Difference]: Finished difference. Result has 94 places, 98 transitions, 202 flow [2023-08-25 21:19:50,640 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=202, PETRI_PLACES=94, PETRI_TRANSITIONS=98} [2023-08-25 21:19:50,643 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-25 21:19:50,643 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 98 transitions, 202 flow [2023-08-25 21:19:50,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 464.5) internal successors, (929), 2 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:50,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:50,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 21:19:50,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:50,651 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:50,651 INFO L85 PathProgramCache]: Analyzing trace with hash 1131874658, now seen corresponding path program 1 times [2023-08-25 21:19:50,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:50,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598087057] [2023-08-25 21:19:50,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:50,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:19:50,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:50,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598087057] [2023-08-25 21:19:50,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598087057] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:50,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:19:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191933650] [2023-08-25 21:19:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:50,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:19:50,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:19:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:19:50,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 1018 [2023-08-25 21:19:50,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 98 transitions, 202 flow. Second operand has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:50,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:50,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 1018 [2023-08-25 21:19:50,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:51,194 INFO L124 PetriNetUnfolderBase]: 2055/4529 cut-off events. [2023-08-25 21:19:51,195 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-25 21:19:51,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7429 conditions, 4529 events. 2055/4529 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 33591 event pairs, 1462 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 7426. Up to 2836 conditions per place. [2023-08-25 21:19:51,212 INFO L140 encePairwiseOnDemand]: 1014/1018 looper letters, 39 selfloop transitions, 1 changer transitions 0/95 dead transitions. [2023-08-25 21:19:51,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 95 transitions, 276 flow [2023-08-25 21:19:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:19:51,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:19:51,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1363 transitions. [2023-08-25 21:19:51,216 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44629993451211525 [2023-08-25 21:19:51,216 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1363 transitions. [2023-08-25 21:19:51,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1363 transitions. [2023-08-25 21:19:51,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:51,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1363 transitions. [2023-08-25 21:19:51,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 454.3333333333333) internal successors, (1363), 3 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,224 INFO L175 Difference]: Start difference. First operand has 94 places, 98 transitions, 202 flow. Second operand 3 states and 1363 transitions. [2023-08-25 21:19:51,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 95 transitions, 276 flow [2023-08-25 21:19:51,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 95 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:19:51,227 INFO L231 Difference]: Finished difference. Result has 93 places, 95 transitions, 198 flow [2023-08-25 21:19:51,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=95} [2023-08-25 21:19:51,229 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -49 predicate places. [2023-08-25 21:19:51,229 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 95 transitions, 198 flow [2023-08-25 21:19:51,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 442.3333333333333) internal successors, (1327), 3 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:51,232 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:51,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 21:19:51,236 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:51,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:51,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1105207622, now seen corresponding path program 1 times [2023-08-25 21:19:51,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:51,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660010038] [2023-08-25 21:19:51,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:51,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:19:51,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:51,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660010038] [2023-08-25 21:19:51,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660010038] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:51,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:51,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:19:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904417266] [2023-08-25 21:19:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:51,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:19:51,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:51,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:19:51,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:19:51,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-25 21:19:51,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 95 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:51,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-25 21:19:51,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:51,658 INFO L124 PetriNetUnfolderBase]: 1507/3592 cut-off events. [2023-08-25 21:19:51,658 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 21:19:51,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5639 conditions, 3592 events. 1507/3592 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 28062 event pairs, 828 based on Foata normal form. 0/2973 useless extension candidates. Maximal degree in co-relation 5635. Up to 1987 conditions per place. [2023-08-25 21:19:51,674 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 38 selfloop transitions, 1 changer transitions 0/93 dead transitions. [2023-08-25 21:19:51,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 272 flow [2023-08-25 21:19:51,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:19:51,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:19:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-25 21:19:51,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-25 21:19:51,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-25 21:19:51,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-25 21:19:51,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:51,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-25 21:19:51,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,685 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,685 INFO L175 Difference]: Start difference. First operand has 93 places, 95 transitions, 198 flow. Second operand 3 states and 1388 transitions. [2023-08-25 21:19:51,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 272 flow [2023-08-25 21:19:51,687 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 271 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:19:51,688 INFO L231 Difference]: Finished difference. Result has 92 places, 93 transitions, 195 flow [2023-08-25 21:19:51,689 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=92, PETRI_TRANSITIONS=93} [2023-08-25 21:19:51,689 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -50 predicate places. [2023-08-25 21:19:51,690 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 93 transitions, 195 flow [2023-08-25 21:19:51,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 451.6666666666667) internal successors, (1355), 3 states have internal predecessors, (1355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:51,691 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:51,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 21:19:51,694 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:51,694 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 796348320, now seen corresponding path program 1 times [2023-08-25 21:19:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:51,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520086893] [2023-08-25 21:19:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:51,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 21:19:51,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:51,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520086893] [2023-08-25 21:19:51,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520086893] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:51,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:51,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:19:51,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274268621] [2023-08-25 21:19:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:51,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:19:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:51,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:19:51,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:19:51,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 410 out of 1018 [2023-08-25 21:19:51,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 93 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:51,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:51,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 410 of 1018 [2023-08-25 21:19:51,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:52,154 INFO L124 PetriNetUnfolderBase]: 1139/2775 cut-off events. [2023-08-25 21:19:52,154 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 21:19:52,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 2775 events. 1139/2775 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20797 event pairs, 599 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4320. Up to 1506 conditions per place. [2023-08-25 21:19:52,166 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 35 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-25 21:19:52,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 94 transitions, 271 flow [2023-08-25 21:19:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:19:52,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:19:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1268 transitions. [2023-08-25 21:19:52,169 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4151931892599869 [2023-08-25 21:19:52,169 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1268 transitions. [2023-08-25 21:19:52,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1268 transitions. [2023-08-25 21:19:52,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:52,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1268 transitions. [2023-08-25 21:19:52,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 422.6666666666667) internal successors, (1268), 3 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,206 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,206 INFO L175 Difference]: Start difference. First operand has 92 places, 93 transitions, 195 flow. Second operand 3 states and 1268 transitions. [2023-08-25 21:19:52,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 94 transitions, 271 flow [2023-08-25 21:19:52,207 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 94 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:19:52,208 INFO L231 Difference]: Finished difference. Result has 94 places, 94 transitions, 206 flow [2023-08-25 21:19:52,209 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=94, PETRI_TRANSITIONS=94} [2023-08-25 21:19:52,210 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -48 predicate places. [2023-08-25 21:19:52,210 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 94 transitions, 206 flow [2023-08-25 21:19:52,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 413.3333333333333) internal successors, (1240), 3 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,210 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:52,210 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:52,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 21:19:52,211 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:52,211 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 532974789, now seen corresponding path program 1 times [2023-08-25 21:19:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351473231] [2023-08-25 21:19:52,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:52,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 21:19:52,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:52,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351473231] [2023-08-25 21:19:52,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351473231] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:52,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:52,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-25 21:19:52,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532520912] [2023-08-25 21:19:52,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:52,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-25 21:19:52,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:52,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-25 21:19:52,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-25 21:19:52,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 398 out of 1018 [2023-08-25 21:19:52,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 94 transitions, 206 flow. Second operand has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:52,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 398 of 1018 [2023-08-25 21:19:52,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:52,625 INFO L124 PetriNetUnfolderBase]: 1139/2777 cut-off events. [2023-08-25 21:19:52,626 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-08-25 21:19:52,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4334 conditions, 2777 events. 1139/2777 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 20772 event pairs, 599 based on Foata normal form. 0/2195 useless extension candidates. Maximal degree in co-relation 4329. Up to 1505 conditions per place. [2023-08-25 21:19:52,640 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 33 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2023-08-25 21:19:52,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 96 transitions, 288 flow [2023-08-25 21:19:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-25 21:19:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-25 21:19:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1633 transitions. [2023-08-25 21:19:52,644 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40103143418467585 [2023-08-25 21:19:52,644 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1633 transitions. [2023-08-25 21:19:52,644 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1633 transitions. [2023-08-25 21:19:52,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:52,645 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1633 transitions. [2023-08-25 21:19:52,647 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 408.25) internal successors, (1633), 4 states have internal predecessors, (1633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,654 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 1018.0) internal successors, (5090), 5 states have internal predecessors, (5090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,654 INFO L175 Difference]: Start difference. First operand has 94 places, 94 transitions, 206 flow. Second operand 4 states and 1633 transitions. [2023-08-25 21:19:52,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 96 transitions, 288 flow [2023-08-25 21:19:52,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 96 transitions, 284 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-25 21:19:52,657 INFO L231 Difference]: Finished difference. Result has 97 places, 96 transitions, 230 flow [2023-08-25 21:19:52,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=230, PETRI_PLACES=97, PETRI_TRANSITIONS=96} [2023-08-25 21:19:52,659 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -45 predicate places. [2023-08-25 21:19:52,659 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 96 transitions, 230 flow [2023-08-25 21:19:52,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 400.75) internal successors, (1603), 4 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:52,660 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:52,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:52,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-25 21:19:52,660 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:52,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:52,661 INFO L85 PathProgramCache]: Analyzing trace with hash -343018578, now seen corresponding path program 1 times [2023-08-25 21:19:52,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842223578] [2023-08-25 21:19:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:53,059 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:19:53,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:53,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842223578] [2023-08-25 21:19:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842223578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:19:53,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:19:53,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:19:53,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24469285] [2023-08-25 21:19:53,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:19:53,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:19:53,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:53,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:19:53,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:19:53,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-25 21:19:53,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 96 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:53,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:53,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-25 21:19:53,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:55,668 INFO L124 PetriNetUnfolderBase]: 18088/24524 cut-off events. [2023-08-25 21:19:55,669 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-25 21:19:55,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48031 conditions, 24524 events. 18088/24524 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 144945 event pairs, 5719 based on Foata normal form. 0/19471 useless extension candidates. Maximal degree in co-relation 48025. Up to 13554 conditions per place. [2023-08-25 21:19:55,768 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 236 selfloop transitions, 9 changer transitions 0/265 dead transitions. [2023-08-25 21:19:55,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 265 transitions, 1061 flow [2023-08-25 21:19:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:19:55,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:19:55,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2487 transitions. [2023-08-25 21:19:55,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4071709233791749 [2023-08-25 21:19:55,773 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2487 transitions. [2023-08-25 21:19:55,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2487 transitions. [2023-08-25 21:19:55,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:55,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2487 transitions. [2023-08-25 21:19:55,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 414.5) internal successors, (2487), 6 states have internal predecessors, (2487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:55,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:55,784 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:55,784 INFO L175 Difference]: Start difference. First operand has 97 places, 96 transitions, 230 flow. Second operand 6 states and 2487 transitions. [2023-08-25 21:19:55,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 265 transitions, 1061 flow [2023-08-25 21:19:55,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 265 transitions, 1060 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:19:55,787 INFO L231 Difference]: Finished difference. Result has 106 places, 104 transitions, 293 flow [2023-08-25 21:19:55,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=106, PETRI_TRANSITIONS=104} [2023-08-25 21:19:55,787 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -36 predicate places. [2023-08-25 21:19:55,788 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 104 transitions, 293 flow [2023-08-25 21:19:55,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:55,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:55,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:55,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 21:19:55,789 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:55,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:55,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1021553860, now seen corresponding path program 1 times [2023-08-25 21:19:55,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:55,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558514628] [2023-08-25 21:19:55,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:55,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558514628] [2023-08-25 21:19:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558514628] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579883935] [2023-08-25 21:19:55,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:55,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:55,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:55,900 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:19:55,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 21:19:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:56,037 INFO L262 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 21:19:56,041 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:56,090 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:56,090 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:19:56,124 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:56,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579883935] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:19:56,125 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:19:56,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-25 21:19:56,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559496703] [2023-08-25 21:19:56,125 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:19:56,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 21:19:56,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:56,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 21:19:56,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-25 21:19:56,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 21:19:56,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 104 transitions, 293 flow. Second operand has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:56,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:56,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 21:19:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:56,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 21:19:56,808 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,808 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,808 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 21:19:56,809 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][83], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 99#L48-7true, 533#(and (<= ~N~0 1) (= thread1Thread1of1ForFork1_~i~0 1)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 516#true, 432#L61-6true, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 21:19:56,809 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,809 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,809 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 21:19:56,809 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 21:19:56,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 532#(<= ~N~0 1)]) [2023-08-25 21:19:56,882 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,882 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 21:19:56,882 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,882 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,883 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), 325#L73-4true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 21:19:56,883 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,883 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,883 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 21:19:56,883 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1464] thread1EXIT-->L109-7: Formula: (and (= (let ((.cse0 (mod |v_ULTIMATE.start_main_#t~mem41#1_5| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_#t~mem41#1=|v_ULTIMATE.start_main_#t~mem41#1_5|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][102], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 516#true, Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 440#L109-7true, 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 360#thread2EXITtrue, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0))]) [2023-08-25 21:19:56,884 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,884 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 21:19:56,884 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,884 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,884 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1833] L61-2-->L61-6: Formula: (let ((.cse7 (* |v_thread2Thread1of1ForFork2_~i~1#1_58| 4))) (let ((.cse4 (+ v_~C~0.offset_140 .cse7)) (.cse3 (+ v_~B~0.offset_138 .cse7)) (.cse2 (+ v_~A~0.offset_136 .cse7)) (.cse0 (+ |v_thread2Thread1of1ForFork2_~i~1#1_58| 1)) (.cse1 (+ |v_thread2Thread1of1ForFork2_plus_~a#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|))) (and (= |v_#race~B~0_97| 0) (= |v_#race~A~0_99| 0) (= .cse0 |v_thread2Thread1of1ForFork2_~i~1#1_57|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| (ite (or (<= |v_thread2Thread1of1ForFork2_plus_~b#1_17| 0) (<= .cse1 2147483647)) 1 0)) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| (select (select |v_#memory_int_267| v_~A~0.base_136) .cse2)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| (select (select |v_#memory_int_267| v_~B~0.base_138) .cse3)) (<= 0 (+ |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483648)) (= |v_thread2Thread1of1ForFork2_plus_#in~b#1_17| |v_thread2Thread1of1ForFork2_plus_~b#1_17|) (= (store |v_#memory_int_267| v_~C~0.base_140 (store (select |v_#memory_int_267| v_~C~0.base_140) .cse4 |v_thread2Thread1of1ForFork2_plus_#res#1_17|)) |v_#memory_int_266|) (<= |v_thread2Thread1of1ForFork2_plus_#res#1_17| 2147483647) (= |v_#race_765| (let ((.cse5 (let ((.cse9 (store |v_#race_766| v_~A~0.base_136 (store (store (store (store (select |v_#race_766| v_~A~0.base_136) .cse2 0) (+ v_~A~0.offset_136 .cse7 1) 0) (+ v_~A~0.offset_136 2 .cse7) 0) (+ v_~A~0.offset_136 3 .cse7) 0)))) (store .cse9 v_~B~0.base_138 (store (store (store (store (select .cse9 v_~B~0.base_138) .cse3 0) (+ v_~B~0.offset_138 .cse7 1) 0) (+ v_~B~0.offset_138 2 .cse7) 0) (+ v_~B~0.offset_138 3 .cse7) 0))))) (store .cse5 v_~C~0.base_140 (let ((.cse8 (+ v_~C~0.offset_140 3 .cse7))) (let ((.cse6 (select (select |v_#race_765| v_~C~0.base_140) .cse8))) (store (store (store (store (select .cse5 v_~C~0.base_140) .cse4 .cse6) (+ v_~C~0.offset_140 .cse7 1) .cse6) (+ v_~C~0.offset_140 2 .cse7) .cse6) .cse8 .cse6)))))) (= v_~p~0_45 .cse0) (< |v_thread2Thread1of1ForFork2_~i~1#1_58| v_~N~0_81) (= |v_thread2Thread1of1ForFork2_plus_#in~a#1_17| |v_thread2Thread1of1ForFork2_plus_~a#1_17|) (= |v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17| |v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|) (= |v_thread2Thread1of1ForFork2_plus_#res#1_17| .cse1) (= 0 |v_#race~C~0_145|)))) InVars {#race=|v_#race_766|, ~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_58|, ~C~0.base=v_~C~0.base_140, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_267|, ~N~0=v_~N~0_81, ~B~0.offset=v_~B~0.offset_138} OutVars{~A~0.base=v_~A~0.base_136, ~B~0.base=v_~B~0.base_138, thread2Thread1of1ForFork2_~i~1#1=|v_thread2Thread1of1ForFork2_~i~1#1_57|, thread2Thread1of1ForFork2_plus_~a#1=|v_thread2Thread1of1ForFork2_plus_~a#1_17|, ~C~0.base=v_~C~0.base_140, thread2Thread1of1ForFork2_#t~ret11#1=|v_thread2Thread1of1ForFork2_#t~ret11#1_17|, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_17|, #race~B~0=|v_#race~B~0_97|, thread2Thread1of1ForFork2_#t~nondet13#1=|v_thread2Thread1of1ForFork2_#t~nondet13#1_13|, thread2Thread1of1ForFork2_#t~mem9#1=|v_thread2Thread1of1ForFork2_#t~mem9#1_29|, thread2Thread1of1ForFork2_plus_#res#1=|v_thread2Thread1of1ForFork2_plus_#res#1_17|, thread2Thread1of1ForFork2_plus_~b#1=|v_thread2Thread1of1ForFork2_plus_~b#1_17|, thread2Thread1of1ForFork2_#t~mem10#1=|v_thread2Thread1of1ForFork2_#t~mem10#1_21|, ~B~0.offset=v_~B~0.offset_138, thread2Thread1of1ForFork2_plus_#in~a#1=|v_thread2Thread1of1ForFork2_plus_#in~a#1_17|, thread2Thread1of1ForFork2_#t~nondet12#1=|v_thread2Thread1of1ForFork2_#t~nondet12#1_17|, #race=|v_#race_765|, ~N~0=v_~N~0_81, thread2Thread1of1ForFork2_plus_#in~b#1=|v_thread2Thread1of1ForFork2_plus_#in~b#1_17|, ~A~0.offset=v_~A~0.offset_136, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1_17|, #race~p~0=|v_#race~p~0_58|, ~C~0.offset=v_~C~0.offset_140, #memory_int=|v_#memory_int_266|, thread2Thread1of1ForFork2_#t~post8#1=|v_thread2Thread1of1ForFork2_#t~post8#1_13|, ~p~0=v_~p~0_45, #race~C~0=|v_#race~C~0_145|, #race~A~0=|v_#race~A~0_99|} AuxVars[] AssignedVars[#race, thread2Thread1of1ForFork2_~i~1#1, thread2Thread1of1ForFork2_plus_~a#1, thread2Thread1of1ForFork2_#t~ret11#1, thread2Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork2_plus_#in~b#1, #race~B~0, thread2Thread1of1ForFork2_#t~nondet13#1, thread2Thread1of1ForFork2_#t~mem9#1, thread2Thread1of1ForFork2_plus_#res#1, thread2Thread1of1ForFork2_assume_abort_if_not_~cond#1, #race~p~0, thread2Thread1of1ForFork2_plus_~b#1, #memory_int, thread2Thread1of1ForFork2_#t~mem10#1, thread2Thread1of1ForFork2_#t~post8#1, ~p~0, #race~C~0, thread2Thread1of1ForFork2_plus_#in~a#1, thread2Thread1of1ForFork2_#t~nondet12#1, #race~A~0][84], [501#(= |#race~A~0| 0), 24#L76true, Black: 513#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 1 ~N~0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 492#true, 510#(<= 1 ~N~0), Black: 519#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), Black: 518#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 521#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), Black: 520#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 497#(= |#race~N~0| 0), 40#thread1EXITtrue, 516#true, 432#L61-6true, 532#(<= ~N~0 1), Black: 505#(and (<= 1 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 92#L109-6true]) [2023-08-25 21:19:56,884 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,885 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,885 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-25 21:19:56,885 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-25 21:19:58,136 INFO L124 PetriNetUnfolderBase]: 10452/15700 cut-off events. [2023-08-25 21:19:58,137 INFO L125 PetriNetUnfolderBase]: For 7571/8309 co-relation queries the response was YES. [2023-08-25 21:19:58,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35789 conditions, 15700 events. 10452/15700 cut-off events. For 7571/8309 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 104666 event pairs, 5381 based on Foata normal form. 2/12452 useless extension candidates. Maximal degree in co-relation 35779. Up to 12548 conditions per place. [2023-08-25 21:19:58,218 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 103 selfloop transitions, 22 changer transitions 0/161 dead transitions. [2023-08-25 21:19:58,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 161 transitions, 744 flow [2023-08-25 21:19:58,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 21:19:58,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 21:19:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3408 transitions. [2023-08-25 21:19:58,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3719711853307138 [2023-08-25 21:19:58,226 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3408 transitions. [2023-08-25 21:19:58,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3408 transitions. [2023-08-25 21:19:58,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:58,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3408 transitions. [2023-08-25 21:19:58,232 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 378.6666666666667) internal successors, (3408), 9 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,240 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,240 INFO L175 Difference]: Start difference. First operand has 106 places, 104 transitions, 293 flow. Second operand 9 states and 3408 transitions. [2023-08-25 21:19:58,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 161 transitions, 744 flow [2023-08-25 21:19:58,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 161 transitions, 744 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:19:58,252 INFO L231 Difference]: Finished difference. Result has 118 places, 120 transitions, 448 flow [2023-08-25 21:19:58,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=448, PETRI_PLACES=118, PETRI_TRANSITIONS=120} [2023-08-25 21:19:58,252 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -24 predicate places. [2023-08-25 21:19:58,252 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 120 transitions, 448 flow [2023-08-25 21:19:58,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 368.25) internal successors, (4419), 12 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:58,253 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] [2023-08-25 21:19:58,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-25 21:19:58,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:58,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:19:58,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:19:58,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1391896879, now seen corresponding path program 1 times [2023-08-25 21:19:58,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:19:58,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330212110] [2023-08-25 21:19:58,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:58,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:19:58,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:58,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:58,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:19:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330212110] [2023-08-25 21:19:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330212110] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:19:58,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432373891] [2023-08-25 21:19:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:19:58,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:19:58,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:19:58,671 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:19:58,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 21:19:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:19:58,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 561 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-25 21:19:58,839 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:19:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:58,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:19:58,928 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-25 21:19:58,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432373891] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:19:58,928 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:19:58,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-08-25 21:19:58,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397606526] [2023-08-25 21:19:58,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:19:58,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-25 21:19:58,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:19:58,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-25 21:19:58,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-08-25 21:19:58,932 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 1018 [2023-08-25 21:19:58,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 448 flow. Second operand has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:58,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:19:58,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 1018 [2023-08-25 21:19:58,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:19:59,651 INFO L124 PetriNetUnfolderBase]: 2836/6491 cut-off events. [2023-08-25 21:19:59,651 INFO L125 PetriNetUnfolderBase]: For 1632/1702 co-relation queries the response was YES. [2023-08-25 21:19:59,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12301 conditions, 6491 events. 2836/6491 cut-off events. For 1632/1702 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 54120 event pairs, 1472 based on Foata normal form. 112/5256 useless extension candidates. Maximal degree in co-relation 12286. Up to 3405 conditions per place. [2023-08-25 21:19:59,688 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 69 selfloop transitions, 22 changer transitions 0/152 dead transitions. [2023-08-25 21:19:59,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 152 transitions, 718 flow [2023-08-25 21:19:59,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-25 21:19:59,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-25 21:19:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3634 transitions. [2023-08-25 21:19:59,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39663828858327876 [2023-08-25 21:19:59,696 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 3634 transitions. [2023-08-25 21:19:59,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 3634 transitions. [2023-08-25 21:19:59,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:19:59,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 3634 transitions. [2023-08-25 21:19:59,702 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 403.77777777777777) internal successors, (3634), 9 states have internal predecessors, (3634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:59,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:59,797 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 1018.0) internal successors, (10180), 10 states have internal predecessors, (10180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:59,797 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 448 flow. Second operand 9 states and 3634 transitions. [2023-08-25 21:19:59,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 152 transitions, 718 flow [2023-08-25 21:19:59,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 152 transitions, 690 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-08-25 21:19:59,810 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 489 flow [2023-08-25 21:19:59,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=489, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2023-08-25 21:19:59,811 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -15 predicate places. [2023-08-25 21:19:59,812 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 489 flow [2023-08-25 21:19:59,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 396.0833333333333) internal successors, (4753), 12 states have internal predecessors, (4753), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:19:59,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:19:59,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:19:59,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 21:20:00,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-08-25 21:20:00,021 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:00,021 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:00,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1399204042, now seen corresponding path program 2 times [2023-08-25 21:20:00,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:00,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987363278] [2023-08-25 21:20:00,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:00,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:00,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:00,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:00,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987363278] [2023-08-25 21:20:00,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987363278] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:00,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:00,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:20:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612484133] [2023-08-25 21:20:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:00,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:20:00,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:00,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:20:00,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:20:00,439 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 21:20:00,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 489 flow. Second operand has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:00,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:00,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 21:20:00,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:05,133 INFO L124 PetriNetUnfolderBase]: 32994/46701 cut-off events. [2023-08-25 21:20:05,133 INFO L125 PetriNetUnfolderBase]: For 37782/38322 co-relation queries the response was YES. [2023-08-25 21:20:05,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120330 conditions, 46701 events. 32994/46701 cut-off events. For 37782/38322 co-relation queries the response was YES. Maximal size of possible extension queue 1420. Compared 307531 event pairs, 6905 based on Foata normal form. 280/38880 useless extension candidates. Maximal degree in co-relation 120312. Up to 24395 conditions per place. [2023-08-25 21:20:05,459 INFO L140 encePairwiseOnDemand]: 1002/1018 looper letters, 207 selfloop transitions, 33 changer transitions 0/256 dead transitions. [2023-08-25 21:20:05,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 256 transitions, 1485 flow [2023-08-25 21:20:05,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:20:05,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:20:05,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2378 transitions. [2023-08-25 21:20:05,464 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3893254747871644 [2023-08-25 21:20:05,464 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2378 transitions. [2023-08-25 21:20:05,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2378 transitions. [2023-08-25 21:20:05,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:05,465 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2378 transitions. [2023-08-25 21:20:05,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 396.3333333333333) internal successors, (2378), 6 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:05,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:05,473 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:05,473 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 489 flow. Second operand 6 states and 2378 transitions. [2023-08-25 21:20:05,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 256 transitions, 1485 flow [2023-08-25 21:20:05,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 256 transitions, 1448 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-25 21:20:05,631 INFO L231 Difference]: Finished difference. Result has 131 places, 154 transitions, 798 flow [2023-08-25 21:20:05,631 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=798, PETRI_PLACES=131, PETRI_TRANSITIONS=154} [2023-08-25 21:20:05,632 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -11 predicate places. [2023-08-25 21:20:05,632 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 154 transitions, 798 flow [2023-08-25 21:20:05,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 368.8333333333333) internal successors, (2213), 6 states have internal predecessors, (2213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:05,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:05,632 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] [2023-08-25 21:20:05,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-25 21:20:05,632 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:05,633 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:05,633 INFO L85 PathProgramCache]: Analyzing trace with hash 425666570, now seen corresponding path program 1 times [2023-08-25 21:20:05,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:05,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095823627] [2023-08-25 21:20:05,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:05,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:05,691 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:05,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:05,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095823627] [2023-08-25 21:20:05,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095823627] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:05,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:05,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:20:05,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112621104] [2023-08-25 21:20:05,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:05,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:20:05,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:05,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:20:05,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:20:05,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 1018 [2023-08-25 21:20:05,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 154 transitions, 798 flow. Second operand has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:05,694 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:05,694 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 1018 [2023-08-25 21:20:05,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:08,011 INFO L124 PetriNetUnfolderBase]: 9971/19279 cut-off events. [2023-08-25 21:20:08,011 INFO L125 PetriNetUnfolderBase]: For 42941/45595 co-relation queries the response was YES. [2023-08-25 21:20:08,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55471 conditions, 19279 events. 9971/19279 cut-off events. For 42941/45595 co-relation queries the response was YES. Maximal size of possible extension queue 612. Compared 166181 event pairs, 1634 based on Foata normal form. 106/16100 useless extension candidates. Maximal degree in co-relation 55449. Up to 7026 conditions per place. [2023-08-25 21:20:08,288 INFO L140 encePairwiseOnDemand]: 1013/1018 looper letters, 128 selfloop transitions, 7 changer transitions 0/204 dead transitions. [2023-08-25 21:20:08,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 204 transitions, 1427 flow [2023-08-25 21:20:08,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:20:08,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:20:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1417 transitions. [2023-08-25 21:20:08,291 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4639816633922724 [2023-08-25 21:20:08,291 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1417 transitions. [2023-08-25 21:20:08,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1417 transitions. [2023-08-25 21:20:08,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:08,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1417 transitions. [2023-08-25 21:20:08,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 472.3333333333333) internal successors, (1417), 3 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:08,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:08,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:08,297 INFO L175 Difference]: Start difference. First operand has 131 places, 154 transitions, 798 flow. Second operand 3 states and 1417 transitions. [2023-08-25 21:20:08,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 204 transitions, 1427 flow [2023-08-25 21:20:08,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 204 transitions, 1427 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 21:20:08,325 INFO L231 Difference]: Finished difference. Result has 133 places, 158 transitions, 849 flow [2023-08-25 21:20:08,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=796, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=849, PETRI_PLACES=133, PETRI_TRANSITIONS=158} [2023-08-25 21:20:08,326 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -9 predicate places. [2023-08-25 21:20:08,326 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 158 transitions, 849 flow [2023-08-25 21:20:08,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.0) internal successors, (1368), 3 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:08,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:08,327 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] [2023-08-25 21:20:08,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-25 21:20:08,327 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:08,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 310768637, now seen corresponding path program 1 times [2023-08-25 21:20:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:08,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702025304] [2023-08-25 21:20:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:08,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:08,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:08,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702025304] [2023-08-25 21:20:08,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702025304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:08,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:08,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 21:20:08,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434516473] [2023-08-25 21:20:08,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:08,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 21:20:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 21:20:08,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 21:20:08,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 1018 [2023-08-25 21:20:08,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 158 transitions, 849 flow. Second operand has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:08,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:08,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 1018 [2023-08-25 21:20:08,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:10,705 INFO L124 PetriNetUnfolderBase]: 11468/21453 cut-off events. [2023-08-25 21:20:10,705 INFO L125 PetriNetUnfolderBase]: For 52019/54635 co-relation queries the response was YES. [2023-08-25 21:20:10,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63346 conditions, 21453 events. 11468/21453 cut-off events. For 52019/54635 co-relation queries the response was YES. Maximal size of possible extension queue 715. Compared 183061 event pairs, 4364 based on Foata normal form. 106/18443 useless extension candidates. Maximal degree in co-relation 63323. Up to 14036 conditions per place. [2023-08-25 21:20:10,839 INFO L140 encePairwiseOnDemand]: 1015/1018 looper letters, 88 selfloop transitions, 4 changer transitions 0/156 dead transitions. [2023-08-25 21:20:10,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 156 transitions, 1029 flow [2023-08-25 21:20:10,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 21:20:10,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 21:20:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2023-08-25 21:20:10,842 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544859201047806 [2023-08-25 21:20:10,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1388 transitions. [2023-08-25 21:20:10,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1388 transitions. [2023-08-25 21:20:10,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:10,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1388 transitions. [2023-08-25 21:20:10,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:10,847 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:10,847 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1018.0) internal successors, (4072), 4 states have internal predecessors, (4072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:10,847 INFO L175 Difference]: Start difference. First operand has 133 places, 158 transitions, 849 flow. Second operand 3 states and 1388 transitions. [2023-08-25 21:20:10,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 156 transitions, 1029 flow [2023-08-25 21:20:10,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 156 transitions, 1022 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 21:20:10,880 INFO L231 Difference]: Finished difference. Result has 132 places, 156 transitions, 846 flow [2023-08-25 21:20:10,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=846, PETRI_PLACES=132, PETRI_TRANSITIONS=156} [2023-08-25 21:20:10,881 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -10 predicate places. [2023-08-25 21:20:10,881 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 156 transitions, 846 flow [2023-08-25 21:20:10,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.3333333333333) internal successors, (1360), 3 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:10,881 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:10,882 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] [2023-08-25 21:20:10,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 21:20:10,882 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:10,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:10,882 INFO L85 PathProgramCache]: Analyzing trace with hash -610811521, now seen corresponding path program 2 times [2023-08-25 21:20:10,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:10,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705363662] [2023-08-25 21:20:10,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:10,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:10,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:12,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:12,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:12,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705363662] [2023-08-25 21:20:12,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705363662] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:12,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:12,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-25 21:20:12,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006254924] [2023-08-25 21:20:12,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:12,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-25 21:20:12,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-25 21:20:12,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-08-25 21:20:12,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 1018 [2023-08-25 21:20:12,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 156 transitions, 846 flow. Second operand has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:12,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:12,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 1018 [2023-08-25 21:20:12,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:19,023 INFO L124 PetriNetUnfolderBase]: 45996/63477 cut-off events. [2023-08-25 21:20:19,023 INFO L125 PetriNetUnfolderBase]: For 85499/86534 co-relation queries the response was YES. [2023-08-25 21:20:19,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190491 conditions, 63477 events. 45996/63477 cut-off events. For 85499/86534 co-relation queries the response was YES. Maximal size of possible extension queue 1488. Compared 414899 event pairs, 6116 based on Foata normal form. 1392/55775 useless extension candidates. Maximal degree in co-relation 190467. Up to 21058 conditions per place. [2023-08-25 21:20:19,525 INFO L140 encePairwiseOnDemand]: 1012/1018 looper letters, 384 selfloop transitions, 8 changer transitions 0/407 dead transitions. [2023-08-25 21:20:19,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 407 transitions, 2786 flow [2023-08-25 21:20:19,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-25 21:20:19,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-25 21:20:19,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2635 transitions. [2023-08-25 21:20:19,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36977266348582655 [2023-08-25 21:20:19,530 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 2635 transitions. [2023-08-25 21:20:19,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 2635 transitions. [2023-08-25 21:20:19,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:19,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 2635 transitions. [2023-08-25 21:20:19,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 376.42857142857144) internal successors, (2635), 7 states have internal predecessors, (2635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:19,539 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:19,539 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 1018.0) internal successors, (8144), 8 states have internal predecessors, (8144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:19,540 INFO L175 Difference]: Start difference. First operand has 132 places, 156 transitions, 846 flow. Second operand 7 states and 2635 transitions. [2023-08-25 21:20:19,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 407 transitions, 2786 flow [2023-08-25 21:20:20,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 407 transitions, 2775 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 21:20:20,479 INFO L231 Difference]: Finished difference. Result has 135 places, 155 transitions, 847 flow [2023-08-25 21:20:20,479 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=831, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=847, PETRI_PLACES=135, PETRI_TRANSITIONS=155} [2023-08-25 21:20:20,479 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -7 predicate places. [2023-08-25 21:20:20,480 INFO L495 AbstractCegarLoop]: Abstraction has has 135 places, 155 transitions, 847 flow [2023-08-25 21:20:20,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 343.72727272727275) internal successors, (3781), 11 states have internal predecessors, (3781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:20,480 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:20,480 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] [2023-08-25 21:20:20,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 21:20:20,481 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:20,481 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1111436342, now seen corresponding path program 1 times [2023-08-25 21:20:20,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:20,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405054771] [2023-08-25 21:20:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:20,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-25 21:20:20,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:20,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405054771] [2023-08-25 21:20:20,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405054771] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:20,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:20,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:20:20,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522458799] [2023-08-25 21:20:20,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:20,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:20:20,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:20:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:20:20,942 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 1018 [2023-08-25 21:20:20,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 155 transitions, 847 flow. Second operand has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:20,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:20,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 1018 [2023-08-25 21:20:20,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:27,173 INFO L124 PetriNetUnfolderBase]: 41312/58702 cut-off events. [2023-08-25 21:20:27,174 INFO L125 PetriNetUnfolderBase]: For 100138/100585 co-relation queries the response was YES. [2023-08-25 21:20:27,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179117 conditions, 58702 events. 41312/58702 cut-off events. For 100138/100585 co-relation queries the response was YES. Maximal size of possible extension queue 1397. Compared 389520 event pairs, 20700 based on Foata normal form. 272/50622 useless extension candidates. Maximal degree in co-relation 179094. Up to 52520 conditions per place. [2023-08-25 21:20:27,657 INFO L140 encePairwiseOnDemand]: 1011/1018 looper letters, 173 selfloop transitions, 13 changer transitions 0/205 dead transitions. [2023-08-25 21:20:27,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 205 transitions, 1401 flow [2023-08-25 21:20:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:20:27,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:20:27,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2358 transitions. [2023-08-25 21:20:27,661 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38605108055009824 [2023-08-25 21:20:27,661 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2358 transitions. [2023-08-25 21:20:27,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2358 transitions. [2023-08-25 21:20:27,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:27,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2358 transitions. [2023-08-25 21:20:27,665 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 393.0) internal successors, (2358), 6 states have internal predecessors, (2358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:27,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:27,670 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:27,670 INFO L175 Difference]: Start difference. First operand has 135 places, 155 transitions, 847 flow. Second operand 6 states and 2358 transitions. [2023-08-25 21:20:27,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 205 transitions, 1401 flow [2023-08-25 21:20:27,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 205 transitions, 1387 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-25 21:20:27,823 INFO L231 Difference]: Finished difference. Result has 140 places, 167 transitions, 975 flow [2023-08-25 21:20:27,823 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=833, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=975, PETRI_PLACES=140, PETRI_TRANSITIONS=167} [2023-08-25 21:20:27,824 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, -2 predicate places. [2023-08-25 21:20:27,824 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 167 transitions, 975 flow [2023-08-25 21:20:27,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.3333333333333) internal successors, (2270), 6 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:27,824 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:27,824 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] [2023-08-25 21:20:27,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-25 21:20:27,825 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:27,825 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:27,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1032675538, now seen corresponding path program 1 times [2023-08-25 21:20:27,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:27,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890672631] [2023-08-25 21:20:27,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:27,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:27,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:28,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:28,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890672631] [2023-08-25 21:20:28,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890672631] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:28,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:28,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:20:28,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137328000] [2023-08-25 21:20:28,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:28,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 21:20:28,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:28,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 21:20:28,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:20:28,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-25 21:20:28,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 167 transitions, 975 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:28,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:28,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-25 21:20:28,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:40,729 INFO L124 PetriNetUnfolderBase]: 81953/115395 cut-off events. [2023-08-25 21:20:40,729 INFO L125 PetriNetUnfolderBase]: For 173834/175247 co-relation queries the response was YES. [2023-08-25 21:20:41,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341295 conditions, 115395 events. 81953/115395 cut-off events. For 173834/175247 co-relation queries the response was YES. Maximal size of possible extension queue 1722. Compared 789257 event pairs, 29860 based on Foata normal form. 281/99422 useless extension candidates. Maximal degree in co-relation 341268. Up to 59574 conditions per place. [2023-08-25 21:20:41,852 INFO L140 encePairwiseOnDemand]: 1003/1018 looper letters, 336 selfloop transitions, 66 changer transitions 0/413 dead transitions. [2023-08-25 21:20:41,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 413 transitions, 3315 flow [2023-08-25 21:20:41,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-25 21:20:41,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-25 21:20:41,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 3521 transitions. [2023-08-25 21:20:41,858 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.34587426326129667 [2023-08-25 21:20:41,858 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 3521 transitions. [2023-08-25 21:20:41,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 3521 transitions. [2023-08-25 21:20:41,859 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:20:41,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 3521 transitions. [2023-08-25 21:20:41,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 352.1) internal successors, (3521), 10 states have internal predecessors, (3521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:41,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:41,869 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 1018.0) internal successors, (11198), 11 states have internal predecessors, (11198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:41,869 INFO L175 Difference]: Start difference. First operand has 140 places, 167 transitions, 975 flow. Second operand 10 states and 3521 transitions. [2023-08-25 21:20:41,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 413 transitions, 3315 flow [2023-08-25 21:20:42,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 413 transitions, 3299 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-25 21:20:42,538 INFO L231 Difference]: Finished difference. Result has 153 places, 219 transitions, 1738 flow [2023-08-25 21:20:42,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1738, PETRI_PLACES=153, PETRI_TRANSITIONS=219} [2023-08-25 21:20:42,538 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 11 predicate places. [2023-08-25 21:20:42,539 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 219 transitions, 1738 flow [2023-08-25 21:20:42,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:42,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:20:42,539 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] [2023-08-25 21:20:42,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-25 21:20:42,539 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:20:42,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:20:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1041916758, now seen corresponding path program 2 times [2023-08-25 21:20:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:20:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400112418] [2023-08-25 21:20:42,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:20:42,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:20:42,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:20:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:20:43,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:20:43,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400112418] [2023-08-25 21:20:43,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400112418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:20:43,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:20:43,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-25 21:20:43,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374559866] [2023-08-25 21:20:43,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:20:43,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-25 21:20:43,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:20:43,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-25 21:20:43,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-25 21:20:43,475 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-25 21:20:43,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 219 transitions, 1738 flow. Second operand has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:20:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:20:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-25 21:20:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:20:59,148 INFO L124 PetriNetUnfolderBase]: 98370/137245 cut-off events. [2023-08-25 21:20:59,148 INFO L125 PetriNetUnfolderBase]: For 440278/442197 co-relation queries the response was YES. [2023-08-25 21:21:00,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 476019 conditions, 137245 events. 98370/137245 cut-off events. For 440278/442197 co-relation queries the response was YES. Maximal size of possible extension queue 1864. Compared 931096 event pairs, 19917 based on Foata normal form. 530/119580 useless extension candidates. Maximal degree in co-relation 475987. Up to 73990 conditions per place. [2023-08-25 21:21:00,558 INFO L140 encePairwiseOnDemand]: 1003/1018 looper letters, 309 selfloop transitions, 156 changer transitions 0/476 dead transitions. [2023-08-25 21:21:00,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 476 transitions, 4595 flow [2023-08-25 21:21:00,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-25 21:21:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-25 21:21:00,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3869 transitions. [2023-08-25 21:21:00,563 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.345508126451152 [2023-08-25 21:21:00,563 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 3869 transitions. [2023-08-25 21:21:00,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 3869 transitions. [2023-08-25 21:21:00,565 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:00,565 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 3869 transitions. [2023-08-25 21:21:00,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 351.72727272727275) internal successors, (3869), 11 states have internal predecessors, (3869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:00,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:00,574 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 1018.0) internal successors, (12216), 12 states have internal predecessors, (12216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:00,574 INFO L175 Difference]: Start difference. First operand has 153 places, 219 transitions, 1738 flow. Second operand 11 states and 3869 transitions. [2023-08-25 21:21:00,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 476 transitions, 4595 flow [2023-08-25 21:21:04,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 476 transitions, 4559 flow, removed 9 selfloop flow, removed 4 redundant places. [2023-08-25 21:21:04,891 INFO L231 Difference]: Finished difference. Result has 162 places, 312 transitions, 3565 flow [2023-08-25 21:21:04,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3565, PETRI_PLACES=162, PETRI_TRANSITIONS=312} [2023-08-25 21:21:04,891 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 20 predicate places. [2023-08-25 21:21:04,891 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 312 transitions, 3565 flow [2023-08-25 21:21:04,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 332.3333333333333) internal successors, (2991), 9 states have internal predecessors, (2991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:04,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:04,892 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] [2023-08-25 21:21:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-25 21:21:04,892 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:21:04,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:04,892 INFO L85 PathProgramCache]: Analyzing trace with hash -753888379, now seen corresponding path program 1 times [2023-08-25 21:21:04,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:04,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343088001] [2023-08-25 21:21:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:05,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-08-25 21:21:05,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:05,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343088001] [2023-08-25 21:21:05,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343088001] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:21:05,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 21:21:05,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-25 21:21:05,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092597112] [2023-08-25 21:21:05,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:21:05,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-25 21:21:05,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:05,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-25 21:21:05,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-25 21:21:05,147 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 1018 [2023-08-25 21:21:05,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 312 transitions, 3565 flow. Second operand has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:05,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:05,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 1018 [2023-08-25 21:21:05,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:22,787 INFO L124 PetriNetUnfolderBase]: 101368/141687 cut-off events. [2023-08-25 21:21:22,788 INFO L125 PetriNetUnfolderBase]: For 754446/758804 co-relation queries the response was YES. [2023-08-25 21:21:23,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542891 conditions, 141687 events. 101368/141687 cut-off events. For 754446/758804 co-relation queries the response was YES. Maximal size of possible extension queue 2008. Compared 973907 event pairs, 34607 based on Foata normal form. 3649/126674 useless extension candidates. Maximal degree in co-relation 542855. Up to 103060 conditions per place. [2023-08-25 21:21:24,386 INFO L140 encePairwiseOnDemand]: 1004/1018 looper letters, 380 selfloop transitions, 123 changer transitions 0/520 dead transitions. [2023-08-25 21:21:24,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 520 transitions, 6813 flow [2023-08-25 21:21:24,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 21:21:24,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 21:21:24,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2356 transitions. [2023-08-25 21:21:24,389 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3857236411263916 [2023-08-25 21:21:24,389 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 2356 transitions. [2023-08-25 21:21:24,389 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 2356 transitions. [2023-08-25 21:21:24,390 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:24,390 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 2356 transitions. [2023-08-25 21:21:24,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 392.6666666666667) internal successors, (2356), 6 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:24,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:24,395 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1018.0) internal successors, (7126), 7 states have internal predecessors, (7126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:24,395 INFO L175 Difference]: Start difference. First operand has 162 places, 312 transitions, 3565 flow. Second operand 6 states and 2356 transitions. [2023-08-25 21:21:24,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 520 transitions, 6813 flow [2023-08-25 21:21:37,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 520 transitions, 6335 flow, removed 230 selfloop flow, removed 4 redundant places. [2023-08-25 21:21:37,016 INFO L231 Difference]: Finished difference. Result has 168 places, 424 transitions, 5503 flow [2023-08-25 21:21:37,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=3375, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=5503, PETRI_PLACES=168, PETRI_TRANSITIONS=424} [2023-08-25 21:21:37,017 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 26 predicate places. [2023-08-25 21:21:37,017 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 424 transitions, 5503 flow [2023-08-25 21:21:37,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 370.0) internal successors, (2220), 6 states have internal predecessors, (2220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:37,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:37,017 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] [2023-08-25 21:21:37,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-25 21:21:37,018 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:21:37,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:37,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1070465364, now seen corresponding path program 3 times [2023-08-25 21:21:37,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:37,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715338670] [2023-08-25 21:21:37,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:37,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:21:37,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:21:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:21:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715338670] [2023-08-25 21:21:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715338670] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:21:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939396066] [2023-08-25 21:21:37,177 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-25 21:21:37,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:21:37,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:21:37,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:21:37,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 21:21:37,971 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-08-25 21:21:37,971 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:21:37,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-25 21:21:37,976 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:21:38,079 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:21:38,079 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 21:21:38,151 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-25 21:21:38,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939396066] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 21:21:38,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 21:21:38,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2023-08-25 21:21:38,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469227461] [2023-08-25 21:21:38,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 21:21:38,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-08-25 21:21:38,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:21:38,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-08-25 21:21:38,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-08-25 21:21:38,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 1018 [2023-08-25 21:21:38,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 424 transitions, 5503 flow. Second operand has 17 states, 17 states have (on average 395.8235294117647) internal successors, (6729), 17 states have internal predecessors, (6729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:38,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:21:38,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 1018 [2023-08-25 21:21:38,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:21:50,380 INFO L124 PetriNetUnfolderBase]: 42024/85626 cut-off events. [2023-08-25 21:21:50,380 INFO L125 PetriNetUnfolderBase]: For 922728/950502 co-relation queries the response was YES. [2023-08-25 21:21:51,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331807 conditions, 85626 events. 42024/85626 cut-off events. For 922728/950502 co-relation queries the response was YES. Maximal size of possible extension queue 1935. Compared 927477 event pairs, 10669 based on Foata normal form. 11358/86699 useless extension candidates. Maximal degree in co-relation 331767. Up to 30315 conditions per place. [2023-08-25 21:21:51,687 INFO L140 encePairwiseOnDemand]: 1008/1018 looper letters, 459 selfloop transitions, 211 changer transitions 0/746 dead transitions. [2023-08-25 21:21:51,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 746 transitions, 10955 flow [2023-08-25 21:21:51,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-25 21:21:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-25 21:21:51,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4866 transitions. [2023-08-25 21:21:51,692 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983300589390963 [2023-08-25 21:21:51,692 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 4866 transitions. [2023-08-25 21:21:51,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 4866 transitions. [2023-08-25 21:21:51,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 21:21:51,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 4866 transitions. [2023-08-25 21:21:51,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 405.5) internal successors, (4866), 12 states have internal predecessors, (4866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:51,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 1018.0) internal successors, (13234), 13 states have internal predecessors, (13234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:51,703 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 1018.0) internal successors, (13234), 13 states have internal predecessors, (13234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:51,703 INFO L175 Difference]: Start difference. First operand has 168 places, 424 transitions, 5503 flow. Second operand 12 states and 4866 transitions. [2023-08-25 21:21:51,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 746 transitions, 10955 flow [2023-08-25 21:21:59,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 746 transitions, 10859 flow, removed 48 selfloop flow, removed 0 redundant places. [2023-08-25 21:21:59,727 INFO L231 Difference]: Finished difference. Result has 184 places, 610 transitions, 9653 flow [2023-08-25 21:21:59,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1018, PETRI_DIFFERENCE_MINUEND_FLOW=5407, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=229, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9653, PETRI_PLACES=184, PETRI_TRANSITIONS=610} [2023-08-25 21:21:59,733 INFO L281 CegarLoopForPetriNet]: 142 programPoint places, 42 predicate places. [2023-08-25 21:21:59,733 INFO L495 AbstractCegarLoop]: Abstraction has has 184 places, 610 transitions, 9653 flow [2023-08-25 21:21:59,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 395.8235294117647) internal successors, (6729), 17 states have internal predecessors, (6729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:21:59,733 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 21:21:59,733 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 21:21:59,755 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 21:21:59,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:21:59,941 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 87 more)] === [2023-08-25 21:21:59,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 21:21:59,941 INFO L85 PathProgramCache]: Analyzing trace with hash 691157818, now seen corresponding path program 4 times [2023-08-25 21:21:59,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 21:21:59,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812421838] [2023-08-25 21:21:59,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 21:21:59,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 21:21:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 21:22:01,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-25 21:22:01,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 21:22:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812421838] [2023-08-25 21:22:01,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812421838] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 21:22:01,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351883200] [2023-08-25 21:22:01,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-25 21:22:01,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 21:22:01,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 21:22:01,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 21:22:01,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-25 21:22:01,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-25 21:22:01,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-25 21:22:01,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 773 conjuncts, 64 conjunts are in the unsatisfiable core [2023-08-25 21:22:01,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 21:22:01,490 INFO L322 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2023-08-25 21:22:01,491 INFO L351 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 3 case distinctions, treesize of input 15 treesize of output 42 [2023-08-25 21:22:01,524 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-25 21:22:01,524 INFO L351 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 [2023-08-25 21:22:01,559 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-25 21:22:01,560 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-25 21:22:01,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2023-08-25 21:22:01,772 INFO L351 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 28 treesize of output 27 [2023-08-25 21:22:01,827 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:22:01,827 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2023-08-25 21:22:01,877 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-25 21:22:01,877 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2023-08-25 21:22:01,989 INFO L322 Elim1Store]: treesize reduction 83, result has 36.6 percent of original size [2023-08-25 21:22:01,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 93 treesize of output 116 [2023-08-25 21:22:01,996 INFO L351 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 104 treesize of output 94 [2023-08-25 21:22:06,070 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-08-25 21:22:06,070 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 21:22:06,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351883200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 21:22:06,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 21:22:06,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 24 [2023-08-25 21:22:06,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65259568] [2023-08-25 21:22:06,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 21:22:06,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-25 21:22:06,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 21:22:06,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-25 21:22:06,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=516, Unknown=1, NotChecked=0, Total=650 [2023-08-25 21:22:06,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 1018 [2023-08-25 21:22:06,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 610 transitions, 9653 flow. Second operand has 14 states, 14 states have (on average 331.57142857142856) internal successors, (4642), 14 states have internal predecessors, (4642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-25 21:22:06,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 21:22:06,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 1018 [2023-08-25 21:22:06,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 21:22:12,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:14,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:17,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:19,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:21,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:23,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:25,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:32,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:34,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:37,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:39,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:46,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:48,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:50,984 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-08-25 21:22:55,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]