/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg true -i ../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-29 23:38:52,524 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 23:38:52,601 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-NoLbe.epf [2023-11-29 23:38:52,633 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 23:38:52,633 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 23:38:52,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 23:38:52,635 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 23:38:52,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 23:38:52,635 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 23:38:52,640 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 23:38:52,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 23:38:52,641 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 23:38:52,642 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 23:38:52,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 23:38:52,643 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 23:38:52,643 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 23:38:52,643 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 23:38:52,644 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 23:38:52,644 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 23:38:52,644 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 23:38:52,644 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 23:38:52,645 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 23:38:52,645 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 23:38:52,645 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-29 23:38:52,646 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 23:38:52,647 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:38:52,647 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 23:38:52,647 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 23:38:52,648 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 23:38:52,648 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 23:38:52,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 23:38:52,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 23:38:52,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 23:38:52,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> true [2023-11-29 23:38:52,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 23:38:52,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 23:38:52,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 23:38:52,908 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 23:38:52,909 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 23:38:52,909 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-4.wvr.c [2023-11-29 23:38:54,000 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 23:38:54,199 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 23:38:54,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c [2023-11-29 23:38:54,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5975ac9/64373cd7229d41c3b173b3e026d61766/FLAGf89135570 [2023-11-29 23:38:54,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c5975ac9/64373cd7229d41c3b173b3e026d61766 [2023-11-29 23:38:54,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 23:38:54,224 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-29 23:38:54,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 23:38:54,225 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 23:38:54,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 23:38:54,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,229 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ef25bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54, skipping insertion in model container [2023-11-29 23:38:54,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,253 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 23:38:54,407 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2023-11-29 23:38:54,423 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:38:54,430 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 23:38:54,446 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-4.wvr.c[2598,2611] [2023-11-29 23:38:54,448 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 23:38:54,459 INFO L206 MainTranslator]: Completed translation [2023-11-29 23:38:54,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54 WrapperNode [2023-11-29 23:38:54,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 23:38:54,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 23:38:54,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 23:38:54,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 23:38:54,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,472 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,496 INFO L138 Inliner]: procedures = 24, calls = 36, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 159 [2023-11-29 23:38:54,496 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 23:38:54,497 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 23:38:54,497 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 23:38:54,497 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 23:38:54,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,507 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,508 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,517 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,518 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,538 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 23:38:54,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 23:38:54,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 23:38:54,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 23:38:54,542 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (1/1) ... [2023-11-29 23:38:54,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-29 23:38:54,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:38:54,572 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-11-29 23:38:54,592 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-11-29 23:38:54,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 23:38:54,612 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 23:38:54,612 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 23:38:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 23:38:54,613 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 23:38:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-29 23:38:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 23:38:54,613 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-29 23:38:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 23:38:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 23:38:54,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 23:38:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-29 23:38:54,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 23:38:54,615 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 23:38:54,716 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 23:38:54,718 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 23:38:54,941 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 23:38:54,957 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 23:38:54,957 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 23:38:54,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:38:54 BoogieIcfgContainer [2023-11-29 23:38:54,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 23:38:54,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 23:38:54,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 23:38:54,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 23:38:54,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:38:54" (1/3) ... [2023-11-29 23:38:54,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e54a808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:38:54, skipping insertion in model container [2023-11-29 23:38:54,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:38:54" (2/3) ... [2023-11-29 23:38:54,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e54a808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:38:54, skipping insertion in model container [2023-11-29 23:38:54,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:38:54" (3/3) ... [2023-11-29 23:38:54,964 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-4.wvr.c [2023-11-29 23:38:54,977 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 23:38:54,977 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 23:38:54,977 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 23:38:55,048 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 23:38:55,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 192 places, 201 transitions, 416 flow [2023-11-29 23:38:55,148 INFO L124 PetriNetUnfolderBase]: 16/199 cut-off events. [2023-11-29 23:38:55,149 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:38:55,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 199 events. 16/199 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 176 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-11-29 23:38:55,156 INFO L82 GeneralOperation]: Start removeDead. Operand has 192 places, 201 transitions, 416 flow [2023-11-29 23:38:55,160 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 190 transitions, 392 flow [2023-11-29 23:38:55,169 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 23:38:55,174 INFO L362 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@27c5d63f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 23:38:55,174 INFO L363 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-11-29 23:38:55,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 23:38:55,214 INFO L124 PetriNetUnfolderBase]: 13/158 cut-off events. [2023-11-29 23:38:55,214 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 23:38:55,214 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:55,215 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:55,215 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:55,220 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:55,220 INFO L85 PathProgramCache]: Analyzing trace with hash 643566064, now seen corresponding path program 1 times [2023-11-29 23:38:55,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:55,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360308108] [2023-11-29 23:38:55,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:55,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:38:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:38:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:38:55,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360308108] [2023-11-29 23:38:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360308108] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:38:55,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:38:55,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 23:38:55,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774496260] [2023-11-29 23:38:55,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:38:55,856 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 23:38:55,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:38:55,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 23:38:55,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:38:55,884 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 201 [2023-11-29 23:38:55,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 190 transitions, 392 flow. Second operand has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-29 23:38:55,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:38:55,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 201 [2023-11-29 23:38:55,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:38:56,041 INFO L124 PetriNetUnfolderBase]: 22/300 cut-off events. [2023-11-29 23:38:56,042 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-11-29 23:38:56,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 300 events. 22/300 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 667 event pairs, 9 based on Foata normal form. 37/307 useless extension candidates. Maximal degree in co-relation 227. Up to 55 conditions per place. [2023-11-29 23:38:56,046 INFO L140 encePairwiseOnDemand]: 178/201 looper letters, 49 selfloop transitions, 9 changer transitions 5/181 dead transitions. [2023-11-29 23:38:56,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 181 transitions, 500 flow [2023-11-29 23:38:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 23:38:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 23:38:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1102 transitions. [2023-11-29 23:38:56,061 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6853233830845771 [2023-11-29 23:38:56,062 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1102 transitions. [2023-11-29 23:38:56,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1102 transitions. [2023-11-29 23:38:56,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:38:56,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1102 transitions. [2023-11-29 23:38:56,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 137.75) internal successors, (1102), 8 states have internal predecessors, (1102), 0 states have call successors, (0), 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-11-29 23:38:56,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-11-29 23:38:56,082 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 0 states have call successors, (0), 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-11-29 23:38:56,085 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 7 predicate places. [2023-11-29 23:38:56,085 INFO L500 AbstractCegarLoop]: Abstraction has has 188 places, 181 transitions, 500 flow [2023-11-29 23:38:56,086 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 133.625) internal successors, (1069), 8 states have internal predecessors, (1069), 0 states have call successors, (0), 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-11-29 23:38:56,086 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:56,086 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:56,086 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 23:38:56,087 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:56,087 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:56,087 INFO L85 PathProgramCache]: Analyzing trace with hash 855636614, now seen corresponding path program 1 times [2023-11-29 23:38:56,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:56,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140470968] [2023-11-29 23:38:56,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:56,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:38:56,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:56,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:38:56,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140470968] [2023-11-29 23:38:56,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140470968] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:38:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:38:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 23:38:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480616724] [2023-11-29 23:38:56,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:38:56,386 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 23:38:56,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:38:56,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 23:38:56,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 23:38:56,390 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 201 [2023-11-29 23:38:56,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 181 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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-11-29 23:38:56,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:38:56,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 201 [2023-11-29 23:38:56,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:38:56,680 INFO L124 PetriNetUnfolderBase]: 121/794 cut-off events. [2023-11-29 23:38:56,680 INFO L125 PetriNetUnfolderBase]: For 252/257 co-relation queries the response was YES. [2023-11-29 23:38:56,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1308 conditions, 794 events. 121/794 cut-off events. For 252/257 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4309 event pairs, 38 based on Foata normal form. 0/730 useless extension candidates. Maximal degree in co-relation 993. Up to 138 conditions per place. [2023-11-29 23:38:56,688 INFO L140 encePairwiseOnDemand]: 189/201 looper letters, 77 selfloop transitions, 5 changer transitions 11/218 dead transitions. [2023-11-29 23:38:56,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 218 transitions, 821 flow [2023-11-29 23:38:56,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 23:38:56,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 23:38:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1273 transitions. [2023-11-29 23:38:56,692 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-29 23:38:56,693 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1273 transitions. [2023-11-29 23:38:56,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1273 transitions. [2023-11-29 23:38:56,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:38:56,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1273 transitions. [2023-11-29 23:38:56,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.44444444444446) internal successors, (1273), 9 states have internal predecessors, (1273), 0 states have call successors, (0), 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-11-29 23:38:56,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:38:56,701 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 23:38:56,701 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 15 predicate places. [2023-11-29 23:38:56,702 INFO L500 AbstractCegarLoop]: Abstraction has has 196 places, 218 transitions, 821 flow [2023-11-29 23:38:56,702 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 137.0) internal successors, (822), 6 states have internal predecessors, (822), 0 states have call successors, (0), 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-11-29 23:38:56,703 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:56,703 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:56,703 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 23:38:56,704 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:56,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash -395411964, now seen corresponding path program 1 times [2023-11-29 23:38:56,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617161291] [2023-11-29 23:38:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:56,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:38:56,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:38:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617161291] [2023-11-29 23:38:56,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617161291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:38:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:38:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 23:38:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550225180] [2023-11-29 23:38:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:38:56,937 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:38:56,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:38:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:38:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 23:38:56,941 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2023-11-29 23:38:56,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 218 transitions, 821 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 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-11-29 23:38:56,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:38:56,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2023-11-29 23:38:56,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:38:57,177 INFO L124 PetriNetUnfolderBase]: 238/1248 cut-off events. [2023-11-29 23:38:57,181 INFO L125 PetriNetUnfolderBase]: For 777/805 co-relation queries the response was YES. [2023-11-29 23:38:57,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1248 events. 238/1248 cut-off events. For 777/805 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7631 event pairs, 99 based on Foata normal form. 0/1104 useless extension candidates. Maximal degree in co-relation 1911. Up to 240 conditions per place. [2023-11-29 23:38:57,191 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 31 selfloop transitions, 5 changer transitions 12/231 dead transitions. [2023-11-29 23:38:57,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 231 transitions, 965 flow [2023-11-29 23:38:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:38:57,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:38:57,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2023-11-29 23:38:57,194 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8616915422885573 [2023-11-29 23:38:57,194 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 866 transitions. [2023-11-29 23:38:57,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 866 transitions. [2023-11-29 23:38:57,195 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:38:57,195 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 866 transitions. [2023-11-29 23:38:57,197 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 0 states have call successors, (0), 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-11-29 23:38:57,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-11-29 23:38:57,201 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-11-29 23:38:57,201 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 19 predicate places. [2023-11-29 23:38:57,202 INFO L500 AbstractCegarLoop]: Abstraction has has 200 places, 231 transitions, 965 flow [2023-11-29 23:38:57,202 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 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-11-29 23:38:57,202 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:57,202 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:57,202 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 23:38:57,203 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:57,203 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:57,203 INFO L85 PathProgramCache]: Analyzing trace with hash 1713038918, now seen corresponding path program 2 times [2023-11-29 23:38:57,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:57,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979484914] [2023-11-29 23:38:57,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:57,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:38:57,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:57,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:38:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979484914] [2023-11-29 23:38:57,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979484914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:38:57,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783898060] [2023-11-29 23:38:57,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:38:57,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:38:57,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:38:57,488 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-11-29 23:38:57,518 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-11-29 23:38:57,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:38:57,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:38:57,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 23:38:57,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:38:57,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:57,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 23:38:57,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [783898060] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:38:57,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 23:38:57,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2023-11-29 23:38:57,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138133782] [2023-11-29 23:38:57,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:38:57,709 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:38:57,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:38:57,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:38:57,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 23:38:57,711 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2023-11-29 23:38:57,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 231 transitions, 965 flow. Second operand has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 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-11-29 23:38:57,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:38:57,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2023-11-29 23:38:57,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:38:57,934 INFO L124 PetriNetUnfolderBase]: 272/1421 cut-off events. [2023-11-29 23:38:57,934 INFO L125 PetriNetUnfolderBase]: For 1202/1266 co-relation queries the response was YES. [2023-11-29 23:38:57,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2937 conditions, 1421 events. 272/1421 cut-off events. For 1202/1266 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9143 event pairs, 87 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 2529. Up to 292 conditions per place. [2023-11-29 23:38:57,942 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 45 selfloop transitions, 5 changer transitions 14/247 dead transitions. [2023-11-29 23:38:57,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 247 transitions, 1158 flow [2023-11-29 23:38:57,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:38:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:38:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 703 transitions. [2023-11-29 23:38:57,945 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8743781094527363 [2023-11-29 23:38:57,945 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 703 transitions. [2023-11-29 23:38:57,945 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 703 transitions. [2023-11-29 23:38:57,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:38:57,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 703 transitions. [2023-11-29 23:38:57,946 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-29 23:38:57,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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-11-29 23:38:57,948 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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-11-29 23:38:57,949 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 22 predicate places. [2023-11-29 23:38:57,949 INFO L500 AbstractCegarLoop]: Abstraction has has 203 places, 247 transitions, 1158 flow [2023-11-29 23:38:57,949 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 169.75) internal successors, (679), 4 states have internal predecessors, (679), 0 states have call successors, (0), 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-11-29 23:38:57,949 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:57,950 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:57,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 23:38:58,155 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:38:58,155 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:58,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:58,156 INFO L85 PathProgramCache]: Analyzing trace with hash 866814956, now seen corresponding path program 3 times [2023-11-29 23:38:58,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:58,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755262121] [2023-11-29 23:38:58,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:58,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:38:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:58,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:38:58,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755262121] [2023-11-29 23:38:58,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755262121] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:38:58,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872144568] [2023-11-29 23:38:58,376 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:38:58,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:38:58,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:38:58,377 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-11-29 23:38:58,401 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-11-29 23:38:58,490 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 23:38:58,491 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:38:58,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:38:58,497 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:38:58,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:58,610 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:38:58,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:38:58,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [872144568] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:38:58,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:38:58,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 10 [2023-11-29 23:38:58,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383682447] [2023-11-29 23:38:58,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:38:58,738 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 23:38:58,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:38:58,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 23:38:58,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 23:38:58,741 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 201 [2023-11-29 23:38:58,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 247 transitions, 1158 flow. Second operand has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 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-11-29 23:38:58,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:38:58,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 201 [2023-11-29 23:38:58,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:38:59,549 INFO L124 PetriNetUnfolderBase]: 733/3434 cut-off events. [2023-11-29 23:38:59,549 INFO L125 PetriNetUnfolderBase]: For 3856/4312 co-relation queries the response was YES. [2023-11-29 23:38:59,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7778 conditions, 3434 events. 733/3434 cut-off events. For 3856/4312 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 27813 event pairs, 201 based on Foata normal form. 28/3125 useless extension candidates. Maximal degree in co-relation 6027. Up to 656 conditions per place. [2023-11-29 23:38:59,574 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 166 selfloop transitions, 73 changer transitions 22/440 dead transitions. [2023-11-29 23:38:59,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 440 transitions, 2852 flow [2023-11-29 23:38:59,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 23:38:59,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 23:38:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3436 transitions. [2023-11-29 23:38:59,585 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.854726368159204 [2023-11-29 23:38:59,585 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3436 transitions. [2023-11-29 23:38:59,585 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3436 transitions. [2023-11-29 23:38:59,587 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:38:59,587 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3436 transitions. [2023-11-29 23:38:59,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 171.8) internal successors, (3436), 20 states have internal predecessors, (3436), 0 states have call successors, (0), 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-11-29 23:38:59,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 201.0) internal successors, (4221), 21 states have internal predecessors, (4221), 0 states have call successors, (0), 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-11-29 23:38:59,602 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 201.0) internal successors, (4221), 21 states have internal predecessors, (4221), 0 states have call successors, (0), 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-11-29 23:38:59,604 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 41 predicate places. [2023-11-29 23:38:59,604 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 440 transitions, 2852 flow [2023-11-29 23:38:59,605 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.0) internal successors, (1660), 10 states have internal predecessors, (1660), 0 states have call successors, (0), 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-11-29 23:38:59,605 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:38:59,605 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:38:59,611 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-11-29 23:38:59,811 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:38:59,811 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:38:59,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:38:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1772796134, now seen corresponding path program 4 times [2023-11-29 23:38:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:38:59,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812748775] [2023-11-29 23:38:59,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:38:59,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:38:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:00,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:00,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812748775] [2023-11-29 23:39:00,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812748775] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:00,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352954728] [2023-11-29 23:39:00,095 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 23:39:00,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:00,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:00,098 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-11-29 23:39:00,112 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-11-29 23:39:00,198 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 23:39:00,199 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:00,200 INFO L262 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-29 23:39:00,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:01,041 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:01,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:39:01,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 32 [2023-11-29 23:39:02,963 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:02,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352954728] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:39:02,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:39:02,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 19] total 37 [2023-11-29 23:39:02,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357005021] [2023-11-29 23:39:02,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:39:02,965 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-29 23:39:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:02,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-29 23:39:02,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1194, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 23:39:02,970 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 201 [2023-11-29 23:39:02,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 440 transitions, 2852 flow. Second operand has 37 states, 37 states have (on average 87.78378378378379) internal successors, (3248), 37 states have internal predecessors, (3248), 0 states have call successors, (0), 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-11-29 23:39:02,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:02,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 201 [2023-11-29 23:39:02,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:10,647 INFO L124 PetriNetUnfolderBase]: 12319/26745 cut-off events. [2023-11-29 23:39:10,647 INFO L125 PetriNetUnfolderBase]: For 30336/30578 co-relation queries the response was YES. [2023-11-29 23:39:10,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74971 conditions, 26745 events. 12319/26745 cut-off events. For 30336/30578 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 252885 event pairs, 738 based on Foata normal form. 48/24977 useless extension candidates. Maximal degree in co-relation 62948. Up to 5292 conditions per place. [2023-11-29 23:39:10,802 INFO L140 encePairwiseOnDemand]: 156/201 looper letters, 990 selfloop transitions, 280 changer transitions 242/1583 dead transitions. [2023-11-29 23:39:10,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1583 transitions, 12624 flow [2023-11-29 23:39:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2023-11-29 23:39:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2023-11-29 23:39:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 9252 transitions. [2023-11-29 23:39:10,820 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4468917548181423 [2023-11-29 23:39:10,820 INFO L72 ComplementDD]: Start complementDD. Operand 103 states and 9252 transitions. [2023-11-29 23:39:10,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 9252 transitions. [2023-11-29 23:39:10,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:10,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 103 states and 9252 transitions. [2023-11-29 23:39:10,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 104 states, 103 states have (on average 89.8252427184466) internal successors, (9252), 103 states have internal predecessors, (9252), 0 states have call successors, (0), 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-11-29 23:39:10,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 104 states, 104 states have (on average 201.0) internal successors, (20904), 104 states have internal predecessors, (20904), 0 states have call successors, (0), 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-11-29 23:39:10,902 INFO L81 ComplementDD]: Finished complementDD. Result has 104 states, 104 states have (on average 201.0) internal successors, (20904), 104 states have internal predecessors, (20904), 0 states have call successors, (0), 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-11-29 23:39:10,903 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 143 predicate places. [2023-11-29 23:39:10,903 INFO L500 AbstractCegarLoop]: Abstraction has has 324 places, 1583 transitions, 12624 flow [2023-11-29 23:39:10,904 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 87.78378378378379) internal successors, (3248), 37 states have internal predecessors, (3248), 0 states have call successors, (0), 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-11-29 23:39:10,905 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:10,905 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:39:10,913 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-11-29 23:39:11,105 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:11,106 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:11,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:11,106 INFO L85 PathProgramCache]: Analyzing trace with hash 770404434, now seen corresponding path program 1 times [2023-11-29 23:39:11,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:11,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404465415] [2023-11-29 23:39:11,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:11,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:11,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:11,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:11,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404465415] [2023-11-29 23:39:11,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404465415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 23:39:11,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 23:39:11,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 23:39:11,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929577186] [2023-11-29 23:39:11,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:11,313 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:11,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:11,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:11,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 23:39:11,314 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2023-11-29 23:39:11,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 1583 transitions, 12624 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-29 23:39:11,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:11,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2023-11-29 23:39:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:14,364 INFO L124 PetriNetUnfolderBase]: 12185/26276 cut-off events. [2023-11-29 23:39:14,364 INFO L125 PetriNetUnfolderBase]: For 36288/36466 co-relation queries the response was YES. [2023-11-29 23:39:14,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77442 conditions, 26276 events. 12185/26276 cut-off events. For 36288/36466 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 245781 event pairs, 727 based on Foata normal form. 21/24530 useless extension candidates. Maximal degree in co-relation 65710. Up to 5292 conditions per place. [2023-11-29 23:39:14,513 INFO L140 encePairwiseOnDemand]: 195/201 looper letters, 483 selfloop transitions, 23 changer transitions 264/1577 dead transitions. [2023-11-29 23:39:14,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1577 transitions, 13691 flow [2023-11-29 23:39:14,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 23:39:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 23:39:14,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 891 transitions. [2023-11-29 23:39:14,515 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8865671641791045 [2023-11-29 23:39:14,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 891 transitions. [2023-11-29 23:39:14,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 891 transitions. [2023-11-29 23:39:14,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:14,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 891 transitions. [2023-11-29 23:39:14,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 178.2) internal successors, (891), 5 states have internal predecessors, (891), 0 states have call successors, (0), 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-11-29 23:39:14,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-11-29 23:39:14,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 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-11-29 23:39:14,519 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 147 predicate places. [2023-11-29 23:39:14,519 INFO L500 AbstractCegarLoop]: Abstraction has has 328 places, 1577 transitions, 13691 flow [2023-11-29 23:39:14,519 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-29 23:39:14,519 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:14,519 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:39:14,519 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 23:39:14,519 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:14,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:14,520 INFO L85 PathProgramCache]: Analyzing trace with hash -80598960, now seen corresponding path program 2 times [2023-11-29 23:39:14,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:14,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75476029] [2023-11-29 23:39:14,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:14,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:14,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75476029] [2023-11-29 23:39:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75476029] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746853230] [2023-11-29 23:39:15,023 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:39:15,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:15,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:15,024 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-11-29 23:39:15,033 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-11-29 23:39:15,151 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:39:15,151 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:39:15,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 23:39:15,156 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:15,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:15,256 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:15,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:39:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746853230] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:15,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 23:39:15,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [14, 5] total 15 [2023-11-29 23:39:15,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908504588] [2023-11-29 23:39:15,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 23:39:15,460 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 23:39:15,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:15,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 23:39:15,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-29 23:39:15,461 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 201 [2023-11-29 23:39:15,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1577 transitions, 13691 flow. Second operand has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-29 23:39:15,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:15,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 201 [2023-11-29 23:39:15,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:18,759 INFO L124 PetriNetUnfolderBase]: 12194/26336 cut-off events. [2023-11-29 23:39:18,759 INFO L125 PetriNetUnfolderBase]: For 45809/45993 co-relation queries the response was YES. [2023-11-29 23:39:18,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81293 conditions, 26336 events. 12194/26336 cut-off events. For 45809/45993 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 246523 event pairs, 718 based on Foata normal form. 21/24610 useless extension candidates. Maximal degree in co-relation 69137. Up to 5292 conditions per place. [2023-11-29 23:39:18,908 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 405 selfloop transitions, 142 changer transitions 263/1611 dead transitions. [2023-11-29 23:39:18,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1611 transitions, 15389 flow [2023-11-29 23:39:18,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 23:39:18,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 23:39:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 719 transitions. [2023-11-29 23:39:18,910 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8942786069651741 [2023-11-29 23:39:18,910 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 719 transitions. [2023-11-29 23:39:18,910 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 719 transitions. [2023-11-29 23:39:18,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:39:18,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 719 transitions. [2023-11-29 23:39:18,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 179.75) internal successors, (719), 4 states have internal predecessors, (719), 0 states have call successors, (0), 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-11-29 23:39:18,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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-11-29 23:39:18,913 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 0 states have call successors, (0), 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-11-29 23:39:18,913 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 149 predicate places. [2023-11-29 23:39:18,914 INFO L500 AbstractCegarLoop]: Abstraction has has 330 places, 1611 transitions, 15389 flow [2023-11-29 23:39:18,914 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 175.75) internal successors, (703), 4 states have internal predecessors, (703), 0 states have call successors, (0), 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-11-29 23:39:18,914 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:39:18,914 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:39:18,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 23:39:19,120 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:19,121 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:39:19,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:39:19,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1643371914, now seen corresponding path program 1 times [2023-11-29 23:39:19,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:39:19,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307591478] [2023-11-29 23:39:19,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:19,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:39:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:19,383 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:39:19,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:39:19,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307591478] [2023-11-29 23:39:19,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307591478] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:39:19,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753826927] [2023-11-29 23:39:19,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:39:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:39:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:39:19,385 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:39:19,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 23:39:19,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:39:19,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-29 23:39:19,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:39:21,193 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:21,194 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:39:22,187 INFO L349 Elim1Store]: treesize reduction 5, result has 91.8 percent of original size [2023-11-29 23:39:22,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 75 [2023-11-29 23:39:23,058 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:39:23,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753826927] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:39:23,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:39:23,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 29, 25] total 55 [2023-11-29 23:39:23,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312520448] [2023-11-29 23:39:23,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:39:23,060 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-11-29 23:39:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:39:23,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-11-29 23:39:23,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2736, Unknown=0, NotChecked=0, Total=2970 [2023-11-29 23:39:23,064 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 201 [2023-11-29 23:39:23,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 1611 transitions, 15389 flow. Second operand has 55 states, 55 states have (on average 68.45454545454545) internal successors, (3765), 55 states have internal predecessors, (3765), 0 states have call successors, (0), 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-11-29 23:39:23,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:39:23,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 201 [2023-11-29 23:39:23,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:39:26,680 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [111#L37-1true, thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:26,680 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,680 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,680 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,680 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 33#L37-1true, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:26,681 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,681 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][396], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 2197#(and (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), thread2Thread1of1ForFork1InUse, 23#L38-1true]) [2023-11-29 23:39:26,682 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,682 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,682 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:26,682 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is cut-off event [2023-11-29 23:39:27,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][397], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,038 INFO L294 olderBase$Statistics]: this new event has 100 ancestors and is not cut-off event [2023-11-29 23:39:27,038 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-11-29 23:39:27,038 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-11-29 23:39:27,038 INFO L297 olderBase$Statistics]: existing Event has 100 ancestors and is not cut-off event [2023-11-29 23:39:27,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,039 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,039 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,039 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,040 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,042 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,043 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,043 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,043 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,043 INFO L294 olderBase$Statistics]: this new event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 101 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,044 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,044 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,444 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,444 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,444 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,444 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,445 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,445 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][304], [thread1Thread1of1ForFork0InUse, 4461#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 2219#(and (= |thread1Thread1of1ForFork0_#t~mem1#1| (select (select |#memory_int| ~f~0.base) ~f~0.offset)) (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,449 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][303], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 4500#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= (select (select |#memory_int| ~f~0.base) 0) |thread2Thread1of1ForFork1_#t~mem3#1|) (<= ~size~0 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0) (= ~f~0.offset 0) (= 0 |ULTIMATE.start_create_fresh_int_array_#res#1.offset|)), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2182#(and (= ~x1~0 0) (<= ~size~0 1) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:27,449 INFO L294 olderBase$Statistics]: this new event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,449 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,450 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:27,450 INFO L297 olderBase$Statistics]: existing Event has 102 ancestors and is cut-off event [2023-11-29 23:39:29,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 33#L37-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,028 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,028 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,028 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,028 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [111#L37-1true, thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,029 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,029 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,029 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,029 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,029 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][795], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 2250#(and (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse, 23#L38-1true]) [2023-11-29 23:39:29,029 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,030 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,030 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,030 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 111#L37-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,034 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 33#L37-1true, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,034 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,034 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,035 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,035 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][800], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse, 23#L38-1true, 2252#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (or (= (select (select |#memory_int| ~f~0.base) ~f~0.offset) 0) (= |thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1| 0)) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0))]) [2023-11-29 23:39:29,035 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,035 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,035 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,035 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is cut-off event [2023-11-29 23:39:29,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][794], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,361 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,361 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,361 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,361 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,362 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,362 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,362 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,362 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,362 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,364 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,365 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,365 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,365 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,366 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,366 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,366 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][801], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 133#L38-1true, 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,367 INFO L294 olderBase$Statistics]: this new event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 108 ancestors and is not cut-off event [2023-11-29 23:39:29,367 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,367 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,367 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,368 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,368 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,368 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,368 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,368 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,371 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 25#L50-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,371 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,371 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,371 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,371 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,371 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,372 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,372 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 101#L60-2true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,372 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,372 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,373 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,373 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,781 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,781 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,782 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,782 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,782 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,782 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,782 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,784 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][687], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 47#L61-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 13#L51true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,785 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][686], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 1311#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= 1 (mod ~n~0 1073741824)) (= |thread2Thread1of1ForFork1_~i~1#1| 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 2204#(and (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 199#(<= 1 ~size~0), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,785 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,785 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,787 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,788 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,788 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,789 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,789 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,789 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,789 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,789 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,789 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,794 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([504] L61-->L61-1: Formula: (= (select (select |v_#memory_int_2| v_~f~0.base_2) (+ (* v_~x2~0_2 4) v_~f~0.offset_2)) |v_thread2Thread1of1ForFork1_#t~mem3#1_1|) InVars {#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2} OutVars{#memory_int=|v_#memory_int_2|, ~x2~0=v_~x2~0_2, ~f~0.base=v_~f~0.base_2, ~f~0.offset=v_~f~0.offset_2, thread2Thread1of1ForFork1_#t~mem3#1=|v_thread2Thread1of1ForFork1_#t~mem3#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem3#1][689], [thread1Thread1of1ForFork0InUse, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 37#L90-1true, 491#(<= 1 (mod ~n~0 1073741824)), 47#L61-1true, 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 13#L51true, 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,794 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,794 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][690], [thread1Thread1of1ForFork0InUse, 37#L90-1true, 2215#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (= |thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 491#(<= 1 (mod ~n~0 1073741824)), 2347#(= |thread1Thread1of1ForFork0_~i~0#1| 0), 219#(and (= ~x1~0 0) (= ~x2~0 0)), 4468#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (= ~x1~0 0) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0) (= ~x2~0 0)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 4#L51-1true, 231#(= |thread2Thread1of1ForFork1_~i~1#1| 0), 199#(<= 1 ~size~0), 1313#(and (= |thread1Thread1of1ForFork0_~i~0#1| 0) (<= (+ (mod |thread2Thread1of1ForFork1_~i~1#1| 4294967296) 1) (* (mod ~n~0 1073741824) 4))), 144#L61true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:29,795 INFO L294 olderBase$Statistics]: this new event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:29,795 INFO L297 olderBase$Statistics]: existing Event has 110 ancestors and is cut-off event [2023-11-29 23:39:36,056 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 145#L37-3true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:36,056 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is cut-off event [2023-11-29 23:39:36,056 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:39:36,056 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:39:36,056 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2023-11-29 23:39:36,566 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][2072], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 199#(<= 1 ~size~0), 12#L38-4true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:36,566 INFO L294 olderBase$Statistics]: this new event has 125 ancestors and is not cut-off event [2023-11-29 23:39:36,566 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:39:36,566 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:39:36,566 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is not cut-off event [2023-11-29 23:39:36,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 62#L63-2true, 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:36,570 INFO L294 olderBase$Statistics]: this new event has 126 ancestors and is cut-off event [2023-11-29 23:39:36,570 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 23:39:36,570 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 23:39:36,570 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([518] L64-->L64-1: Formula: (= (select (select |v_#memory_int_3| v_~f~0.base_3) (+ v_~f~0.offset_3 (* v_~x2~0_5 4))) |v_thread2Thread1of1ForFork1_#t~mem5#1_1|) InVars {#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_5, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} OutVars{#memory_int=|v_#memory_int_3|, ~x2~0=v_~x2~0_5, thread2Thread1of1ForFork1_#t~mem5#1=|v_thread2Thread1of1ForFork1_#t~mem5#1_1|, ~f~0.base=v_~f~0.base_3, ~f~0.offset=v_~f~0.offset_3} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_#t~mem5#1][1958], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 71#L64-1true, 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 13#L51true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:37,459 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([483] L51-->L51-1: Formula: (= (select (select |v_#memory_int_1| v_~f~0.base_1) (+ (* v_~x1~0_2 4) v_~f~0.offset_1)) |v_thread1Thread1of1ForFork0_#t~mem1#1_1|) InVars {#memory_int=|v_#memory_int_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} OutVars{#memory_int=|v_#memory_int_1|, thread1Thread1of1ForFork0_#t~mem1#1=|v_thread1Thread1of1ForFork0_#t~mem1#1_1|, ~x1~0=v_~x1~0_2, ~f~0.base=v_~f~0.base_1, ~f~0.offset=v_~f~0.offset_1} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~mem1#1][846], [4487#(and (= |thread1Thread1of1ForFork0_~i~0#1| 1) (<= (+ (* 1073741824 (div ~n~0 1073741824)) 1) ~n~0)), thread1Thread1of1ForFork0InUse, 37#L90-1true, 229#true, 491#(<= 1 (mod ~n~0 1073741824)), 2877#(< (mod |thread1Thread1of1ForFork0_~i~0#1| 4294967296) (* (mod ~n~0 1073741824) 4)), 1334#true, 4#L51-1true, 199#(<= 1 ~size~0), 601#(and (<= (+ |thread1Thread1of1ForFork0_~i~0#1| (* 4294967296 (div ~n~0 1073741824)) 3) (* ~n~0 4)) (<= 0 (div |thread1Thread1of1ForFork0_~i~0#1| 4294967296))), 2345#true, 178#L64true, 212#true, thread2Thread1of1ForFork1InUse]) [2023-11-29 23:39:37,459 INFO L294 olderBase$Statistics]: this new event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:39:37,459 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2023-11-29 23:40:34,246 INFO L124 PetriNetUnfolderBase]: 70877/134250 cut-off events. [2023-11-29 23:40:34,246 INFO L125 PetriNetUnfolderBase]: For 266742/267254 co-relation queries the response was YES. [2023-11-29 23:40:34,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 482455 conditions, 134250 events. 70877/134250 cut-off events. For 266742/267254 co-relation queries the response was YES. Maximal size of possible extension queue 1571. Compared 1375121 event pairs, 4964 based on Foata normal form. 72/125469 useless extension candidates. Maximal degree in co-relation 438093. Up to 62016 conditions per place. [2023-11-29 23:40:35,384 INFO L140 encePairwiseOnDemand]: 129/201 looper letters, 5322 selfloop transitions, 1950 changer transitions 1348/8977 dead transitions. [2023-11-29 23:40:35,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 907 places, 8977 transitions, 74726 flow [2023-11-29 23:40:35,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 578 states. [2023-11-29 23:40:35,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2023-11-29 23:40:35,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 41615 transitions. [2023-11-29 23:40:35,438 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.35820034774225756 [2023-11-29 23:40:35,438 INFO L72 ComplementDD]: Start complementDD. Operand 578 states and 41615 transitions. [2023-11-29 23:40:35,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 41615 transitions. [2023-11-29 23:40:35,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:40:35,451 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 578 states and 41615 transitions. [2023-11-29 23:40:35,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 579 states, 578 states have (on average 71.99826989619378) internal successors, (41615), 578 states have internal predecessors, (41615), 0 states have call successors, (0), 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-11-29 23:40:35,641 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 579 states, 579 states have (on average 201.0) internal successors, (116379), 579 states have internal predecessors, (116379), 0 states have call successors, (0), 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-11-29 23:40:35,682 INFO L81 ComplementDD]: Finished complementDD. Result has 579 states, 579 states have (on average 201.0) internal successors, (116379), 579 states have internal predecessors, (116379), 0 states have call successors, (0), 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-11-29 23:40:35,684 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 726 predicate places. [2023-11-29 23:40:35,684 INFO L500 AbstractCegarLoop]: Abstraction has has 907 places, 8977 transitions, 74726 flow [2023-11-29 23:40:35,685 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 68.45454545454545) internal successors, (3765), 55 states have internal predecessors, (3765), 0 states have call successors, (0), 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-11-29 23:40:35,685 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:40:35,685 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:40:35,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 23:40:35,891 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:40:35,891 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:40:35,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:40:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1976641498, now seen corresponding path program 2 times [2023-11-29 23:40:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:40:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299783889] [2023-11-29 23:40:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:40:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:40:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:40:36,827 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 23:40:36,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:40:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299783889] [2023-11-29 23:40:36,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299783889] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:40:36,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931653739] [2023-11-29 23:40:36,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 23:40:36,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:40:36,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:40:36,832 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:40:36,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 23:40:36,965 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 23:40:36,965 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:40:36,967 INFO L262 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 61 conjunts are in the unsatisfiable core [2023-11-29 23:40:36,971 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:40:37,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 23:40:37,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 23:40:38,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 23:40:38,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-29 23:40:39,056 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:40:39,056 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:40:43,092 WARN L854 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_193))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_main_#t~ret13#1.base|))) (let ((.cse0 (select .cse2 (+ (* c_~x1~0 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)))) (or (< c_~size~0 (+ ~x2~0 1)) (< .cse0 0) (< c_~size~0 (+ .cse0 1)) (< ~x2~0 0) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_main_#t~ret13#1.base|))) (= (select .cse1 (+ |c_ULTIMATE.start_main_#t~ret13#1.offset| (* ~x2~0 4))) (select .cse1 (+ (* (select .cse2 (+ (* .cse0 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret13#1.offset|))))))))) is different from false [2023-11-29 23:40:43,257 WARN L854 $PredicateComparison]: unable to prove that (forall ((~x2~0 Int) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_194 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_193))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse0 (select .cse2 (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~size~0 (+ .cse0 1)) (< c_~size~0 (+ ~x2~0 1)) (< ~x2~0 0) (< .cse0 0) (let ((.cse1 (select (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_194) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (= (select .cse1 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse1 (+ (* (select .cse2 (+ (* .cse0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) is different from false [2023-11-29 23:40:43,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:40:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 96 [2023-11-29 23:40:43,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:40:43,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 692 treesize of output 628 [2023-11-29 23:40:43,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:40:43,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 263 treesize of output 223 [2023-11-29 23:40:43,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 23:40:43,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 45 [2023-11-29 23:40:45,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 41 refuted. 3 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 23:40:45,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931653739] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:40:45,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:40:45,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 33, 31] total 77 [2023-11-29 23:40:45,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069467774] [2023-11-29 23:40:45,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:40:45,170 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2023-11-29 23:40:45,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:40:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2023-11-29 23:40:45,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=5194, Unknown=31, NotChecked=294, Total=5852 [2023-11-29 23:40:45,176 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 201 [2023-11-29 23:40:45,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 907 places, 8977 transitions, 74726 flow. Second operand has 77 states, 77 states have (on average 43.01298701298701) internal successors, (3312), 77 states have internal predecessors, (3312), 0 states have call successors, (0), 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-11-29 23:40:45,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:40:45,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 201 [2023-11-29 23:40:45,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 23:40:48,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:50,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:52,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:57,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:40:59,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:01,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:02,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:04,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:05,804 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:07,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:09,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:11,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:13,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:16,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:19,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:20,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:22,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:41:27,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 23:46:27,005 INFO L124 PetriNetUnfolderBase]: 153974/269943 cut-off events. [2023-11-29 23:46:27,005 INFO L125 PetriNetUnfolderBase]: For 515846/516878 co-relation queries the response was YES. [2023-11-29 23:46:27,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201258 conditions, 269943 events. 153974/269943 cut-off events. For 515846/516878 co-relation queries the response was YES. Maximal size of possible extension queue 3074. Compared 2792386 event pairs, 3477 based on Foata normal form. 154/255684 useless extension candidates. Maximal degree in co-relation 963505. Up to 131734 conditions per place. [2023-11-29 23:46:29,207 INFO L140 encePairwiseOnDemand]: 107/201 looper letters, 18877 selfloop transitions, 5821 changer transitions 5711/30515 dead transitions. [2023-11-29 23:46:29,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1863 places, 30515 transitions, 288352 flow [2023-11-29 23:46:29,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 957 states. [2023-11-29 23:46:29,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 957 states. [2023-11-29 23:46:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 957 states to 957 states and 45302 transitions. [2023-11-29 23:46:29,270 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.2355100152320945 [2023-11-29 23:46:29,271 INFO L72 ComplementDD]: Start complementDD. Operand 957 states and 45302 transitions. [2023-11-29 23:46:29,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 957 states and 45302 transitions. [2023-11-29 23:46:29,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 23:46:29,285 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 957 states and 45302 transitions. [2023-11-29 23:46:29,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 958 states, 957 states have (on average 47.337513061650995) internal successors, (45302), 957 states have internal predecessors, (45302), 0 states have call successors, (0), 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-11-29 23:46:29,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 958 states, 958 states have (on average 201.0) internal successors, (192558), 958 states have internal predecessors, (192558), 0 states have call successors, (0), 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-11-29 23:46:29,522 INFO L81 ComplementDD]: Finished complementDD. Result has 958 states, 958 states have (on average 201.0) internal successors, (192558), 958 states have internal predecessors, (192558), 0 states have call successors, (0), 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-11-29 23:46:29,523 INFO L307 CegarLoopForPetriNet]: 181 programPoint places, 1682 predicate places. [2023-11-29 23:46:29,523 INFO L500 AbstractCegarLoop]: Abstraction has has 1863 places, 30515 transitions, 288352 flow [2023-11-29 23:46:29,524 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 43.01298701298701) internal successors, (3312), 77 states have internal predecessors, (3312), 0 states have call successors, (0), 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-11-29 23:46:29,524 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-29 23:46:29,525 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-29 23:46:29,536 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-29 23:46:29,730 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:46:29,731 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-11-29 23:46:29,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 23:46:29,731 INFO L85 PathProgramCache]: Analyzing trace with hash -781829108, now seen corresponding path program 3 times [2023-11-29 23:46:29,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 23:46:29,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429396178] [2023-11-29 23:46:29,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 23:46:29,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 23:46:29,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 23:46:30,060 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:46:30,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 23:46:30,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429396178] [2023-11-29 23:46:30,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429396178] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 23:46:30,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429320698] [2023-11-29 23:46:30,061 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 23:46:30,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:46:30,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-29 23:46:30,062 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 23:46:30,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 23:46:30,275 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-11-29 23:46:30,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 23:46:30,277 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 23:46:30,279 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 23:46:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:46:30,619 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 23:46:30,957 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 23:46:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429320698] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 23:46:30,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 23:46:30,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2023-11-29 23:46:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843449410] [2023-11-29 23:46:30,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 23:46:30,958 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 23:46:30,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 23:46:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 23:46:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=472, Unknown=0, NotChecked=0, Total=552 [2023-11-29 23:46:30,962 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 201 [2023-11-29 23:46:30,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1863 places, 30515 transitions, 288352 flow. Second operand has 24 states, 24 states have (on average 174.29166666666666) internal successors, (4183), 24 states have internal predecessors, (4183), 0 states have call successors, (0), 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-11-29 23:46:30,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 23:46:30,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 201 [2023-11-29 23:46:30,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-29 23:51:26,836 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:51:26,836 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-29 23:51:27,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 23:51:27,432 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-11-29 23:51:27,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-29 23:51:27,633 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 23:51:27,633 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 172/201 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 913648 conditions, 198209 events (113774/198208 cut-off events. For 443747/444212 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 2103516 event pairs, 2200 based on Foata normal form. 14/192056 useless extension candidates. Maximal degree in co-relation 698076. Up to 71170 conditions per place.). [2023-11-29 23:51:27,635 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-11-29 23:51:27,635 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-11-29 23:51:27,635 INFO L457 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2023-11-29 23:51:27,639 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 23:51:27,639 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 23:51:27,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:51:27 BasicIcfg [2023-11-29 23:51:27,642 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 23:51:27,642 INFO L158 Benchmark]: Toolchain (without parser) took 753418.62ms. Allocated memory was 352.3MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 299.6MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-11-29 23:51:27,643 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 302.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-29 23:51:27,643 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.12ms. Allocated memory is still 352.3MB. Free memory was 299.6MB in the beginning and 288.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-29 23:51:27,643 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.05ms. Allocated memory is still 352.3MB. Free memory was 288.2MB in the beginning and 286.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:51:27,643 INFO L158 Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 352.3MB. Free memory was 286.1MB in the beginning and 284.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-29 23:51:27,643 INFO L158 Benchmark]: RCFGBuilder took 416.87ms. Allocated memory is still 352.3MB. Free memory was 284.0MB in the beginning and 265.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2023-11-29 23:51:27,644 INFO L158 Benchmark]: TraceAbstraction took 752682.10ms. Allocated memory was 352.3MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 263.9MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. [2023-11-29 23:51:27,645 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 352.3MB. Free memory is still 302.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 235.12ms. Allocated memory is still 352.3MB. Free memory was 299.6MB in the beginning and 288.2MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 36.05ms. Allocated memory is still 352.3MB. Free memory was 288.2MB in the beginning and 286.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.44ms. Allocated memory is still 352.3MB. Free memory was 286.1MB in the beginning and 284.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 416.87ms. Allocated memory is still 352.3MB. Free memory was 284.0MB in the beginning and 265.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 752682.10ms. Allocated memory was 352.3MB in the beginning and 7.7GB in the end (delta: 7.4GB). Free memory was 263.9MB in the beginning and 3.0GB in the end (delta: -2.7GB). Peak memory consumption was 5.6GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 172/201 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 913648 conditions, 198209 events (113774/198208 cut-off events. For 443747/444212 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 2103516 event pairs, 2200 based on Foata normal form. 14/192056 useless extension candidates. Maximal degree in co-relation 698076. Up to 71170 conditions per place.). - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 172/201 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 913648 conditions, 198209 events (113774/198208 cut-off events. For 443747/444212 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 2103516 event pairs, 2200 based on Foata normal form. 14/192056 useless extension candidates. Maximal degree in co-relation 698076. Up to 71170 conditions per place.). - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 172/201 universal loopers) in iteration 11,while PetriNetUnfolder was constructing finite prefix that currently has 913648 conditions, 198209 events (113774/198208 cut-off events. For 443747/444212 co-relation queries the response was YES. Maximal size of possible extension queue 3608. Compared 2103516 event pairs, 2200 based on Foata normal form. 14/192056 useless extension candidates. Maximal degree in co-relation 698076. Up to 71170 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 265 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 752.6s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 729.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 49 mSolverCounterUnknown, 22538 SdHoareTripleChecker+Valid, 88.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22538 mSDsluCounter, 72909 SdHoareTripleChecker+Invalid, 83.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 19587 IncrementalHoareTripleChecker+Unchecked, 70542 mSDsCounter, 1127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 68586 IncrementalHoareTripleChecker+Invalid, 89349 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1127 mSolverCounterUnsat, 2367 mSDtfsCounter, 68586 mSolverCounterSat, 0.4s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4308 GetRequests, 2452 SyntacticMatches, 4 SemanticMatches, 1852 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 634667 ImplicationChecksByTransitivity, 126.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288352occurred in iteration=10, InterpolantAutomatonStates: 1693, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 19.4s InterpolantComputationTime, 2648 NumberOfCodeBlocks, 2583 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3593 ConstructedInterpolants, 138 QuantifiedInterpolants, 29365 SizeOfPredicates, 111 NumberOfNonLiveVariables, 2082 ConjunctsInSsa, 180 ConjunctsInUnsatCore, 24 InterpolantComputations, 6 PerfectInterpolantSequences, 34/384 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown