/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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 09:57:04,455 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 09:57:04,526 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-30 09:57:04,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 09:57:04,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 09:57:04,552 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 09:57:04,552 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 09:57:04,553 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 09:57:04,553 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 09:57:04,555 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 09:57:04,555 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 09:57:04,555 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 09:57:04,556 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 09:57:04,556 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 09:57:04,556 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 09:57:04,556 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 09:57:04,556 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 09:57:04,557 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 09:57:04,557 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 09:57:04,557 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 09:57:04,557 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 09:57:04,558 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 09:57:04,558 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 09:57:04,560 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 09:57:04,560 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 09:57:04,560 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:57:04,560 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 09:57:04,560 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 09:57:04,560 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 09:57:04,561 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 09:57:04,561 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 09:57:04,561 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 09:57:04,561 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 09:57:04,561 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-11-30 09:57:04,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 09:57:04,715 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 09:57:04,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 09:57:04,717 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 09:57:04,718 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 09:57:04,719 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2023-11-30 09:57:05,606 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 09:57:05,760 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 09:57:05,761 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-queue-add-2.wvr.c [2023-11-30 09:57:05,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256d26b31/443a972a7b44438197f8f4d5e52f2175/FLAG2d0126ab7 [2023-11-30 09:57:05,774 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/256d26b31/443a972a7b44438197f8f4d5e52f2175 [2023-11-30 09:57:05,775 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 09:57:05,776 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 09:57:05,777 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 09:57:05,777 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 09:57:05,779 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 09:57:05,780 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,780 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2704a13e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05, skipping insertion in model container [2023-11-30 09:57:05,781 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,794 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 09:57:05,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:57:05,916 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 09:57:05,932 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:57:05,937 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:57:05,937 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:57:05,944 INFO L206 MainTranslator]: Completed translation [2023-11-30 09:57:05,944 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05 WrapperNode [2023-11-30 09:57:05,944 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 09:57:05,945 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 09:57:05,945 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 09:57:05,945 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 09:57:05,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,960 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,976 INFO L138 Inliner]: procedures = 24, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 175 [2023-11-30 09:57:05,976 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 09:57:05,977 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 09:57:05,977 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 09:57:05,977 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 09:57:05,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,985 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,985 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,991 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,994 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,995 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,995 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:05,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 09:57:05,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 09:57:05,998 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 09:57:05,998 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 09:57:05,998 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (1/1) ... [2023-11-30 09:57:06,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:57:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:06,018 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-30 09:57:06,063 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-30 09:57:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 09:57:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 09:57:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 09:57:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 09:57:06,078 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 09:57:06,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 09:57:06,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 09:57:06,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 09:57:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 09:57:06,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 09:57:06,081 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-30 09:57:06,174 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 09:57:06,176 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 09:57:06,417 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 09:57:06,522 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 09:57:06,523 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 09:57:06,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:57:06 BoogieIcfgContainer [2023-11-30 09:57:06,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 09:57:06,527 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 09:57:06,527 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 09:57:06,529 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 09:57:06,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 09:57:05" (1/3) ... [2023-11-30 09:57:06,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ec185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:57:06, skipping insertion in model container [2023-11-30 09:57:06,529 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:57:05" (2/3) ... [2023-11-30 09:57:06,530 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@495ec185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:57:06, skipping insertion in model container [2023-11-30 09:57:06,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:57:06" (3/3) ... [2023-11-30 09:57:06,531 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2023-11-30 09:57:06,543 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 09:57:06,543 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 09:57:06,543 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 09:57:06,632 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 09:57:06,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 334 flow [2023-11-30 09:57:06,740 INFO L124 PetriNetUnfolderBase]: 11/158 cut-off events. [2023-11-30 09:57:06,740 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 09:57:06,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 158 events. 11/158 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 145 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 114. Up to 3 conditions per place. [2023-11-30 09:57:06,744 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 160 transitions, 334 flow [2023-11-30 09:57:06,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 133 places, 136 transitions, 281 flow [2023-11-30 09:57:06,761 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 09:57:06,768 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;@d99603d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 09:57:06,768 INFO L363 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-30 09:57:06,781 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 09:57:06,781 INFO L124 PetriNetUnfolderBase]: 3/66 cut-off events. [2023-11-30 09:57:06,781 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 09:57:06,781 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:06,782 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] [2023-11-30 09:57:06,782 INFO L425 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:06,785 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:06,785 INFO L85 PathProgramCache]: Analyzing trace with hash 196295549, now seen corresponding path program 1 times [2023-11-30 09:57:06,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:06,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464810778] [2023-11-30 09:57:06,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:06,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:07,030 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-30 09:57:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:07,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464810778] [2023-11-30 09:57:07,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464810778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:07,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:57:07,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:57:07,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712072332] [2023-11-30 09:57:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:07,038 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:57:07,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:07,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:57:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:57:07,058 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2023-11-30 09:57:07,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 136 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:07,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:07,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2023-11-30 09:57:07,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:07,182 INFO L124 PetriNetUnfolderBase]: 30/218 cut-off events. [2023-11-30 09:57:07,182 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-30 09:57:07,184 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 218 events. 30/218 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 541 event pairs, 14 based on Foata normal form. 16/190 useless extension candidates. Maximal degree in co-relation 166. Up to 65 conditions per place. [2023-11-30 09:57:07,186 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 27 selfloop transitions, 5 changer transitions 3/135 dead transitions. [2023-11-30 09:57:07,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 135 transitions, 343 flow [2023-11-30 09:57:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:57:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:57:07,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-11-30 09:57:07,201 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.83125 [2023-11-30 09:57:07,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-11-30 09:57:07,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-11-30 09:57:07,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:07,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-11-30 09:57:07,210 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 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-30 09:57:07,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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-30 09:57:07,217 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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-30 09:57:07,220 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1 predicate places. [2023-11-30 09:57:07,221 INFO L500 AbstractCegarLoop]: Abstraction has has 134 places, 135 transitions, 343 flow [2023-11-30 09:57:07,221 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:07,221 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:07,221 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:57:07,222 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 09:57:07,222 INFO L425 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:07,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash -748178255, now seen corresponding path program 1 times [2023-11-30 09:57:07,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:07,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780471998] [2023-11-30 09:57:07,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:07,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:07,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780471998] [2023-11-30 09:57:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780471998] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741639054] [2023-11-30 09:57:07,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:07,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:07,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:07,462 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-30 09:57:07,488 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-30 09:57:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:07,547 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:57:07,551 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:07,603 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:57:07,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741639054] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:57:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 09:57:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410089726] [2023-11-30 09:57:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:07,605 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:57:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:07,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:57:07,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 09:57:07,607 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2023-11-30 09:57:07,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 135 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 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-30 09:57:07,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:07,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2023-11-30 09:57:07,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:07,691 INFO L124 PetriNetUnfolderBase]: 30/217 cut-off events. [2023-11-30 09:57:07,691 INFO L125 PetriNetUnfolderBase]: For 48/54 co-relation queries the response was YES. [2023-11-30 09:57:07,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379 conditions, 217 events. 30/217 cut-off events. For 48/54 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 539 event pairs, 14 based on Foata normal form. 0/174 useless extension candidates. Maximal degree in co-relation 209. Up to 64 conditions per place. [2023-11-30 09:57:07,693 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 23 selfloop transitions, 8 changer transitions 3/134 dead transitions. [2023-11-30 09:57:07,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 134 transitions, 401 flow [2023-11-30 09:57:07,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:57:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:57:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2023-11-30 09:57:07,696 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8035714285714286 [2023-11-30 09:57:07,696 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2023-11-30 09:57:07,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2023-11-30 09:57:07,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:07,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2023-11-30 09:57:07,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 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-30 09:57:07,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 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-30 09:57:07,701 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 160.0) internal successors, (1280), 8 states have internal predecessors, (1280), 0 states have call successors, (0), 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-30 09:57:07,701 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 6 predicate places. [2023-11-30 09:57:07,701 INFO L500 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 401 flow [2023-11-30 09:57:07,702 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 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-30 09:57:07,702 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:07,702 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 09:57:07,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-30 09:57:07,907 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:07,908 INFO L425 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:07,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:07,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1718689007, now seen corresponding path program 1 times [2023-11-30 09:57:07,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:07,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053223124] [2023-11-30 09:57:07,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:07,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:08,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:08,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053223124] [2023-11-30 09:57:08,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053223124] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:08,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817985062] [2023-11-30 09:57:08,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:08,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:08,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:08,073 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-30 09:57:08,075 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-30 09:57:08,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:08,135 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:57:08,138 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:08,182 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:08,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817985062] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:08,234 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:08,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:57:08,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324162050] [2023-11-30 09:57:08,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:08,236 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:57:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:08,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:57:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:57:08,240 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 160 [2023-11-30 09:57:08,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 401 flow. Second operand has 12 states, 12 states have (on average 126.83333333333333) internal successors, (1522), 12 states have internal predecessors, (1522), 0 states have call successors, (0), 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-30 09:57:08,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:08,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 160 [2023-11-30 09:57:08,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:08,389 INFO L124 PetriNetUnfolderBase]: 33/252 cut-off events. [2023-11-30 09:57:08,390 INFO L125 PetriNetUnfolderBase]: For 122/134 co-relation queries the response was YES. [2023-11-30 09:57:08,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 252 events. 33/252 cut-off events. For 122/134 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 705 event pairs, 14 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 312. Up to 90 conditions per place. [2023-11-30 09:57:08,392 INFO L140 encePairwiseOnDemand]: 153/160 looper letters, 39 selfloop transitions, 18 changer transitions 3/160 dead transitions. [2023-11-30 09:57:08,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 160 transitions, 671 flow [2023-11-30 09:57:08,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:57:08,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:57:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1796 transitions. [2023-11-30 09:57:08,395 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8017857142857143 [2023-11-30 09:57:08,395 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1796 transitions. [2023-11-30 09:57:08,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1796 transitions. [2023-11-30 09:57:08,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:08,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1796 transitions. [2023-11-30 09:57:08,424 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 128.28571428571428) internal successors, (1796), 14 states have internal predecessors, (1796), 0 states have call successors, (0), 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-30 09:57:08,427 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 160.0) internal successors, (2400), 15 states have internal predecessors, (2400), 0 states have call successors, (0), 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-30 09:57:08,429 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 160.0) internal successors, (2400), 15 states have internal predecessors, (2400), 0 states have call successors, (0), 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-30 09:57:08,430 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 19 predicate places. [2023-11-30 09:57:08,433 INFO L500 AbstractCegarLoop]: Abstraction has has 152 places, 160 transitions, 671 flow [2023-11-30 09:57:08,433 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 126.83333333333333) internal successors, (1522), 12 states have internal predecessors, (1522), 0 states have call successors, (0), 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-30 09:57:08,433 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:08,433 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] [2023-11-30 09:57:08,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-30 09:57:08,653 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-30 09:57:08,653 INFO L425 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:08,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:08,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1185161428, now seen corresponding path program 1 times [2023-11-30 09:57:08,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:08,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068302978] [2023-11-30 09:57:08,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:08,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:08,760 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-30 09:57:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068302978] [2023-11-30 09:57:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068302978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:57:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 09:57:08,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798795789] [2023-11-30 09:57:08,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:08,763 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:57:08,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:08,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:57:08,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-30 09:57:08,766 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 160 [2023-11-30 09:57:08,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 160 transitions, 671 flow. Second operand has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 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-30 09:57:08,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:08,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 160 [2023-11-30 09:57:08,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:08,865 INFO L124 PetriNetUnfolderBase]: 32/286 cut-off events. [2023-11-30 09:57:08,866 INFO L125 PetriNetUnfolderBase]: For 263/281 co-relation queries the response was YES. [2023-11-30 09:57:08,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 286 events. 32/286 cut-off events. For 263/281 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 829 event pairs, 14 based on Foata normal form. 5/243 useless extension candidates. Maximal degree in co-relation 396. Up to 93 conditions per place. [2023-11-30 09:57:08,867 INFO L140 encePairwiseOnDemand]: 144/160 looper letters, 40 selfloop transitions, 8 changer transitions 9/164 dead transitions. [2023-11-30 09:57:08,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 164 transitions, 811 flow [2023-11-30 09:57:08,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 09:57:08,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 09:57:08,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1131 transitions. [2023-11-30 09:57:08,869 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7854166666666667 [2023-11-30 09:57:08,869 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1131 transitions. [2023-11-30 09:57:08,869 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1131 transitions. [2023-11-30 09:57:08,870 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:08,870 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1131 transitions. [2023-11-30 09:57:08,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.66666666666667) internal successors, (1131), 9 states have internal predecessors, (1131), 0 states have call successors, (0), 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-30 09:57:08,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 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-30 09:57:08,873 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 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-30 09:57:08,874 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 27 predicate places. [2023-11-30 09:57:08,875 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 164 transitions, 811 flow [2023-11-30 09:57:08,875 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.5) internal successors, (741), 6 states have internal predecessors, (741), 0 states have call successors, (0), 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-30 09:57:08,875 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:08,875 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] [2023-11-30 09:57:08,875 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 09:57:08,875 INFO L425 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:08,875 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:08,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1676646688, now seen corresponding path program 1 times [2023-11-30 09:57:08,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:08,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274461264] [2023-11-30 09:57:08,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:08,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:08,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:09,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274461264] [2023-11-30 09:57:09,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274461264] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:09,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938597682] [2023-11-30 09:57:09,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:09,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:09,023 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-30 09:57:09,057 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-30 09:57:09,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,094 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:57:09,096 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:09,157 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-30 09:57:09,157 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:57:09,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938597682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:09,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:57:09,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-30 09:57:09,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029513972] [2023-11-30 09:57:09,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:09,158 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:57:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:09,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:57:09,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-30 09:57:09,159 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 160 [2023-11-30 09:57:09,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 164 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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-30 09:57:09,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:09,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 160 [2023-11-30 09:57:09,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:09,197 INFO L124 PetriNetUnfolderBase]: 15/243 cut-off events. [2023-11-30 09:57:09,197 INFO L125 PetriNetUnfolderBase]: For 274/282 co-relation queries the response was YES. [2023-11-30 09:57:09,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 572 conditions, 243 events. 15/243 cut-off events. For 274/282 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 577 event pairs, 5 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 397. Up to 64 conditions per place. [2023-11-30 09:57:09,199 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 10 selfloop transitions, 3 changer transitions 9/161 dead transitions. [2023-11-30 09:57:09,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 161 transitions, 811 flow [2023-11-30 09:57:09,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:57:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:57:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2023-11-30 09:57:09,200 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8375 [2023-11-30 09:57:09,201 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 536 transitions. [2023-11-30 09:57:09,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 536 transitions. [2023-11-30 09:57:09,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:09,201 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 536 transitions. [2023-11-30 09:57:09,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 0 states have call successors, (0), 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-30 09:57:09,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:09,203 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:09,204 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 27 predicate places. [2023-11-30 09:57:09,204 INFO L500 AbstractCegarLoop]: Abstraction has has 160 places, 161 transitions, 811 flow [2023-11-30 09:57:09,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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-30 09:57:09,204 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:09,204 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] [2023-11-30 09:57:09,210 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-30 09:57:09,409 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:09,410 INFO L425 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:09,410 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:09,410 INFO L85 PathProgramCache]: Analyzing trace with hash 644748837, now seen corresponding path program 1 times [2023-11-30 09:57:09,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:09,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523425909] [2023-11-30 09:57:09,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:09,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:09,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,451 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-30 09:57:09,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:09,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523425909] [2023-11-30 09:57:09,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523425909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:09,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:57:09,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:57:09,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794228154] [2023-11-30 09:57:09,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:09,452 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:57:09,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:09,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:57:09,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:57:09,453 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2023-11-30 09:57:09,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 161 transitions, 811 flow. Second operand has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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-30 09:57:09,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:09,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2023-11-30 09:57:09,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:09,512 INFO L124 PetriNetUnfolderBase]: 74/400 cut-off events. [2023-11-30 09:57:09,512 INFO L125 PetriNetUnfolderBase]: For 1310/1455 co-relation queries the response was YES. [2023-11-30 09:57:09,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 400 events. 74/400 cut-off events. For 1310/1455 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1686 event pairs, 21 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 717. Up to 120 conditions per place. [2023-11-30 09:57:09,514 INFO L140 encePairwiseOnDemand]: 153/160 looper letters, 27 selfloop transitions, 5 changer transitions 10/177 dead transitions. [2023-11-30 09:57:09,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 177 transitions, 1005 flow [2023-11-30 09:57:09,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:57:09,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:57:09,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 669 transitions. [2023-11-30 09:57:09,515 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.83625 [2023-11-30 09:57:09,515 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 669 transitions. [2023-11-30 09:57:09,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 669 transitions. [2023-11-30 09:57:09,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:09,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 669 transitions. [2023-11-30 09:57:09,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 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-30 09:57:09,517 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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-30 09:57:09,518 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 160.0) internal successors, (960), 6 states have internal predecessors, (960), 0 states have call successors, (0), 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-30 09:57:09,518 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 31 predicate places. [2023-11-30 09:57:09,518 INFO L500 AbstractCegarLoop]: Abstraction has has 164 places, 177 transitions, 1005 flow [2023-11-30 09:57:09,518 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 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-30 09:57:09,518 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:09,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] [2023-11-30 09:57:09,519 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 09:57:09,519 INFO L425 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:09,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:09,519 INFO L85 PathProgramCache]: Analyzing trace with hash 334862683, now seen corresponding path program 1 times [2023-11-30 09:57:09,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:09,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165132447] [2023-11-30 09:57:09,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:09,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,563 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-30 09:57:09,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:09,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165132447] [2023-11-30 09:57:09,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165132447] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:09,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:57:09,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:57:09,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362653575] [2023-11-30 09:57:09,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:09,564 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:57:09,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:09,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:57:09,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:57:09,565 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2023-11-30 09:57:09,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 177 transitions, 1005 flow. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-30 09:57:09,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:09,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2023-11-30 09:57:09,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:09,631 INFO L124 PetriNetUnfolderBase]: 69/341 cut-off events. [2023-11-30 09:57:09,631 INFO L125 PetriNetUnfolderBase]: For 1789/1825 co-relation queries the response was YES. [2023-11-30 09:57:09,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 341 events. 69/341 cut-off events. For 1789/1825 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1236 event pairs, 3 based on Foata normal form. 4/305 useless extension candidates. Maximal degree in co-relation 714. Up to 119 conditions per place. [2023-11-30 09:57:09,633 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 17 selfloop transitions, 3 changer transitions 10/180 dead transitions. [2023-11-30 09:57:09,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 180 transitions, 1099 flow [2023-11-30 09:57:09,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:57:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:57:09,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2023-11-30 09:57:09,635 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2023-11-30 09:57:09,635 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2023-11-30 09:57:09,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2023-11-30 09:57:09,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:09,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2023-11-30 09:57:09,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 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-30 09:57:09,636 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:09,637 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 160.0) internal successors, (640), 4 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:09,637 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 33 predicate places. [2023-11-30 09:57:09,637 INFO L500 AbstractCegarLoop]: Abstraction has has 166 places, 180 transitions, 1099 flow [2023-11-30 09:57:09,637 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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-30 09:57:09,637 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:09,637 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:57:09,638 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 09:57:09,638 INFO L425 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:09,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:09,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1440454166, now seen corresponding path program 1 times [2023-11-30 09:57:09,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:09,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211962219] [2023-11-30 09:57:09,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:09,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:09,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,754 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:09,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211962219] [2023-11-30 09:57:09,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211962219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:09,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712956454] [2023-11-30 09:57:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:09,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:09,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:09,756 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-30 09:57:09,759 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-30 09:57:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:09,833 INFO L262 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-30 09:57:09,835 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:09,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:09,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:10,145 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:10,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712956454] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:10,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:10,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-11-30 09:57:10,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167857031] [2023-11-30 09:57:10,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:10,146 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 09:57:10,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:10,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 09:57:10,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-30 09:57:10,149 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2023-11-30 09:57:10,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 180 transitions, 1099 flow. Second operand has 19 states, 19 states have (on average 116.78947368421052) internal successors, (2219), 19 states have internal predecessors, (2219), 0 states have call successors, (0), 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-30 09:57:10,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:10,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2023-11-30 09:57:10,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:10,402 INFO L124 PetriNetUnfolderBase]: 102/499 cut-off events. [2023-11-30 09:57:10,403 INFO L125 PetriNetUnfolderBase]: For 3696/3882 co-relation queries the response was YES. [2023-11-30 09:57:10,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1933 conditions, 499 events. 102/499 cut-off events. For 3696/3882 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2316 event pairs, 8 based on Foata normal form. 15/454 useless extension candidates. Maximal degree in co-relation 786. Up to 164 conditions per place. [2023-11-30 09:57:10,405 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 65 selfloop transitions, 23 changer transitions 10/196 dead transitions. [2023-11-30 09:57:10,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 196 transitions, 1551 flow [2023-11-30 09:57:10,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 09:57:10,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 09:57:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2113 transitions. [2023-11-30 09:57:10,409 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7336805555555556 [2023-11-30 09:57:10,409 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2113 transitions. [2023-11-30 09:57:10,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2113 transitions. [2023-11-30 09:57:10,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:10,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2113 transitions. [2023-11-30 09:57:10,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 117.38888888888889) internal successors, (2113), 18 states have internal predecessors, (2113), 0 states have call successors, (0), 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-30 09:57:10,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 160.0) internal successors, (3040), 19 states have internal predecessors, (3040), 0 states have call successors, (0), 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-30 09:57:10,416 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 160.0) internal successors, (3040), 19 states have internal predecessors, (3040), 0 states have call successors, (0), 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-30 09:57:10,417 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 50 predicate places. [2023-11-30 09:57:10,417 INFO L500 AbstractCegarLoop]: Abstraction has has 183 places, 196 transitions, 1551 flow [2023-11-30 09:57:10,418 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 116.78947368421052) internal successors, (2219), 19 states have internal predecessors, (2219), 0 states have call successors, (0), 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-30 09:57:10,418 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:10,418 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] [2023-11-30 09:57:10,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:10,623 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-30 09:57:10,625 INFO L425 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:10,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:10,625 INFO L85 PathProgramCache]: Analyzing trace with hash -408860715, now seen corresponding path program 1 times [2023-11-30 09:57:10,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:10,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725199605] [2023-11-30 09:57:10,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:10,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:11,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:11,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725199605] [2023-11-30 09:57:11,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725199605] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:11,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61804053] [2023-11-30 09:57:11,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:11,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:11,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:11,244 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-30 09:57:11,294 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-30 09:57:11,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:11,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-30 09:57:11,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:11,939 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:12,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:57:12,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2023-11-30 09:57:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:12,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61804053] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:12,622 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:12,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 11] total 41 [2023-11-30 09:57:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168525201] [2023-11-30 09:57:12,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:12,623 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-30 09:57:12,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:12,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-30 09:57:12,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1435, Unknown=0, NotChecked=0, Total=1722 [2023-11-30 09:57:12,627 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 160 [2023-11-30 09:57:12,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 196 transitions, 1551 flow. Second operand has 42 states, 42 states have (on average 88.9047619047619) internal successors, (3734), 42 states have internal predecessors, (3734), 0 states have call successors, (0), 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-30 09:57:12,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:12,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 160 [2023-11-30 09:57:12,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:13,914 INFO L124 PetriNetUnfolderBase]: 632/1798 cut-off events. [2023-11-30 09:57:13,914 INFO L125 PetriNetUnfolderBase]: For 18184/18357 co-relation queries the response was YES. [2023-11-30 09:57:13,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7144 conditions, 1798 events. 632/1798 cut-off events. For 18184/18357 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13035 event pairs, 99 based on Foata normal form. 32/1496 useless extension candidates. Maximal degree in co-relation 3459. Up to 525 conditions per place. [2023-11-30 09:57:13,926 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 179 selfloop transitions, 57 changer transitions 10/318 dead transitions. [2023-11-30 09:57:13,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 318 transitions, 3138 flow [2023-11-30 09:57:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2023-11-30 09:57:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2023-11-30 09:57:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 3630 transitions. [2023-11-30 09:57:13,932 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5671875 [2023-11-30 09:57:13,932 INFO L72 ComplementDD]: Start complementDD. Operand 40 states and 3630 transitions. [2023-11-30 09:57:13,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 3630 transitions. [2023-11-30 09:57:13,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:13,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 40 states and 3630 transitions. [2023-11-30 09:57:13,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 41 states, 40 states have (on average 90.75) internal successors, (3630), 40 states have internal predecessors, (3630), 0 states have call successors, (0), 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-30 09:57:13,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 41 states, 41 states have (on average 160.0) internal successors, (6560), 41 states have internal predecessors, (6560), 0 states have call successors, (0), 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-30 09:57:13,945 INFO L81 ComplementDD]: Finished complementDD. Result has 41 states, 41 states have (on average 160.0) internal successors, (6560), 41 states have internal predecessors, (6560), 0 states have call successors, (0), 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-30 09:57:13,945 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 89 predicate places. [2023-11-30 09:57:13,945 INFO L500 AbstractCegarLoop]: Abstraction has has 222 places, 318 transitions, 3138 flow [2023-11-30 09:57:13,946 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 88.9047619047619) internal successors, (3734), 42 states have internal predecessors, (3734), 0 states have call successors, (0), 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-30 09:57:13,946 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:13,946 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] [2023-11-30 09:57:13,953 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-30 09:57:14,150 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-30 09:57:14,151 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:14,151 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:14,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1713859285, now seen corresponding path program 2 times [2023-11-30 09:57:14,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:14,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44311226] [2023-11-30 09:57:14,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:14,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:14,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:14,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44311226] [2023-11-30 09:57:14,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44311226] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:14,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978219446] [2023-11-30 09:57:14,778 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:57:14,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:14,793 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-30 09:57:14,817 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-30 09:57:14,881 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:57:14,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:57:14,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 09:57:14,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 09:57:15,014 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:57:15,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 09:57:15,240 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 20 treesize of output 15 [2023-11-30 09:57:15,281 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-30 09:57:15,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:57:15,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [978219446] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:15,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:57:15,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [18] total 29 [2023-11-30 09:57:15,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396724371] [2023-11-30 09:57:15,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:15,283 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:57:15,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:15,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:57:15,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=758, Unknown=0, NotChecked=0, Total=870 [2023-11-30 09:57:15,285 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 160 [2023-11-30 09:57:15,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 318 transitions, 3138 flow. Second operand has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 0 states have call successors, (0), 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-30 09:57:15,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:15,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 160 [2023-11-30 09:57:15,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:15,867 INFO L124 PetriNetUnfolderBase]: 916/2526 cut-off events. [2023-11-30 09:57:15,867 INFO L125 PetriNetUnfolderBase]: For 25777/26887 co-relation queries the response was YES. [2023-11-30 09:57:15,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11287 conditions, 2526 events. 916/2526 cut-off events. For 25777/26887 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19357 event pairs, 121 based on Foata normal form. 24/2104 useless extension candidates. Maximal degree in co-relation 6056. Up to 653 conditions per place. [2023-11-30 09:57:15,895 INFO L140 encePairwiseOnDemand]: 143/160 looper letters, 219 selfloop transitions, 53 changer transitions 10/396 dead transitions. [2023-11-30 09:57:15,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 396 transitions, 4515 flow [2023-11-30 09:57:15,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 09:57:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 09:57:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1522 transitions. [2023-11-30 09:57:15,898 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6341666666666667 [2023-11-30 09:57:15,898 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1522 transitions. [2023-11-30 09:57:15,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1522 transitions. [2023-11-30 09:57:15,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:15,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1522 transitions. [2023-11-30 09:57:15,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 101.46666666666667) internal successors, (1522), 15 states have internal predecessors, (1522), 0 states have call successors, (0), 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-30 09:57:15,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 160.0) internal successors, (2560), 16 states have internal predecessors, (2560), 0 states have call successors, (0), 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-30 09:57:15,903 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 160.0) internal successors, (2560), 16 states have internal predecessors, (2560), 0 states have call successors, (0), 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-30 09:57:15,903 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 103 predicate places. [2023-11-30 09:57:15,903 INFO L500 AbstractCegarLoop]: Abstraction has has 236 places, 396 transitions, 4515 flow [2023-11-30 09:57:15,903 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 98.53846153846153) internal successors, (1281), 13 states have internal predecessors, (1281), 0 states have call successors, (0), 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-30 09:57:15,903 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:15,903 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] [2023-11-30 09:57:15,920 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-30 09:57:16,108 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-30 09:57:16,108 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:16,109 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:16,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1230948822, now seen corresponding path program 1 times [2023-11-30 09:57:16,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:16,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893661988] [2023-11-30 09:57:16,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:16,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893661988] [2023-11-30 09:57:17,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893661988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:17,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326873429] [2023-11-30 09:57:17,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:17,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:17,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:17,193 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-30 09:57:17,198 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-30 09:57:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:17,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-30 09:57:17,276 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:18,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:57:18,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-11-30 09:57:18,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:18,327 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:18,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:57:18,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2023-11-30 09:57:18,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 6 [2023-11-30 09:57:19,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:19,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326873429] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:19,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:19,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 56 [2023-11-30 09:57:19,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272602775] [2023-11-30 09:57:19,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:19,787 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-30 09:57:19,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:19,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-30 09:57:19,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=2928, Unknown=0, NotChecked=0, Total=3192 [2023-11-30 09:57:19,790 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 160 [2023-11-30 09:57:19,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 396 transitions, 4515 flow. Second operand has 57 states, 57 states have (on average 75.47368421052632) internal successors, (4302), 57 states have internal predecessors, (4302), 0 states have call successors, (0), 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-30 09:57:19,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:19,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 160 [2023-11-30 09:57:19,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:24,930 INFO L124 PetriNetUnfolderBase]: 851/2289 cut-off events. [2023-11-30 09:57:24,930 INFO L125 PetriNetUnfolderBase]: For 33974/37256 co-relation queries the response was YES. [2023-11-30 09:57:24,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12324 conditions, 2289 events. 851/2289 cut-off events. For 33974/37256 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 16758 event pairs, 100 based on Foata normal form. 160/2066 useless extension candidates. Maximal degree in co-relation 7518. Up to 654 conditions per place. [2023-11-30 09:57:24,945 INFO L140 encePairwiseOnDemand]: 126/160 looper letters, 230 selfloop transitions, 74 changer transitions 53/420 dead transitions. [2023-11-30 09:57:24,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 420 transitions, 5432 flow [2023-11-30 09:57:24,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2023-11-30 09:57:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2023-11-30 09:57:24,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 4145 transitions. [2023-11-30 09:57:24,950 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.47974537037037035 [2023-11-30 09:57:24,950 INFO L72 ComplementDD]: Start complementDD. Operand 54 states and 4145 transitions. [2023-11-30 09:57:24,950 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 4145 transitions. [2023-11-30 09:57:24,951 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:24,951 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 54 states and 4145 transitions. [2023-11-30 09:57:24,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 55 states, 54 states have (on average 76.75925925925925) internal successors, (4145), 54 states have internal predecessors, (4145), 0 states have call successors, (0), 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-30 09:57:24,961 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 55 states, 55 states have (on average 160.0) internal successors, (8800), 55 states have internal predecessors, (8800), 0 states have call successors, (0), 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-30 09:57:24,961 INFO L81 ComplementDD]: Finished complementDD. Result has 55 states, 55 states have (on average 160.0) internal successors, (8800), 55 states have internal predecessors, (8800), 0 states have call successors, (0), 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-30 09:57:24,962 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 156 predicate places. [2023-11-30 09:57:24,962 INFO L500 AbstractCegarLoop]: Abstraction has has 289 places, 420 transitions, 5432 flow [2023-11-30 09:57:24,963 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 75.47368421052632) internal successors, (4302), 57 states have internal predecessors, (4302), 0 states have call successors, (0), 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-30 09:57:24,963 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:24,963 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] [2023-11-30 09:57:24,967 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-30 09:57:25,167 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-30 09:57:25,168 INFO L425 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:25,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1590030860, now seen corresponding path program 1 times [2023-11-30 09:57:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:25,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494961689] [2023-11-30 09:57:25,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:25,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:26,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:26,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494961689] [2023-11-30 09:57:26,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494961689] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:26,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574716418] [2023-11-30 09:57:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:26,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:26,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:26,184 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:26,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-30 09:57:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:26,254 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-30 09:57:26,256 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:27,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:57:27,105 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 18 treesize of output 13 [2023-11-30 09:57:27,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:27,221 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:27,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:57:27,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2023-11-30 09:57:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-30 09:57:28,613 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:28,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574716418] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:28,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:28,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 18, 18] total 56 [2023-11-30 09:57:28,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216964287] [2023-11-30 09:57:28,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:28,614 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-30 09:57:28,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:28,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-30 09:57:28,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=278, Invalid=2914, Unknown=0, NotChecked=0, Total=3192 [2023-11-30 09:57:28,617 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 160 [2023-11-30 09:57:28,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 420 transitions, 5432 flow. Second operand has 57 states, 57 states have (on average 78.47368421052632) internal successors, (4473), 57 states have internal predecessors, (4473), 0 states have call successors, (0), 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-30 09:57:28,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:28,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 160 [2023-11-30 09:57:28,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:32,831 INFO L124 PetriNetUnfolderBase]: 941/2648 cut-off events. [2023-11-30 09:57:32,831 INFO L125 PetriNetUnfolderBase]: For 37567/39984 co-relation queries the response was YES. [2023-11-30 09:57:32,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15558 conditions, 2648 events. 941/2648 cut-off events. For 37567/39984 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 20442 event pairs, 103 based on Foata normal form. 106/2359 useless extension candidates. Maximal degree in co-relation 9082. Up to 821 conditions per place. [2023-11-30 09:57:32,936 INFO L140 encePairwiseOnDemand]: 128/160 looper letters, 235 selfloop transitions, 98 changer transitions 56/455 dead transitions. [2023-11-30 09:57:32,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 455 transitions, 6803 flow [2023-11-30 09:57:32,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-30 09:57:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2023-11-30 09:57:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3901 transitions. [2023-11-30 09:57:32,953 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4975765306122449 [2023-11-30 09:57:32,954 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 3901 transitions. [2023-11-30 09:57:32,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 3901 transitions. [2023-11-30 09:57:32,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:32,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 3901 transitions. [2023-11-30 09:57:32,962 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 79.61224489795919) internal successors, (3901), 49 states have internal predecessors, (3901), 0 states have call successors, (0), 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-30 09:57:32,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 160.0) internal successors, (8000), 50 states have internal predecessors, (8000), 0 states have call successors, (0), 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-30 09:57:32,971 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 160.0) internal successors, (8000), 50 states have internal predecessors, (8000), 0 states have call successors, (0), 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-30 09:57:32,971 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 200 predicate places. [2023-11-30 09:57:32,972 INFO L500 AbstractCegarLoop]: Abstraction has has 333 places, 455 transitions, 6803 flow [2023-11-30 09:57:32,973 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 78.47368421052632) internal successors, (4473), 57 states have internal predecessors, (4473), 0 states have call successors, (0), 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-30 09:57:32,973 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:32,973 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:57:32,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:33,185 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-30 09:57:33,186 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:33,186 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:33,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1401868533, now seen corresponding path program 2 times [2023-11-30 09:57:33,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:33,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524971206] [2023-11-30 09:57:33,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:33,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:33,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:33,280 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:33,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524971206] [2023-11-30 09:57:33,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524971206] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:33,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829631877] [2023-11-30 09:57:33,280 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:57:33,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:33,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:33,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:33,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-30 09:57:33,339 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:57:33,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:57:33,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 09:57:33,341 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:33,448 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 09:57:33,448 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:33,541 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-11-30 09:57:33,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829631877] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:33,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:33,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2023-11-30 09:57:33,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714669217] [2023-11-30 09:57:33,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:33,542 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 09:57:33,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:33,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 09:57:33,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-11-30 09:57:33,543 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 160 [2023-11-30 09:57:33,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 455 transitions, 6803 flow. Second operand has 18 states, 18 states have (on average 114.77777777777777) internal successors, (2066), 18 states have internal predecessors, (2066), 0 states have call successors, (0), 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-30 09:57:33,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:33,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 160 [2023-11-30 09:57:33,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:34,093 INFO L124 PetriNetUnfolderBase]: 934/2616 cut-off events. [2023-11-30 09:57:34,093 INFO L125 PetriNetUnfolderBase]: For 49165/50524 co-relation queries the response was YES. [2023-11-30 09:57:34,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16207 conditions, 2616 events. 934/2616 cut-off events. For 49165/50524 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20147 event pairs, 100 based on Foata normal form. 14/2230 useless extension candidates. Maximal degree in co-relation 9371. Up to 805 conditions per place. [2023-11-30 09:57:34,114 INFO L140 encePairwiseOnDemand]: 146/160 looper letters, 156 selfloop transitions, 34 changer transitions 56/467 dead transitions. [2023-11-30 09:57:34,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 467 transitions, 7441 flow [2023-11-30 09:57:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 09:57:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 09:57:34,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2744 transitions. [2023-11-30 09:57:34,117 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7145833333333333 [2023-11-30 09:57:34,117 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2744 transitions. [2023-11-30 09:57:34,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2744 transitions. [2023-11-30 09:57:34,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:34,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2744 transitions. [2023-11-30 09:57:34,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 114.33333333333333) internal successors, (2744), 24 states have internal predecessors, (2744), 0 states have call successors, (0), 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-30 09:57:34,123 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 160.0) internal successors, (4000), 25 states have internal predecessors, (4000), 0 states have call successors, (0), 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-30 09:57:34,123 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 160.0) internal successors, (4000), 25 states have internal predecessors, (4000), 0 states have call successors, (0), 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-30 09:57:34,123 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 222 predicate places. [2023-11-30 09:57:34,123 INFO L500 AbstractCegarLoop]: Abstraction has has 355 places, 467 transitions, 7441 flow [2023-11-30 09:57:34,124 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 114.77777777777777) internal successors, (2066), 18 states have internal predecessors, (2066), 0 states have call successors, (0), 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-30 09:57:34,124 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:34,124 INFO L232 CegarLoopForPetriNet]: trace histogram [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] [2023-11-30 09:57:34,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:34,328 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-30 09:57:34,328 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:34,329 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:34,329 INFO L85 PathProgramCache]: Analyzing trace with hash 28840403, now seen corresponding path program 1 times [2023-11-30 09:57:34,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:34,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484460537] [2023-11-30 09:57:34,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:34,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-30 09:57:34,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:34,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484460537] [2023-11-30 09:57:34,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484460537] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:34,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:57:34,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 09:57:34,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660886733] [2023-11-30 09:57:34,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:34,382 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:57:34,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:34,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:57:34,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:57:34,384 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2023-11-30 09:57:34,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 467 transitions, 7441 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 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-30 09:57:34,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:34,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2023-11-30 09:57:34,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:34,793 INFO L124 PetriNetUnfolderBase]: 1261/3523 cut-off events. [2023-11-30 09:57:34,793 INFO L125 PetriNetUnfolderBase]: For 88131/91433 co-relation queries the response was YES. [2023-11-30 09:57:34,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22813 conditions, 3523 events. 1261/3523 cut-off events. For 88131/91433 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 26956 event pairs, 184 based on Foata normal form. 152/3125 useless extension candidates. Maximal degree in co-relation 16434. Up to 1433 conditions per place. [2023-11-30 09:57:34,823 INFO L140 encePairwiseOnDemand]: 156/160 looper letters, 88 selfloop transitions, 71 changer transitions 139/511 dead transitions. [2023-11-30 09:57:34,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 511 transitions, 9744 flow [2023-11-30 09:57:34,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:57:34,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:57:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 556 transitions. [2023-11-30 09:57:34,824 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.86875 [2023-11-30 09:57:34,824 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 556 transitions. [2023-11-30 09:57:34,824 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 556 transitions. [2023-11-30 09:57:34,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:34,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 556 transitions. [2023-11-30 09:57:34,825 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.0) internal successors, (556), 4 states have internal predecessors, (556), 0 states have call successors, (0), 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-30 09:57:34,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:34,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:34,826 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 220 predicate places. [2023-11-30 09:57:34,826 INFO L500 AbstractCegarLoop]: Abstraction has has 353 places, 511 transitions, 9744 flow [2023-11-30 09:57:34,826 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 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-30 09:57:34,826 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:34,827 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] [2023-11-30 09:57:34,827 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-30 09:57:34,827 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:34,827 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:34,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2026323382, now seen corresponding path program 2 times [2023-11-30 09:57:34,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:34,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513048818] [2023-11-30 09:57:34,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:34,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:34,874 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:57:34,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513048818] [2023-11-30 09:57:34,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513048818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:34,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983512338] [2023-11-30 09:57:34,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:57:34,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:34,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:34,902 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:34,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-30 09:57:35,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:57:35,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:57:35,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 09:57:35,056 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:35,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:57:35,077 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:57:35,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983512338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:57:35,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:57:35,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 09:57:35,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028565871] [2023-11-30 09:57:35,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:57:35,078 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 09:57:35,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:35,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 09:57:35,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 09:57:35,079 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2023-11-30 09:57:35,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 511 transitions, 9744 flow. Second operand has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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-30 09:57:35,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:35,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2023-11-30 09:57:35,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:35,506 INFO L124 PetriNetUnfolderBase]: 1109/3038 cut-off events. [2023-11-30 09:57:35,507 INFO L125 PetriNetUnfolderBase]: For 85910/89827 co-relation queries the response was YES. [2023-11-30 09:57:35,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22118 conditions, 3038 events. 1109/3038 cut-off events. For 85910/89827 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 21804 event pairs, 101 based on Foata normal form. 143/2767 useless extension candidates. Maximal degree in co-relation 15456. Up to 1311 conditions per place. [2023-11-30 09:57:35,531 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 194 selfloop transitions, 7 changer transitions 143/542 dead transitions. [2023-11-30 09:57:35,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 542 transitions, 11248 flow [2023-11-30 09:57:35,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:57:35,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:57:35,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 529 transitions. [2023-11-30 09:57:35,532 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8265625 [2023-11-30 09:57:35,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 529 transitions. [2023-11-30 09:57:35,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 529 transitions. [2023-11-30 09:57:35,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:35,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 529 transitions. [2023-11-30 09:57:35,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.25) internal successors, (529), 4 states have internal predecessors, (529), 0 states have call successors, (0), 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-30 09:57:35,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:35,533 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 160.0) internal successors, (800), 5 states have internal predecessors, (800), 0 states have call successors, (0), 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-30 09:57:35,534 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 222 predicate places. [2023-11-30 09:57:35,534 INFO L500 AbstractCegarLoop]: Abstraction has has 355 places, 542 transitions, 11248 flow [2023-11-30 09:57:35,534 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 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-30 09:57:35,534 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:35,534 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:57:35,555 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:35,738 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-30 09:57:35,738 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:35,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:35,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1608485158, now seen corresponding path program 1 times [2023-11-30 09:57:35,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:35,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211257892] [2023-11-30 09:57:35,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:35,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:35,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:35,785 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:57:35,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211257892] [2023-11-30 09:57:35,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211257892] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:35,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622159692] [2023-11-30 09:57:35,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:35,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:35,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:35,787 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:35,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-30 09:57:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:35,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:57:35,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:57:35,875 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:35,902 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:57:35,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622159692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:35,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:35,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:57:35,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656538755] [2023-11-30 09:57:35,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:35,904 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:57:35,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:35,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:57:35,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:57:35,907 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2023-11-30 09:57:35,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 542 transitions, 11248 flow. Second operand has 12 states, 12 states have (on average 129.83333333333334) internal successors, (1558), 12 states have internal predecessors, (1558), 0 states have call successors, (0), 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-30 09:57:35,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:35,908 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2023-11-30 09:57:35,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:36,827 INFO L124 PetriNetUnfolderBase]: 1725/4429 cut-off events. [2023-11-30 09:57:36,827 INFO L125 PetriNetUnfolderBase]: For 150101/159149 co-relation queries the response was YES. [2023-11-30 09:57:36,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35997 conditions, 4429 events. 1725/4429 cut-off events. For 150101/159149 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 33179 event pairs, 97 based on Foata normal form. 317/4102 useless extension candidates. Maximal degree in co-relation 29284. Up to 2521 conditions per place. [2023-11-30 09:57:36,877 INFO L140 encePairwiseOnDemand]: 153/160 looper letters, 332 selfloop transitions, 18 changer transitions 143/691 dead transitions. [2023-11-30 09:57:36,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 691 transitions, 16294 flow [2023-11-30 09:57:36,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:57:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:57:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1856 transitions. [2023-11-30 09:57:36,885 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8285714285714286 [2023-11-30 09:57:36,885 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1856 transitions. [2023-11-30 09:57:36,885 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1856 transitions. [2023-11-30 09:57:36,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:36,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1856 transitions. [2023-11-30 09:57:36,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 132.57142857142858) internal successors, (1856), 14 states have internal predecessors, (1856), 0 states have call successors, (0), 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-30 09:57:36,893 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 160.0) internal successors, (2400), 15 states have internal predecessors, (2400), 0 states have call successors, (0), 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-30 09:57:36,893 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 160.0) internal successors, (2400), 15 states have internal predecessors, (2400), 0 states have call successors, (0), 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-30 09:57:36,894 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 235 predicate places. [2023-11-30 09:57:36,894 INFO L500 AbstractCegarLoop]: Abstraction has has 368 places, 691 transitions, 16294 flow [2023-11-30 09:57:36,894 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 129.83333333333334) internal successors, (1558), 12 states have internal predecessors, (1558), 0 states have call successors, (0), 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-30 09:57:36,894 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:36,894 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:57:36,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:37,098 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-30 09:57:37,098 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:37,099 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:37,099 INFO L85 PathProgramCache]: Analyzing trace with hash 237286572, now seen corresponding path program 1 times [2023-11-30 09:57:37,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:37,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551355918] [2023-11-30 09:57:37,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:37,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:38,104 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-30 09:57:38,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551355918] [2023-11-30 09:57:38,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551355918] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:38,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400952238] [2023-11-30 09:57:38,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:38,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:38,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:38,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:38,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-30 09:57:38,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:38,196 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 09:57:38,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:39,003 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-30 09:57:39,003 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:39,273 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:57:39,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 52 [2023-11-30 09:57:40,409 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-30 09:57:40,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400952238] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:40,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:40,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 52 [2023-11-30 09:57:40,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399698762] [2023-11-30 09:57:40,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:40,410 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-30 09:57:40,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:40,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-30 09:57:40,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=2402, Unknown=0, NotChecked=0, Total=2756 [2023-11-30 09:57:40,413 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 160 [2023-11-30 09:57:40,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 691 transitions, 16294 flow. Second operand has 53 states, 53 states have (on average 89.0377358490566) internal successors, (4719), 53 states have internal predecessors, (4719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:40,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:40,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 160 [2023-11-30 09:57:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:57:47,956 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 1076#true, 166#true, 133#L93-4true, 4700#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 81#L72true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:47,957 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 99#L65-2true, 376#true, 1076#true, 133#L93-4true, 4700#true, 166#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:47,957 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:47,957 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][1204], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 376#true, 1076#true, 16#L54true, 4700#true, 166#true, 133#L93-4true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 94#L70true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:47,958 INFO L294 olderBase$Statistics]: this new event has 141 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1486], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 1076#true, 79#L65-3true, 166#true, 133#L93-4true, 4700#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:47,958 INFO L294 olderBase$Statistics]: this new event has 140 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 09:57:47,958 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:48,498 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 83#L94-1true, 99#L65-2true, 376#true, 1076#true, 166#true, 4700#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4138#(<= ~n~0 2147483647), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:48,498 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-30 09:57:48,498 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 83#L94-1true, 376#true, 1076#true, 4700#true, 166#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 81#L72true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:48,499 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][1204], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 83#L94-1true, 376#true, 1076#true, 16#L54true, 166#true, 4700#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 94#L70true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:48,499 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:48,499 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:57:48,500 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 09:57:48,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1486], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 83#L94-1true, 376#true, 1076#true, 79#L65-3true, 166#true, 4700#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:48,500 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2023-11-30 09:57:48,500 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-30 09:57:48,500 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:48,500 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][1204], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 1076#true, 16#L54true, 133#L93-4true, 4700#true, 166#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 94#L70true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,185 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1352], [6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 376#true, 1076#true, 166#true, 133#L93-4true, 4700#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 87#L71-1true, 1069#true, 1080#true, 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 5010#true, 2392#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,185 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:57:49,185 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 1076#true, 166#true, 133#L93-4true, 4700#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 81#L72true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,186 INFO L294 olderBase$Statistics]: this new event has 146 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 99#L65-2true, 376#true, 1076#true, 4700#true, 133#L93-4true, 166#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,186 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1486], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 1076#true, 79#L65-3true, 166#true, 133#L93-4true, 4700#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 1080#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,186 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:49,186 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][1204], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 83#L94-1true, 376#true, 1076#true, 16#L54true, 166#true, 4700#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 94#L70true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,429 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1352], [83#L94-1true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 376#true, 1076#true, 166#true, 4700#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 87#L71-1true, 1069#true, 1080#true, 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 2392#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1)), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,429 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:57:49,429 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 83#L94-1true, 376#true, 1076#true, 4700#true, 166#true, 109#L58true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 81#L72true, 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,429 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1485], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 99#L65-2true, 83#L94-1true, 376#true, 1076#true, 4700#true, 166#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4138#(<= ~n~0 2147483647), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,430 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1486], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 83#L94-1true, 376#true, 1076#true, 79#L65-3true, 4700#true, 166#true, 109#L58true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 1080#true, 4138#(<= ~n~0 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse]) [2023-11-30 09:57:49,430 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:57:49,430 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2023-11-30 09:57:49,692 INFO L124 PetriNetUnfolderBase]: 6928/18610 cut-off events. [2023-11-30 09:57:49,692 INFO L125 PetriNetUnfolderBase]: For 632031/679296 co-relation queries the response was YES. [2023-11-30 09:57:49,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153161 conditions, 18610 events. 6928/18610 cut-off events. For 632031/679296 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 202324 event pairs, 169 based on Foata normal form. 2656/18775 useless extension candidates. Maximal degree in co-relation 115075. Up to 11637 conditions per place. [2023-11-30 09:57:49,878 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 1395 selfloop transitions, 689 changer transitions 198/2382 dead transitions. [2023-11-30 09:57:49,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 2382 transitions, 63413 flow [2023-11-30 09:57:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2023-11-30 09:57:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2023-11-30 09:57:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 10716 transitions. [2023-11-30 09:57:49,888 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5773706896551725 [2023-11-30 09:57:49,888 INFO L72 ComplementDD]: Start complementDD. Operand 116 states and 10716 transitions. [2023-11-30 09:57:49,888 INFO L73 IsDeterministic]: Start isDeterministic. Operand 116 states and 10716 transitions. [2023-11-30 09:57:49,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:57:49,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 116 states and 10716 transitions. [2023-11-30 09:57:49,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 117 states, 116 states have (on average 92.37931034482759) internal successors, (10716), 116 states have internal predecessors, (10716), 0 states have call successors, (0), 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-30 09:57:49,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 117 states, 117 states have (on average 160.0) internal successors, (18720), 117 states have internal predecessors, (18720), 0 states have call successors, (0), 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-30 09:57:49,915 INFO L81 ComplementDD]: Finished complementDD. Result has 117 states, 117 states have (on average 160.0) internal successors, (18720), 117 states have internal predecessors, (18720), 0 states have call successors, (0), 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-30 09:57:49,916 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 350 predicate places. [2023-11-30 09:57:49,916 INFO L500 AbstractCegarLoop]: Abstraction has has 483 places, 2382 transitions, 63413 flow [2023-11-30 09:57:49,917 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 89.0377358490566) internal successors, (4719), 53 states have internal predecessors, (4719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:57:49,917 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:57:49,917 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:57:49,924 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-30 09:57:50,122 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-30 09:57:50,123 INFO L425 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:57:50,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:57:50,123 INFO L85 PathProgramCache]: Analyzing trace with hash 394982080, now seen corresponding path program 2 times [2023-11-30 09:57:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:57:50,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92758550] [2023-11-30 09:57:50,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:57:50,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:57:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:57:51,131 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-30 09:57:51,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:57:51,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92758550] [2023-11-30 09:57:51,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92758550] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:57:51,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118017079] [2023-11-30 09:57:51,131 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:57:51,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:57:51,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:57:51,140 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:57:51,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-30 09:57:51,247 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:57:51,248 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:57:51,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-30 09:57:51,251 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:57:51,687 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 23 treesize of output 1 [2023-11-30 09:57:51,967 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-30 09:57:52,012 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-30 09:57:52,284 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 09:57:52,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2023-11-30 09:57:52,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:57:52,316 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:57:53,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:57:53,873 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 63 treesize of output 51 [2023-11-30 09:57:53,884 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-30 09:57:53,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 140 [2023-11-30 09:57:53,891 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 09:57:53,891 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 86 [2023-11-30 09:57:53,898 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-30 09:57:53,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 88 [2023-11-30 09:57:54,324 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-30 09:57:54,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118017079] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:57:54,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:57:54,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 21] total 66 [2023-11-30 09:57:54,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109386439] [2023-11-30 09:57:54,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:57:54,326 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2023-11-30 09:57:54,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:57:54,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2023-11-30 09:57:54,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=502, Invalid=3902, Unknown=18, NotChecked=0, Total=4422 [2023-11-30 09:57:54,329 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 160 [2023-11-30 09:57:54,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 483 places, 2382 transitions, 63413 flow. Second operand has 67 states, 67 states have (on average 81.46268656716418) internal successors, (5458), 67 states have internal predecessors, (5458), 0 states have call successors, (0), 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-30 09:57:54,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:57:54,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 160 [2023-11-30 09:57:54,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:58:07,382 INFO L124 PetriNetUnfolderBase]: 6449/17882 cut-off events. [2023-11-30 09:58:07,382 INFO L125 PetriNetUnfolderBase]: For 716490/784335 co-relation queries the response was YES. [2023-11-30 09:58:07,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153256 conditions, 17882 events. 6449/17882 cut-off events. For 716490/784335 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 197650 event pairs, 116 based on Foata normal form. 3066/18449 useless extension candidates. Maximal degree in co-relation 94957. Up to 10767 conditions per place. [2023-11-30 09:58:07,706 INFO L140 encePairwiseOnDemand]: 126/160 looper letters, 1394 selfloop transitions, 740 changer transitions 225/2456 dead transitions. [2023-11-30 09:58:07,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 2456 transitions, 67039 flow [2023-11-30 09:58:07,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2023-11-30 09:58:07,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2023-11-30 09:58:07,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 6966 transitions. [2023-11-30 09:58:07,711 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5245481927710843 [2023-11-30 09:58:07,711 INFO L72 ComplementDD]: Start complementDD. Operand 83 states and 6966 transitions. [2023-11-30 09:58:07,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 83 states and 6966 transitions. [2023-11-30 09:58:07,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:58:07,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 83 states and 6966 transitions. [2023-11-30 09:58:07,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 84 states, 83 states have (on average 83.92771084337349) internal successors, (6966), 83 states have internal predecessors, (6966), 0 states have call successors, (0), 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-30 09:58:07,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 84 states, 84 states have (on average 160.0) internal successors, (13440), 84 states have internal predecessors, (13440), 0 states have call successors, (0), 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-30 09:58:07,724 INFO L81 ComplementDD]: Finished complementDD. Result has 84 states, 84 states have (on average 160.0) internal successors, (13440), 84 states have internal predecessors, (13440), 0 states have call successors, (0), 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-30 09:58:07,725 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 401 predicate places. [2023-11-30 09:58:07,725 INFO L500 AbstractCegarLoop]: Abstraction has has 534 places, 2456 transitions, 67039 flow [2023-11-30 09:58:07,725 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 81.46268656716418) internal successors, (5458), 67 states have internal predecessors, (5458), 0 states have call successors, (0), 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-30 09:58:07,725 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:58:07,726 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:58:07,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-30 09:58:07,930 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-30 09:58:07,930 INFO L425 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:58:07,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:58:07,930 INFO L85 PathProgramCache]: Analyzing trace with hash -685213426, now seen corresponding path program 3 times [2023-11-30 09:58:07,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:58:07,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567835834] [2023-11-30 09:58:07,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:58:07,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:58:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:58:08,917 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-30 09:58:08,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:58:08,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567835834] [2023-11-30 09:58:08,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567835834] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:58:08,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360865499] [2023-11-30 09:58:08,917 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:58:08,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:58:08,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:58:08,918 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:58:08,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-30 09:58:09,024 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 09:58:09,024 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:58:09,024 INFO L262 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-30 09:58:09,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:58:09,246 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:58:09,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:58:09,359 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-30 09:58:09,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2023-11-30 09:58:09,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:58:09,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360865499] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:58:09,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:58:09,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 8, 8] total 36 [2023-11-30 09:58:09,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140949081] [2023-11-30 09:58:09,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:58:09,453 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-11-30 09:58:09,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:58:09,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-11-30 09:58:09,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1217, Unknown=0, NotChecked=0, Total=1332 [2023-11-30 09:58:09,455 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 160 [2023-11-30 09:58:09,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 2456 transitions, 67039 flow. Second operand has 37 states, 37 states have (on average 81.16216216216216) internal successors, (3003), 37 states have internal predecessors, (3003), 0 states have call successors, (0), 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-30 09:58:09,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:58:09,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 160 [2023-11-30 09:58:09,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:58:26,613 INFO L124 PetriNetUnfolderBase]: 10637/29568 cut-off events. [2023-11-30 09:58:26,613 INFO L125 PetriNetUnfolderBase]: For 1191559/1284499 co-relation queries the response was YES. [2023-11-30 09:58:26,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269261 conditions, 29568 events. 10637/29568 cut-off events. For 1191559/1284499 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 350279 event pairs, 195 based on Foata normal form. 2823/28591 useless extension candidates. Maximal degree in co-relation 132755. Up to 17762 conditions per place. [2023-11-30 09:58:27,080 INFO L140 encePairwiseOnDemand]: 132/160 looper letters, 2874 selfloop transitions, 1071 changer transitions 303/4343 dead transitions. [2023-11-30 09:58:27,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 4343 transitions, 123346 flow [2023-11-30 09:58:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2023-11-30 09:58:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2023-11-30 09:58:27,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 10362 transitions. [2023-11-30 09:58:27,097 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5265243902439024 [2023-11-30 09:58:27,097 INFO L72 ComplementDD]: Start complementDD. Operand 123 states and 10362 transitions. [2023-11-30 09:58:27,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 10362 transitions. [2023-11-30 09:58:27,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:58:27,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 123 states and 10362 transitions. [2023-11-30 09:58:27,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 124 states, 123 states have (on average 84.2439024390244) internal successors, (10362), 123 states have internal predecessors, (10362), 0 states have call successors, (0), 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-30 09:58:27,116 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 124 states, 124 states have (on average 160.0) internal successors, (19840), 124 states have internal predecessors, (19840), 0 states have call successors, (0), 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-30 09:58:27,117 INFO L81 ComplementDD]: Finished complementDD. Result has 124 states, 124 states have (on average 160.0) internal successors, (19840), 124 states have internal predecessors, (19840), 0 states have call successors, (0), 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-30 09:58:27,118 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 523 predicate places. [2023-11-30 09:58:27,118 INFO L500 AbstractCegarLoop]: Abstraction has has 656 places, 4343 transitions, 123346 flow [2023-11-30 09:58:27,118 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 81.16216216216216) internal successors, (3003), 37 states have internal predecessors, (3003), 0 states have call successors, (0), 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-30 09:58:27,118 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:58:27,118 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:58:27,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-30 09:58:27,322 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:58:27,323 INFO L425 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:58:27,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:58:27,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1952864442, now seen corresponding path program 4 times [2023-11-30 09:58:27,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:58:27,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489775604] [2023-11-30 09:58:27,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:58:27,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:58:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:58:28,306 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-30 09:58:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:58:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489775604] [2023-11-30 09:58:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489775604] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:58:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357355868] [2023-11-30 09:58:28,306 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 09:58:28,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:58:28,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:58:28,307 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:58:28,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-30 09:58:28,399 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 09:58:28,399 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:58:28,400 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 09:58:28,402 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:58:28,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:58:28,929 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 20 treesize of output 15 [2023-11-30 09:58:29,223 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 09:58:29,223 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:58:29,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:58:29,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 38 [2023-11-30 09:58:29,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2023-11-30 09:58:30,610 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-30 09:58:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357355868] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:58:30,611 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:58:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 21] total 64 [2023-11-30 09:58:30,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819722132] [2023-11-30 09:58:30,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:58:30,613 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2023-11-30 09:58:30,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:58:30,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2023-11-30 09:58:30,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=3929, Unknown=1, NotChecked=0, Total=4160 [2023-11-30 09:58:30,616 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 160 [2023-11-30 09:58:30,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 4343 transitions, 123346 flow. Second operand has 65 states, 65 states have (on average 79.56923076923077) internal successors, (5172), 65 states have internal predecessors, (5172), 0 states have call successors, (0), 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-30 09:58:30,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:58:30,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 160 [2023-11-30 09:58:30,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:58:51,934 INFO L124 PetriNetUnfolderBase]: 8085/21659 cut-off events. [2023-11-30 09:58:51,935 INFO L125 PetriNetUnfolderBase]: For 1131824/1225169 co-relation queries the response was YES. [2023-11-30 09:58:52,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217269 conditions, 21659 events. 8085/21659 cut-off events. For 1131824/1225169 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 237119 event pairs, 154 based on Foata normal form. 2220/21262 useless extension candidates. Maximal degree in co-relation 107042. Up to 12940 conditions per place. [2023-11-30 09:58:52,202 INFO L140 encePairwiseOnDemand]: 125/160 looper letters, 2534 selfloop transitions, 463 changer transitions 293/3384 dead transitions. [2023-11-30 09:58:52,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 3384 transitions, 101883 flow [2023-11-30 09:58:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2023-11-30 09:58:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2023-11-30 09:58:52,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 6646 transitions. [2023-11-30 09:58:52,206 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5065548780487805 [2023-11-30 09:58:52,206 INFO L72 ComplementDD]: Start complementDD. Operand 82 states and 6646 transitions. [2023-11-30 09:58:52,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 82 states and 6646 transitions. [2023-11-30 09:58:52,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:58:52,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 82 states and 6646 transitions. [2023-11-30 09:58:52,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 83 states, 82 states have (on average 81.04878048780488) internal successors, (6646), 82 states have internal predecessors, (6646), 0 states have call successors, (0), 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-30 09:58:52,228 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 83 states, 83 states have (on average 160.0) internal successors, (13280), 83 states have internal predecessors, (13280), 0 states have call successors, (0), 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-30 09:58:52,228 INFO L81 ComplementDD]: Finished complementDD. Result has 83 states, 83 states have (on average 160.0) internal successors, (13280), 83 states have internal predecessors, (13280), 0 states have call successors, (0), 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-30 09:58:52,228 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 580 predicate places. [2023-11-30 09:58:52,228 INFO L500 AbstractCegarLoop]: Abstraction has has 713 places, 3384 transitions, 101883 flow [2023-11-30 09:58:52,229 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 79.56923076923077) internal successors, (5172), 65 states have internal predecessors, (5172), 0 states have call successors, (0), 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-30 09:58:52,229 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:58:52,229 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:58:52,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-11-30 09:58:52,434 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:58:52,434 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:58:52,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:58:52,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1839892749, now seen corresponding path program 1 times [2023-11-30 09:58:52,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:58:52,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218055574] [2023-11-30 09:58:52,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:58:52,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:58:52,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:58:53,368 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:58:53,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:58:53,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218055574] [2023-11-30 09:58:53,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218055574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:58:53,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617775365] [2023-11-30 09:58:53,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:58:53,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:58:53,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:58:53,370 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:58:53,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-30 09:58:53,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:58:53,488 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-30 09:58:53,490 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:58:54,132 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:58:54,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:58:54,353 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:58:54,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 51 [2023-11-30 09:58:55,343 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:58:55,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617775365] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:58:55,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:58:55,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 16] total 52 [2023-11-30 09:58:55,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840103167] [2023-11-30 09:58:55,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:58:55,344 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-30 09:58:55,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:58:55,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-30 09:58:55,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=2401, Unknown=0, NotChecked=0, Total=2756 [2023-11-30 09:58:55,346 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 160 [2023-11-30 09:58:55,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 3384 transitions, 101883 flow. Second operand has 53 states, 53 states have (on average 89.09433962264151) internal successors, (4722), 53 states have internal predecessors, (4722), 0 states have call successors, (0), 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-30 09:58:55,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:58:55,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 160 [2023-11-30 09:58:55,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:59:10,299 INFO L124 PetriNetUnfolderBase]: 8166/21990 cut-off events. [2023-11-30 09:59:10,299 INFO L125 PetriNetUnfolderBase]: For 1168968/1246029 co-relation queries the response was YES. [2023-11-30 09:59:10,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231967 conditions, 21990 events. 8166/21990 cut-off events. For 1168968/1246029 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 241242 event pairs, 172 based on Foata normal form. 2506/21925 useless extension candidates. Maximal degree in co-relation 113085. Up to 13102 conditions per place. [2023-11-30 09:59:10,593 INFO L140 encePairwiseOnDemand]: 131/160 looper letters, 2198 selfloop transitions, 822 changer transitions 357/3477 dead transitions. [2023-11-30 09:59:10,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 790 places, 3477 transitions, 111466 flow [2023-11-30 09:59:10,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2023-11-30 09:59:10,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2023-11-30 09:59:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 7110 transitions. [2023-11-30 09:59:10,598 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5697115384615384 [2023-11-30 09:59:10,598 INFO L72 ComplementDD]: Start complementDD. Operand 78 states and 7110 transitions. [2023-11-30 09:59:10,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 7110 transitions. [2023-11-30 09:59:10,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:59:10,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 78 states and 7110 transitions. [2023-11-30 09:59:10,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 79 states, 78 states have (on average 91.15384615384616) internal successors, (7110), 78 states have internal predecessors, (7110), 0 states have call successors, (0), 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-30 09:59:10,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 79 states, 79 states have (on average 160.0) internal successors, (12640), 79 states have internal predecessors, (12640), 0 states have call successors, (0), 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-30 09:59:10,609 INFO L81 ComplementDD]: Finished complementDD. Result has 79 states, 79 states have (on average 160.0) internal successors, (12640), 79 states have internal predecessors, (12640), 0 states have call successors, (0), 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-30 09:59:10,610 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 657 predicate places. [2023-11-30 09:59:10,610 INFO L500 AbstractCegarLoop]: Abstraction has has 790 places, 3477 transitions, 111466 flow [2023-11-30 09:59:10,610 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 89.09433962264151) internal successors, (4722), 53 states have internal predecessors, (4722), 0 states have call successors, (0), 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-30 09:59:10,610 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:59:10,611 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:59:10,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-11-30 09:59:10,819 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:59:10,819 INFO L425 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:59:10,820 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:59:10,820 INFO L85 PathProgramCache]: Analyzing trace with hash -2124599777, now seen corresponding path program 2 times [2023-11-30 09:59:10,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:59:10,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822901094] [2023-11-30 09:59:10,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:59:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:59:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:59:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:59:11,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:59:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822901094] [2023-11-30 09:59:11,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822901094] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:59:11,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426381316] [2023-11-30 09:59:11,619 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:59:11,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:59:11,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:59:11,620 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:59:11,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-30 09:59:11,712 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:59:11,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:59:11,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-30 09:59:11,715 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:59:12,445 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 23 treesize of output 1 [2023-11-30 09:59:12,776 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-30 09:59:12,832 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-30 09:59:13,161 INFO L349 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2023-11-30 09:59:13,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 13 [2023-11-30 09:59:13,188 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:59:13,188 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:59:14,485 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:59:14,486 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 120 treesize of output 84 [2023-11-30 09:59:14,507 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:59:14,508 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 254 treesize of output 257 [2023-11-30 09:59:14,574 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:59:14,574 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 207 [2023-11-30 09:59:14,606 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:59:14,607 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 4 new quantified variables, introduced 6 case distinctions, treesize of input 144 treesize of output 155 [2023-11-30 09:59:16,639 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:59:16,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426381316] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:59:16,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:59:16,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 22] total 67 [2023-11-30 09:59:16,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628566182] [2023-11-30 09:59:16,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:59:16,640 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-30 09:59:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:59:16,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-30 09:59:16,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=433, Invalid=4099, Unknown=24, NotChecked=0, Total=4556 [2023-11-30 09:59:16,643 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 160 [2023-11-30 09:59:16,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 790 places, 3477 transitions, 111466 flow. Second operand has 68 states, 68 states have (on average 81.51470588235294) internal successors, (5543), 68 states have internal predecessors, (5543), 0 states have call successors, (0), 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-30 09:59:16,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:59:16,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 160 [2023-11-30 09:59:16,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:59:24,822 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-30 09:59:27,509 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-30 09:59:40,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1880], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:40,843 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1880], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:40,843 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][2031], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:40,843 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2023-11-30 09:59:40,843 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1880], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 83#L94-1true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:41,140 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][1880], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:41,140 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 09:59:41,140 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:59:41,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][2031], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647)]) [2023-11-30 09:59:41,141 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2023-11-30 09:59:41,141 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2023-11-30 09:59:41,141 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 09:59:41,141 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 09:59:41,603 INFO L124 PetriNetUnfolderBase]: 7172/19646 cut-off events. [2023-11-30 09:59:41,603 INFO L125 PetriNetUnfolderBase]: For 1107092/1163180 co-relation queries the response was YES. [2023-11-30 09:59:41,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216874 conditions, 19646 events. 7172/19646 cut-off events. For 1107092/1163180 co-relation queries the response was YES. Maximal size of possible extension queue 625. Compared 212615 event pairs, 152 based on Foata normal form. 2332/19722 useless extension candidates. Maximal degree in co-relation 124053. Up to 11269 conditions per place. [2023-11-30 09:59:41,841 INFO L140 encePairwiseOnDemand]: 126/160 looper letters, 2086 selfloop transitions, 733 changer transitions 442/3358 dead transitions. [2023-11-30 09:59:41,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 880 places, 3358 transitions, 111948 flow [2023-11-30 09:59:41,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2023-11-30 09:59:41,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2023-11-30 09:59:41,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 7697 transitions. [2023-11-30 09:59:41,845 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5228940217391305 [2023-11-30 09:59:41,845 INFO L72 ComplementDD]: Start complementDD. Operand 92 states and 7697 transitions. [2023-11-30 09:59:41,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 7697 transitions. [2023-11-30 09:59:41,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:59:41,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 92 states and 7697 transitions. [2023-11-30 09:59:41,850 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 93 states, 92 states have (on average 83.66304347826087) internal successors, (7697), 92 states have internal predecessors, (7697), 0 states have call successors, (0), 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-30 09:59:41,857 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 93 states, 93 states have (on average 160.0) internal successors, (14880), 93 states have internal predecessors, (14880), 0 states have call successors, (0), 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-30 09:59:41,857 INFO L81 ComplementDD]: Finished complementDD. Result has 93 states, 93 states have (on average 160.0) internal successors, (14880), 93 states have internal predecessors, (14880), 0 states have call successors, (0), 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-30 09:59:41,858 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 747 predicate places. [2023-11-30 09:59:41,858 INFO L500 AbstractCegarLoop]: Abstraction has has 880 places, 3358 transitions, 111948 flow [2023-11-30 09:59:41,858 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 81.51470588235294) internal successors, (5543), 68 states have internal predecessors, (5543), 0 states have call successors, (0), 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-30 09:59:41,858 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:59:41,858 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 09:59:41,882 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2023-11-30 09:59:42,063 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:59:42,063 INFO L425 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:59:42,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:59:42,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1098657805, now seen corresponding path program 3 times [2023-11-30 09:59:42,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:59:42,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126186719] [2023-11-30 09:59:42,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:59:42,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:59:42,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:59:43,708 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:59:43,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:59:43,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126186719] [2023-11-30 09:59:43,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126186719] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:59:43,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502657370] [2023-11-30 09:59:43,715 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:59:43,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:59:43,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:59:43,716 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 09:59:43,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-30 09:59:43,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 09:59:43,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:59:43,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-30 09:59:43,832 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:59:44,350 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:59:44,351 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 20 treesize of output 15 [2023-11-30 09:59:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:59:44,587 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:59:44,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:59:44,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 98 treesize of output 100 [2023-11-30 09:59:44,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:59:44,931 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 49 treesize of output 47 [2023-11-30 09:59:45,529 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:59:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502657370] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:59:45,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:59:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 15, 15] total 56 [2023-11-30 09:59:45,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882939229] [2023-11-30 09:59:45,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:59:45,531 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-11-30 09:59:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:59:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-11-30 09:59:45,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=2966, Unknown=11, NotChecked=0, Total=3192 [2023-11-30 09:59:45,535 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 160 [2023-11-30 09:59:45,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 880 places, 3358 transitions, 111948 flow. Second operand has 57 states, 57 states have (on average 76.01754385964912) internal successors, (4333), 57 states have internal predecessors, (4333), 0 states have call successors, (0), 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-30 09:59:45,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:59:45,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 160 [2023-11-30 09:59:45,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:59:51,686 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-30 09:59:53,857 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-30 09:59:55,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:00:01,708 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-30 10:00:04,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:00:07,373 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-30 10:00:14,962 INFO L124 PetriNetUnfolderBase]: 7949/21390 cut-off events. [2023-11-30 10:00:14,962 INFO L125 PetriNetUnfolderBase]: For 1361360/1428261 co-relation queries the response was YES. [2023-11-30 10:00:15,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251708 conditions, 21390 events. 7949/21390 cut-off events. For 1361360/1428261 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 232431 event pairs, 176 based on Foata normal form. 2096/21146 useless extension candidates. Maximal degree in co-relation 150907. Up to 12398 conditions per place. [2023-11-30 10:00:15,395 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 2350 selfloop transitions, 635 changer transitions 555/3625 dead transitions. [2023-11-30 10:00:15,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 3625 transitions, 129525 flow [2023-11-30 10:00:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-30 10:00:15,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-11-30 10:00:15,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 5886 transitions. [2023-11-30 10:00:15,399 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.4905 [2023-11-30 10:00:15,399 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 5886 transitions. [2023-11-30 10:00:15,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 5886 transitions. [2023-11-30 10:00:15,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:00:15,400 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 5886 transitions. [2023-11-30 10:00:15,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 78.48) internal successors, (5886), 75 states have internal predecessors, (5886), 0 states have call successors, (0), 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-30 10:00:15,408 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 160.0) internal successors, (12160), 76 states have internal predecessors, (12160), 0 states have call successors, (0), 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-30 10:00:15,409 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 160.0) internal successors, (12160), 76 states have internal predecessors, (12160), 0 states have call successors, (0), 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-30 10:00:15,409 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 821 predicate places. [2023-11-30 10:00:15,409 INFO L500 AbstractCegarLoop]: Abstraction has has 954 places, 3625 transitions, 129525 flow [2023-11-30 10:00:15,410 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 76.01754385964912) internal successors, (4333), 57 states have internal predecessors, (4333), 0 states have call successors, (0), 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-30 10:00:15,410 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:00:15,410 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:00:15,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-11-30 10:00:15,614 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:00:15,614 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:00:15,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:00:15,615 INFO L85 PathProgramCache]: Analyzing trace with hash 263683389, now seen corresponding path program 4 times [2023-11-30 10:00:15,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:00:15,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433555113] [2023-11-30 10:00:15,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:00:15,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:00:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:00:15,765 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:00:15,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:00:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433555113] [2023-11-30 10:00:15,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433555113] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:00:15,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531037808] [2023-11-30 10:00:15,765 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 10:00:15,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:00:15,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:00:15,766 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:00:15,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-30 10:00:15,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 10:00:15,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 10:00:15,866 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-30 10:00:15,867 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:00:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:00:16,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:00:16,403 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:00:16,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531037808] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:00:16,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:00:16,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 29 [2023-11-30 10:00:16,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828313484] [2023-11-30 10:00:16,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:00:16,404 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-30 10:00:16,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:00:16,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-30 10:00:16,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=668, Unknown=0, NotChecked=0, Total=812 [2023-11-30 10:00:16,406 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 160 [2023-11-30 10:00:16,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 954 places, 3625 transitions, 129525 flow. Second operand has 29 states, 29 states have (on average 114.82758620689656) internal successors, (3330), 29 states have internal predecessors, (3330), 0 states have call successors, (0), 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-30 10:00:16,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:00:16,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 160 [2023-11-30 10:00:16,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:00:26,353 INFO L124 PetriNetUnfolderBase]: 6969/18925 cut-off events. [2023-11-30 10:00:26,353 INFO L125 PetriNetUnfolderBase]: For 1453714/1507157 co-relation queries the response was YES. [2023-11-30 10:00:26,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227592 conditions, 18925 events. 6969/18925 cut-off events. For 1453714/1507157 co-relation queries the response was YES. Maximal size of possible extension queue 532. Compared 199102 event pairs, 137 based on Foata normal form. 516/17474 useless extension candidates. Maximal degree in co-relation 155424. Up to 11198 conditions per place. [2023-11-30 10:00:26,575 INFO L140 encePairwiseOnDemand]: 142/160 looper letters, 1043 selfloop transitions, 236 changer transitions 1015/3253 dead transitions. [2023-11-30 10:00:26,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 969 places, 3253 transitions, 119798 flow [2023-11-30 10:00:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-30 10:00:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2023-11-30 10:00:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3228 transitions. [2023-11-30 10:00:26,577 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7205357142857143 [2023-11-30 10:00:26,577 INFO L72 ComplementDD]: Start complementDD. Operand 28 states and 3228 transitions. [2023-11-30 10:00:26,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 3228 transitions. [2023-11-30 10:00:26,578 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:00:26,578 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3228 transitions. [2023-11-30 10:00:26,580 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 29 states, 28 states have (on average 115.28571428571429) internal successors, (3228), 28 states have internal predecessors, (3228), 0 states have call successors, (0), 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-30 10:00:26,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 29 states, 29 states have (on average 160.0) internal successors, (4640), 29 states have internal predecessors, (4640), 0 states have call successors, (0), 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-30 10:00:26,582 INFO L81 ComplementDD]: Finished complementDD. Result has 29 states, 29 states have (on average 160.0) internal successors, (4640), 29 states have internal predecessors, (4640), 0 states have call successors, (0), 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-30 10:00:26,582 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 836 predicate places. [2023-11-30 10:00:26,582 INFO L500 AbstractCegarLoop]: Abstraction has has 969 places, 3253 transitions, 119798 flow [2023-11-30 10:00:26,583 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 114.82758620689656) internal successors, (3330), 29 states have internal predecessors, (3330), 0 states have call successors, (0), 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-30 10:00:26,583 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:00:26,583 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 10:00:26,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-30 10:00:26,788 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:00:26,788 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:00:26,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:00:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 680076934, now seen corresponding path program 5 times [2023-11-30 10:00:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:00:26,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591093504] [2023-11-30 10:00:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:00:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:00:26,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:00:27,902 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:00:27,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:00:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591093504] [2023-11-30 10:00:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591093504] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:00:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139966166] [2023-11-30 10:00:27,903 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 10:00:27,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:00:27,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:00:27,903 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:00:27,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-30 10:00:27,988 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-30 10:00:27,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 10:00:27,989 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-30 10:00:27,991 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:00:28,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 10:00:28,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 10:00:28,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 10:00:28,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-30 10:00:28,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:00:28,873 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:00:29,197 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~q_front~0 4))) (let ((.cse1 (+ c_~q~0.offset (* 4 c_~q_back~0))) (.cse4 (+ .cse7 c_~q~0.offset 4)) (.cse2 (+ .cse7 c_~q~0.offset))) (and (forall ((v_ArrVal_578 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base))) (let ((.cse3 (select .cse0 .cse4))) (or (not (= (select .cse0 .cse1) 1)) (< 0 (+ c_~s~0 2147483649 (select .cse0 .cse2) .cse3)) (< 0 (+ c_~s~0 .cse3 2147483650)))))) (forall ((v_ArrVal_578 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_578) c_~q~0.base))) (let ((.cse6 (select .cse5 .cse2))) (or (not (= (select .cse5 .cse1) 1)) (< 0 (+ .cse6 1)) (< 0 (+ c_~s~0 2147483649 .cse6 (select .cse5 .cse4)))))))))) is different from false [2023-11-30 10:00:29,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:00:29,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 260 treesize of output 219 [2023-11-30 10:00:29,316 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:00:29,316 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 174 treesize of output 166 [2023-11-30 10:00:29,329 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:00:29,329 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 147 treesize of output 140 [2023-11-30 10:00:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:00:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139966166] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:00:30,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:00:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 16] total 57 [2023-11-30 10:00:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015192797] [2023-11-30 10:00:30,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:00:30,354 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-30 10:00:30,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:00:30,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-30 10:00:30,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=2924, Unknown=1, NotChecked=110, Total=3306 [2023-11-30 10:00:30,357 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 160 [2023-11-30 10:00:30,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 969 places, 3253 transitions, 119798 flow. Second operand has 58 states, 58 states have (on average 81.03448275862068) internal successors, (4700), 58 states have internal predecessors, (4700), 0 states have call successors, (0), 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-30 10:00:30,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:00:30,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 160 [2023-11-30 10:00:30,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:00:55,626 INFO L124 PetriNetUnfolderBase]: 12141/33127 cut-off events. [2023-11-30 10:00:55,626 INFO L125 PetriNetUnfolderBase]: For 2517552/2610656 co-relation queries the response was YES. [2023-11-30 10:00:55,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410236 conditions, 33127 events. 12141/33127 cut-off events. For 2517552/2610656 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 381262 event pairs, 222 based on Foata normal form. 3079/33107 useless extension candidates. Maximal degree in co-relation 197514. Up to 20286 conditions per place. [2023-11-30 10:00:56,160 INFO L140 encePairwiseOnDemand]: 131/160 looper letters, 2718 selfloop transitions, 1710 changer transitions 1078/5604 dead transitions. [2023-11-30 10:00:56,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1059 places, 5604 transitions, 220534 flow [2023-11-30 10:00:56,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2023-11-30 10:00:56,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2023-11-30 10:00:56,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 8377 transitions. [2023-11-30 10:00:56,165 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5235625 [2023-11-30 10:00:56,165 INFO L72 ComplementDD]: Start complementDD. Operand 100 states and 8377 transitions. [2023-11-30 10:00:56,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 100 states and 8377 transitions. [2023-11-30 10:00:56,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:00:56,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 100 states and 8377 transitions. [2023-11-30 10:00:56,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 101 states, 100 states have (on average 83.77) internal successors, (8377), 100 states have internal predecessors, (8377), 0 states have call successors, (0), 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-30 10:00:56,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 101 states, 101 states have (on average 160.0) internal successors, (16160), 101 states have internal predecessors, (16160), 0 states have call successors, (0), 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-30 10:00:56,182 INFO L81 ComplementDD]: Finished complementDD. Result has 101 states, 101 states have (on average 160.0) internal successors, (16160), 101 states have internal predecessors, (16160), 0 states have call successors, (0), 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-30 10:00:56,182 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 926 predicate places. [2023-11-30 10:00:56,182 INFO L500 AbstractCegarLoop]: Abstraction has has 1059 places, 5604 transitions, 220534 flow [2023-11-30 10:00:56,183 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 81.03448275862068) internal successors, (4700), 58 states have internal predecessors, (4700), 0 states have call successors, (0), 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-30 10:00:56,183 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:00:56,183 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 10:00:56,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-30 10:00:56,383 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-30 10:00:56,384 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:00:56,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:00:56,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1732959634, now seen corresponding path program 6 times [2023-11-30 10:00:56,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:00:56,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650435400] [2023-11-30 10:00:56,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:00:56,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:00:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:00:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:00:57,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:00:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650435400] [2023-11-30 10:00:57,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650435400] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:00:57,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168467912] [2023-11-30 10:00:57,490 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 10:00:57,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:00:57,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:00:57,491 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:00:57,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-30 10:00:57,614 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-30 10:00:57,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 10:00:57,616 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-30 10:00:57,622 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:00:57,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 10:00:57,706 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 10:00:57,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 10:00:58,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2023-11-30 10:00:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:00:58,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:00:58,369 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_612 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_612) c_~q~0.base) (+ (* c_~q_front~0 4) c_~q~0.offset 4)) 1))) is different from false [2023-11-30 10:00:58,381 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:00:58,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 41 [2023-11-30 10:00:58,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2023-11-30 10:00:58,659 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:00:58,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168467912] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:00:58,659 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:00:58,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 16, 15] total 47 [2023-11-30 10:00:58,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295299024] [2023-11-30 10:00:58,660 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:00:58,660 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-11-30 10:00:58,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:00:58,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-11-30 10:00:58,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2014, Unknown=1, NotChecked=90, Total=2256 [2023-11-30 10:00:58,662 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 160 [2023-11-30 10:00:58,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1059 places, 5604 transitions, 220534 flow. Second operand has 48 states, 48 states have (on average 79.79166666666667) internal successors, (3830), 48 states have internal predecessors, (3830), 0 states have call successors, (0), 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-30 10:00:58,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:00:58,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 160 [2023-11-30 10:00:58,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:01:45,713 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4342], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:01:45,713 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:01:45,713 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:01:45,713 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:01:45,714 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:01:46,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4342], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:01:46,051 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:01:46,051 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:01:46,053 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:01:46,053 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:01:46,322 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4341], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:01:46,322 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:01:46,322 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:01:46,322 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:01:46,322 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:01:46,511 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4342], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:01:46,511 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:01:46,511 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 10:01:46,511 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:01:46,511 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:01:46,733 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4342], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 83#L94-1true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:01:46,733 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:01:46,733 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:01:46,733 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:01:46,733 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:01:46,885 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4341], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:01:46,885 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 10:01:46,886 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:01:46,886 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:01:46,886 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 10:01:47,561 INFO L124 PetriNetUnfolderBase]: 15588/41965 cut-off events. [2023-11-30 10:01:47,562 INFO L125 PetriNetUnfolderBase]: For 3624908/3761915 co-relation queries the response was YES. [2023-11-30 10:01:47,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 545869 conditions, 41965 events. 15588/41965 cut-off events. For 3624908/3761915 co-relation queries the response was YES. Maximal size of possible extension queue 1158. Compared 496228 event pairs, 418 based on Foata normal form. 3032/41004 useless extension candidates. Maximal degree in co-relation 247905. Up to 25871 conditions per place. [2023-11-30 10:01:48,386 INFO L140 encePairwiseOnDemand]: 132/160 looper letters, 3587 selfloop transitions, 2176 changer transitions 1120/6980 dead transitions. [2023-11-30 10:01:48,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1138 places, 6980 transitions, 289915 flow [2023-11-30 10:01:48,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2023-11-30 10:01:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2023-11-30 10:01:48,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 6629 transitions. [2023-11-30 10:01:48,407 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.517890625 [2023-11-30 10:01:48,407 INFO L72 ComplementDD]: Start complementDD. Operand 80 states and 6629 transitions. [2023-11-30 10:01:48,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 6629 transitions. [2023-11-30 10:01:48,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:01:48,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 80 states and 6629 transitions. [2023-11-30 10:01:48,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 81 states, 80 states have (on average 82.8625) internal successors, (6629), 80 states have internal predecessors, (6629), 0 states have call successors, (0), 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-30 10:01:48,418 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 81 states, 81 states have (on average 160.0) internal successors, (12960), 81 states have internal predecessors, (12960), 0 states have call successors, (0), 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-30 10:01:48,418 INFO L81 ComplementDD]: Finished complementDD. Result has 81 states, 81 states have (on average 160.0) internal successors, (12960), 81 states have internal predecessors, (12960), 0 states have call successors, (0), 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-30 10:01:48,418 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1005 predicate places. [2023-11-30 10:01:48,419 INFO L500 AbstractCegarLoop]: Abstraction has has 1138 places, 6980 transitions, 289915 flow [2023-11-30 10:01:48,419 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 79.79166666666667) internal successors, (3830), 48 states have internal predecessors, (3830), 0 states have call successors, (0), 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-30 10:01:48,419 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:01:48,419 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 10:01:48,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-11-30 10:01:48,637 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-30 10:01:48,637 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:01:48,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:01:48,637 INFO L85 PathProgramCache]: Analyzing trace with hash -2112825617, now seen corresponding path program 5 times [2023-11-30 10:01:48,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:01:48,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219278327] [2023-11-30 10:01:48,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:01:48,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:01:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:01:50,078 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:01:50,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:01:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219278327] [2023-11-30 10:01:50,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219278327] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:01:50,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201636230] [2023-11-30 10:01:50,079 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 10:01:50,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:01:50,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:01:50,079 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:01:50,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-11-30 10:01:50,185 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-30 10:01:50,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 10:01:50,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 41 conjunts are in the unsatisfiable core [2023-11-30 10:01:50,188 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:01:50,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-30 10:01:50,326 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 10:01:50,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-30 10:01:50,794 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 32 treesize of output 25 [2023-11-30 10:01:51,046 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:01:51,047 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:01:51,144 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_646 (Array Int Int))) (< (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_646) c_~q~0.base)) (.cse1 (* c_~q_front~0 4))) (+ c_~s~0 (select .cse0 (+ .cse1 c_~q~0.offset 4)) (select .cse0 (+ .cse1 c_~q~0.offset)))) 2147483648)) is different from false [2023-11-30 10:01:51,217 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:01:51,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 79 [2023-11-30 10:01:51,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:01:51,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 6 [2023-11-30 10:01:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:01:51,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201636230] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:01:51,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:01:51,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 15] total 58 [2023-11-30 10:01:51,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177966338] [2023-11-30 10:01:51,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:01:51,612 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-30 10:01:51,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:01:51,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-30 10:01:51,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=2998, Unknown=1, NotChecked=112, Total=3422 [2023-11-30 10:01:51,615 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 160 [2023-11-30 10:01:51,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1138 places, 6980 transitions, 289915 flow. Second operand has 59 states, 59 states have (on average 81.03389830508475) internal successors, (4781), 59 states have internal predecessors, (4781), 0 states have call successors, (0), 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-30 10:01:51,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:01:51,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 160 [2023-11-30 10:01:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:02:59,364 INFO L124 PetriNetUnfolderBase]: 17239/46152 cut-off events. [2023-11-30 10:02:59,364 INFO L125 PetriNetUnfolderBase]: For 4409993/4577117 co-relation queries the response was YES. [2023-11-30 10:02:59,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628598 conditions, 46152 events. 17239/46152 cut-off events. For 4409993/4577117 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 555730 event pairs, 481 based on Foata normal form. 3682/45606 useless extension candidates. Maximal degree in co-relation 285873. Up to 28205 conditions per place. [2023-11-30 10:03:00,166 INFO L140 encePairwiseOnDemand]: 130/160 looper letters, 5092 selfloop transitions, 1356 changer transitions 1120/7675 dead transitions. [2023-11-30 10:03:00,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1207 places, 7675 transitions, 335045 flow [2023-11-30 10:03:00,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-30 10:03:00,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-30 10:03:00,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 5805 transitions. [2023-11-30 10:03:00,169 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5183035714285714 [2023-11-30 10:03:00,169 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 5805 transitions. [2023-11-30 10:03:00,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 5805 transitions. [2023-11-30 10:03:00,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:03:00,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 5805 transitions. [2023-11-30 10:03:00,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 82.92857142857143) internal successors, (5805), 70 states have internal predecessors, (5805), 0 states have call successors, (0), 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-30 10:03:00,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 160.0) internal successors, (11360), 71 states have internal predecessors, (11360), 0 states have call successors, (0), 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-30 10:03:00,178 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 160.0) internal successors, (11360), 71 states have internal predecessors, (11360), 0 states have call successors, (0), 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-30 10:03:00,178 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1074 predicate places. [2023-11-30 10:03:00,179 INFO L500 AbstractCegarLoop]: Abstraction has has 1207 places, 7675 transitions, 335045 flow [2023-11-30 10:03:00,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 81.03389830508475) internal successors, (4781), 59 states have internal predecessors, (4781), 0 states have call successors, (0), 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-30 10:03:00,179 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:03:00,179 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 10:03:00,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2023-11-30 10:03:00,379 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-30 10:03:00,380 INFO L425 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:03:00,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:03:00,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1567011079, now seen corresponding path program 1 times [2023-11-30 10:03:00,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:03:00,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483267976] [2023-11-30 10:03:00,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:03:00,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:03:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:03:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:03:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:03:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483267976] [2023-11-30 10:03:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483267976] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:03:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351362139] [2023-11-30 10:03:01,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:03:01,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:03:01,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:03:01,941 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:03:01,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2023-11-30 10:03:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:03:02,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-30 10:03:02,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:03:03,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 10:03:03,054 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 32 treesize of output 25 [2023-11-30 10:03:03,321 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:03:03,321 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:03:03,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:03:03,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 205 treesize of output 173 [2023-11-30 10:03:03,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:03:03,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 105 [2023-11-30 10:03:03,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:03:03,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 85 [2023-11-30 10:03:06,047 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:03:06,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351362139] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:03:06,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:03:06,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 26] total 78 [2023-11-30 10:03:06,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464801369] [2023-11-30 10:03:06,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:03:06,048 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2023-11-30 10:03:06,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:03:06,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2023-11-30 10:03:06,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=5753, Unknown=1, NotChecked=0, Total=6162 [2023-11-30 10:03:06,052 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 160 [2023-11-30 10:03:06,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1207 places, 7675 transitions, 335045 flow. Second operand has 79 states, 79 states have (on average 78.43037974683544) internal successors, (6196), 79 states have internal predecessors, (6196), 0 states have call successors, (0), 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-30 10:03:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:03:06,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 160 [2023-11-30 10:03:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:03:15,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:04:53,848 INFO L124 PetriNetUnfolderBase]: 18733/50599 cut-off events. [2023-11-30 10:04:53,848 INFO L125 PetriNetUnfolderBase]: For 5110366/5290492 co-relation queries the response was YES. [2023-11-30 10:04:54,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716517 conditions, 50599 events. 18733/50599 cut-off events. For 5110366/5290492 co-relation queries the response was YES. Maximal size of possible extension queue 1588. Compared 624468 event pairs, 538 based on Foata normal form. 4772/50843 useless extension candidates. Maximal degree in co-relation 326073. Up to 30164 conditions per place. [2023-11-30 10:04:54,752 INFO L140 encePairwiseOnDemand]: 126/160 looper letters, 4776 selfloop transitions, 2667 changer transitions 1292/8841 dead transitions. [2023-11-30 10:04:54,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1333 places, 8841 transitions, 401524 flow [2023-11-30 10:04:54,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-11-30 10:04:54,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-11-30 10:04:54,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 10265 transitions. [2023-11-30 10:04:54,758 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5051673228346457 [2023-11-30 10:04:54,758 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 10265 transitions. [2023-11-30 10:04:54,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 10265 transitions. [2023-11-30 10:04:54,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:04:54,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 10265 transitions. [2023-11-30 10:04:54,793 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 80.8267716535433) internal successors, (10265), 127 states have internal predecessors, (10265), 0 states have call successors, (0), 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-30 10:04:54,802 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 160.0) internal successors, (20480), 128 states have internal predecessors, (20480), 0 states have call successors, (0), 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-30 10:04:54,803 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 160.0) internal successors, (20480), 128 states have internal predecessors, (20480), 0 states have call successors, (0), 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-30 10:04:54,807 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1200 predicate places. [2023-11-30 10:04:54,807 INFO L500 AbstractCegarLoop]: Abstraction has has 1333 places, 8841 transitions, 401524 flow [2023-11-30 10:04:54,807 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 78.43037974683544) internal successors, (6196), 79 states have internal predecessors, (6196), 0 states have call successors, (0), 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-30 10:04:54,808 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:04:54,808 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 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] [2023-11-30 10:04:54,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2023-11-30 10:04:55,022 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:04:55,022 INFO L425 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:04:55,022 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:04:55,022 INFO L85 PathProgramCache]: Analyzing trace with hash -553223982, now seen corresponding path program 1 times [2023-11-30 10:04:55,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:04:55,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315122348] [2023-11-30 10:04:55,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:04:55,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:04:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:04:55,316 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 19 proven. 44 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-30 10:04:55,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:04:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315122348] [2023-11-30 10:04:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315122348] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:04:55,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895778029] [2023-11-30 10:04:55,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:04:55,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:04:55,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:04:55,317 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:04:55,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2023-11-30 10:04:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:04:55,421 INFO L262 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-30 10:04:55,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:04:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 49 proven. 12 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-30 10:04:55,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:04:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 38 proven. 23 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-11-30 10:04:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895778029] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:04:55,887 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:04:55,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 28 [2023-11-30 10:04:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488726988] [2023-11-30 10:04:55,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:04:55,887 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-30 10:04:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:04:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-30 10:04:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=611, Unknown=0, NotChecked=0, Total=756 [2023-11-30 10:04:55,889 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 160 [2023-11-30 10:04:55,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1333 places, 8841 transitions, 401524 flow. Second operand has 28 states, 28 states have (on average 116.82142857142857) internal successors, (3271), 28 states have internal predecessors, (3271), 0 states have call successors, (0), 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-30 10:04:55,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:04:55,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 160 [2023-11-30 10:04:55,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:06:03,779 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4857], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:06:03,780 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:06:03,780 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:06:03,780 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:06:03,780 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:06:04,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4857], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:06:04,353 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:06:04,353 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:06:04,353 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:06:04,353 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:06:04,791 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4858], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:06:04,791 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:06:04,791 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:06:04,791 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:06:04,791 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:06:05,069 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4857], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:06:05,069 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:06:05,069 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:06:05,069 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:06:05,070 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 10:06:05,381 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4857], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:06:05,381 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:06:05,381 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:06:05,381 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:06:05,381 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:06:05,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4858], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:06:05,827 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 10:06:05,827 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:06:05,827 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 10:06:05,827 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:06:06,847 INFO L124 PetriNetUnfolderBase]: 18055/48301 cut-off events. [2023-11-30 10:06:06,847 INFO L125 PetriNetUnfolderBase]: For 5512335/5676972 co-relation queries the response was YES. [2023-11-30 10:06:07,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701612 conditions, 48301 events. 18055/48301 cut-off events. For 5512335/5676972 co-relation queries the response was YES. Maximal size of possible extension queue 1590. Compared 591249 event pairs, 497 based on Foata normal form. 754/44651 useless extension candidates. Maximal degree in co-relation 331259. Up to 29000 conditions per place. [2023-11-30 10:06:07,765 INFO L140 encePairwiseOnDemand]: 145/160 looper letters, 4028 selfloop transitions, 23 changer transitions 1044/8480 dead transitions. [2023-11-30 10:06:07,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1313 places, 8480 transitions, 394732 flow [2023-11-30 10:06:07,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-30 10:06:07,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-30 10:06:07,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2696 transitions. [2023-11-30 10:06:07,767 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7326086956521739 [2023-11-30 10:06:07,767 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2696 transitions. [2023-11-30 10:06:07,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2696 transitions. [2023-11-30 10:06:07,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:06:07,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2696 transitions. [2023-11-30 10:06:07,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 117.21739130434783) internal successors, (2696), 23 states have internal predecessors, (2696), 0 states have call successors, (0), 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-30 10:06:07,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 160.0) internal successors, (3840), 24 states have internal predecessors, (3840), 0 states have call successors, (0), 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-30 10:06:07,770 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 160.0) internal successors, (3840), 24 states have internal predecessors, (3840), 0 states have call successors, (0), 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-30 10:06:07,771 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1180 predicate places. [2023-11-30 10:06:07,771 INFO L500 AbstractCegarLoop]: Abstraction has has 1313 places, 8480 transitions, 394732 flow [2023-11-30 10:06:07,771 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 116.82142857142857) internal successors, (3271), 28 states have internal predecessors, (3271), 0 states have call successors, (0), 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-30 10:06:07,771 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:06:07,772 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-30 10:06:07,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2023-11-30 10:06:07,976 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-30 10:06:07,976 INFO L425 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:06:07,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:06:07,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1332702616, now seen corresponding path program 1 times [2023-11-30 10:06:07,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:06:07,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125131396] [2023-11-30 10:06:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:06:07,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:06:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:06:09,281 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:06:09,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:06:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125131396] [2023-11-30 10:06:09,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125131396] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:06:09,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896055609] [2023-11-30 10:06:09,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:06:09,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:06:09,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:06:09,283 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:06:09,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2023-11-30 10:06:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:06:09,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-30 10:06:09,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:06:10,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 10:06:10,467 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 32 treesize of output 25 [2023-11-30 10:06:10,663 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:06:10,663 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:06:13,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:06:13,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 79 [2023-11-30 10:06:13,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 10:06:13,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 6 [2023-11-30 10:06:14,981 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 10:06:14,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896055609] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:06:14,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:06:14,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 73 [2023-11-30 10:06:14,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597154946] [2023-11-30 10:06:14,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:06:14,982 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-30 10:06:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:06:14,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-30 10:06:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=5039, Unknown=1, NotChecked=0, Total=5402 [2023-11-30 10:06:14,985 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 160 [2023-11-30 10:06:14,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1313 places, 8480 transitions, 394732 flow. Second operand has 74 states, 74 states have (on average 79.63513513513513) internal successors, (5893), 74 states have internal predecessors, (5893), 0 states have call successors, (0), 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-30 10:06:14,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:06:14,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 160 [2023-11-30 10:06:14,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:06:22,477 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-30 10:06:24,497 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-30 10:06:31,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:06:33,715 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:06:37,147 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-30 10:06:43,831 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-30 10:06:52,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:06:58,568 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-30 10:07:09,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:07:20,463 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-30 10:07:23,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:07:31,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:07:35,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:07:41,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:07:44,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 10:08:15,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:15,575 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 10:08:15,575 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:08:15,575 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:15,575 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:18,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:18,561 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 10:08:18,561 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:08:18,561 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:18,561 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:21,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:21,269 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-30 10:08:21,269 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:08:21,269 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:21,269 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:23,755 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:23,755 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 10:08:23,755 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:23,755 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:08:23,755 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:26,190 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 99#L65-2true, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:26,191 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 10:08:26,191 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:26,191 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:08:26,191 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:27,903 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:27,904 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 10:08:27,904 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:08:27,904 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:27,904 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:27,904 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:28,639 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:28,640 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 10:08:28,640 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:28,640 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:28,640 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:30,332 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:30,332 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 10:08:30,332 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:08:30,332 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:30,332 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:30,332 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:32,780 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:32,780 INFO L294 olderBase$Statistics]: this new event has 160 ancestors and is cut-off event [2023-11-30 10:08:32,780 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:08:32,780 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:32,780 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:32,780 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:34,303 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:34,303 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2023-11-30 10:08:34,303 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:34,303 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:34,303 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:08:34,303 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:36,551 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:36,552 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-30 10:08:36,552 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:36,552 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:36,552 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:08:36,552 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:38,295 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:38,295 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2023-11-30 10:08:38,295 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:38,295 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:38,295 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:38,295 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:42,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6349], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 5007#(and (<= 0 (+ |thread1Thread1of1ForFork0_#t~post1#1| 2147483648)) (<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648))), 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, thread1Thread1of1ForFork0InUse, 5321#(<= |thread1Thread1of1ForFork0_#t~post1#1| 2147483646), thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 78#L47-6true, 12068#true]) [2023-11-30 10:08:42,344 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:42,345 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,345 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 71#L47-8true, 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:42,356 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:42,356 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,356 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,356 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,369 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 151#L48true, 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:42,370 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:42,370 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:42,370 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:42,370 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:43,500 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:43,500 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:43,501 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:43,501 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:43,501 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6881], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 166#true, 133#L93-4true, 109#L58true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1076#true, 4700#true, 16832#true, 159#true, 894#(<= ~n~0 2147483647), 1069#true, 1080#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:44,339 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:08:44,339 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:44,339 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 10:08:44,339 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:44,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6624], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 376#true, 133#L93-4true, 166#true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 1076#true, 894#(<= ~n~0 2147483647), 16832#true, 159#true, 1069#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1080#true, 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 12068#true, 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:44,354 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-30 10:08:44,354 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:44,354 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 10:08:44,354 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:44,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6349], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 5007#(and (<= 0 (+ |thread1Thread1of1ForFork0_#t~post1#1| 2147483648)) (<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648))), 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, thread1Thread1of1ForFork0InUse, 5321#(<= |thread1Thread1of1ForFork0_#t~post1#1| 2147483646), 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 78#L47-6true, 12068#true]) [2023-11-30 10:08:44,909 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:44,909 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:44,909 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:44,951 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 71#L47-8true, 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:44,951 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:44,951 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,951 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,951 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 151#L48true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:44,964 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:44,964 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,964 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:44,965 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:44,965 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:44,965 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:44,965 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:44,965 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,106 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,106 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:45,115 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,115 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:08:45,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:45,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:45,115 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 10:08:45,115 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,581 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,581 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:08:45,581 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L292 olderBase$Statistics]: inserting event number 6 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:45,582 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 10:08:45,582 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:45,719 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:45,719 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,719 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,719 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,719 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,719 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,749 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,750 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:45,750 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:45,759 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:45,759 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,759 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,759 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:45,759 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:08:45,759 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:08:46,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6881], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 166#true, 109#L58true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 83#L94-1true, 1076#true, 4700#true, 16832#true, 894#(<= ~n~0 2147483647), 159#true, 1069#true, 1080#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:46,338 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,338 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,338 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,338 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6624], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 166#true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 1076#true, 894#(<= ~n~0 2147483647), 16832#true, 159#true, 1069#true, 1080#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:46,354 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,354 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,354 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,354 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,437 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:46,437 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,437 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 10:08:46,437 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,437 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 71#L47-8true, 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:46,438 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,438 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,439 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 151#L48true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:46,439 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,439 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,439 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,439 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:08:46,439 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:46,858 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:08:46,858 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:46,866 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:46,866 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,866 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,866 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:08:46,866 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:46,866 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:08:47,194 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:47,194 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:47,194 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,194 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,194 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,194 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:08:47,226 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4992], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:47,227 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:08:47,227 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,235 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6625], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 99#L65-2true, 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:08:47,235 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:08:47,235 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:08:47,235 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,235 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,236 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L292 olderBase$Statistics]: inserting event number 7 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][4994], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 16#L54true, 1076#true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:47,518 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 71#L47-8true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:47,518 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:08:47,518 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,520 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6365], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 151#L48true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:08:47,520 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:08:47,520 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,520 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,520 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:08:47,520 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:08:48,775 INFO L124 PetriNetUnfolderBase]: 18841/50193 cut-off events. [2023-11-30 10:08:48,775 INFO L125 PetriNetUnfolderBase]: For 5909069/6114959 co-relation queries the response was YES. [2023-11-30 10:08:49,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758905 conditions, 50193 events. 18841/50193 cut-off events. For 5909069/6114959 co-relation queries the response was YES. Maximal size of possible extension queue 1755. Compared 621616 event pairs, 496 based on Foata normal form. 5090/50691 useless extension candidates. Maximal degree in co-relation 364544. Up to 30020 conditions per place. [2023-11-30 10:08:49,964 INFO L140 encePairwiseOnDemand]: 128/160 looper letters, 4637 selfloop transitions, 2863 changer transitions 1215/8821 dead transitions. [2023-11-30 10:08:49,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1414 places, 8821 transitions, 428379 flow [2023-11-30 10:08:49,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2023-11-30 10:08:49,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2023-11-30 10:08:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 8591 transitions. [2023-11-30 10:08:49,969 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5113690476190477 [2023-11-30 10:08:49,969 INFO L72 ComplementDD]: Start complementDD. Operand 105 states and 8591 transitions. [2023-11-30 10:08:49,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 8591 transitions. [2023-11-30 10:08:49,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:08:49,970 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 8591 transitions. [2023-11-30 10:08:49,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 106 states, 105 states have (on average 81.81904761904762) internal successors, (8591), 105 states have internal predecessors, (8591), 0 states have call successors, (0), 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-30 10:08:49,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 106 states, 106 states have (on average 160.0) internal successors, (16960), 106 states have internal predecessors, (16960), 0 states have call successors, (0), 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-30 10:08:49,983 INFO L81 ComplementDD]: Finished complementDD. Result has 106 states, 106 states have (on average 160.0) internal successors, (16960), 106 states have internal predecessors, (16960), 0 states have call successors, (0), 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-30 10:08:49,983 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1281 predicate places. [2023-11-30 10:08:49,983 INFO L500 AbstractCegarLoop]: Abstraction has has 1414 places, 8821 transitions, 428379 flow [2023-11-30 10:08:49,984 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 74 states have (on average 79.63513513513513) internal successors, (5893), 74 states have internal predecessors, (5893), 0 states have call successors, (0), 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-30 10:08:49,984 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:08:49,984 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-30 10:08:50,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2023-11-30 10:08:50,189 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:08:50,189 INFO L425 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:08:50,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:08:50,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1604827054, now seen corresponding path program 7 times [2023-11-30 10:08:50,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:08:50,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140985237] [2023-11-30 10:08:50,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:08:50,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:08:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:08:50,249 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:08:50,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:08:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140985237] [2023-11-30 10:08:50,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140985237] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:08:50,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949206114] [2023-11-30 10:08:50,249 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-30 10:08:50,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:08:50,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:08:50,250 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:08:50,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2023-11-30 10:08:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:08:50,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 10:08:50,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:08:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:08:50,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:08:50,715 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 10:08:50,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949206114] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:08:50,715 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:08:50,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 7] total 10 [2023-11-30 10:08:50,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817448934] [2023-11-30 10:08:50,716 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:08:50,716 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-30 10:08:50,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:08:50,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-30 10:08:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-11-30 10:08:50,717 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 160 [2023-11-30 10:08:50,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1414 places, 8821 transitions, 428379 flow. Second operand has 10 states, 10 states have (on average 135.9) internal successors, (1359), 10 states have internal predecessors, (1359), 0 states have call successors, (0), 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-30 10:08:50,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:08:50,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 160 [2023-11-30 10:08:50,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 10:10:02,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4914], [16826#(and (or (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0 |thread2Thread1of1ForFork1_~j~0#1|)) (= |thread2Thread1of1ForFork1_~j~0#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread2Thread1of1ForFork1_~j~0#1| 0) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0))) (<= 0 (+ 2147483649 ~s~0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 79#L65-3true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 109#L58true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1069#true, 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:02,119 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-30 10:10:02,119 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:10:02,119 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:10:02,119 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:10:02,119 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4915], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:02,120 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4915], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 109#L58true, 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:02,120 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2023-11-30 10:10:02,120 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 10:10:09,818 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4914], [16826#(and (or (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0 |thread2Thread1of1ForFork1_~j~0#1|)) (= |thread2Thread1of1ForFork1_~j~0#1| 0)) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (or (= |thread2Thread1of1ForFork1_~j~0#1| 0) (< 0 (+ (select (select |#memory_int| ~q~0.base) (+ ~q~0.offset (* ~q_front~0 4))) 2147483649 ~s~0))) (<= 0 (+ 2147483649 ~s~0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 79#L65-3true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1069#true, 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:09,819 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4915], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:09,819 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][4915], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 81#L72true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 13871#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 18686#(<= ~q_back~0 (+ ~q_front~0 1)), 12068#true]) [2023-11-30 10:10:09,819 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2023-11-30 10:10:09,819 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:10:09,820 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 10:10:09,820 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2023-11-30 10:10:17,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6355], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 5007#(and (<= 0 (+ |thread1Thread1of1ForFork0_#t~post1#1| 2147483648)) (<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648))), 18685#(<= ~q_back~0 ~q_front~0), 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5321#(<= |thread1Thread1of1ForFork0_#t~post1#1| 2147483646), thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 78#L47-6true, 12068#true]) [2023-11-30 10:10:17,085 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:10:17,085 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:17,085 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:17,085 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 10:10:20,831 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6969], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 133#L93-4true, 166#true, 109#L58true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 5010#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1076#true, 4700#true, 894#(<= ~n~0 2147483647), 16832#true, 159#true, 1069#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1080#true, 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:20,831 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:10:20,831 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:20,831 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:20,832 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 10:10:20,864 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6659], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 133#L93-4true, 166#true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 5010#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 23#L52true, 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 1076#true, 16832#true, 159#true, 894#(<= ~n~0 2147483647), 1069#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1080#true, 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 12068#true, 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:20,864 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2023-11-30 10:10:20,864 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:10:20,864 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2023-11-30 10:10:20,864 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 10:10:21,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6355], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 5007#(and (<= 0 (+ |thread1Thread1of1ForFork0_#t~post1#1| 2147483648)) (<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648))), 376#true, 18685#(<= ~q_back~0 ~q_front~0), 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5321#(<= |thread1Thread1of1ForFork0_#t~post1#1| 2147483646), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 78#L47-6true, 12068#true]) [2023-11-30 10:10:21,771 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:10:21,771 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:10:21,771 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:21,771 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:22,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6971], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 133#L93-4true, 166#true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:22,180 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:10:22,180 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:10:22,180 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:22,180 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:22,196 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6656], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 133#L93-4true, 166#true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:22,196 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2023-11-30 10:10:22,196 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2023-11-30 10:10:22,196 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:22,197 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2023-11-30 10:10:23,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:23,387 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:10:23,387 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:23,387 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:23,387 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:10:23,452 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6971], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 166#true, 133#L93-4true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:23,452 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:10:23,452 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:10:23,452 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:23,452 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:23,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6656], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 166#true, 133#L93-4true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 99#L65-2true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:23,473 INFO L294 olderBase$Statistics]: this new event has 168 ancestors and is cut-off event [2023-11-30 10:10:23,474 INFO L297 olderBase$Statistics]: existing Event has 168 ancestors and is cut-off event [2023-11-30 10:10:23,474 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:23,474 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 10:10:24,181 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6969], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 166#true, 109#L58true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 4695#true, 799#true, 5010#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 83#L94-1true, 1076#true, 4700#true, 159#true, 16832#true, 894#(<= ~n~0 2147483647), 1069#true, 1080#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 12068#true, 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:24,182 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:10:24,182 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:24,182 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:10:24,182 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:24,207 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6659], [11575#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 2324#true, 376#true, 6495#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 166#true, 87#L71-1true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 7495#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 11164#(and (or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15240#(<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647), 3356#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 2322#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 799#true, 4695#true, 5010#true, 13821#(and (<= 0 ~s~0) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 18659#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 9355#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 1076#true, 16832#true, 159#true, 894#(<= ~n~0 2147483647), 1069#true, 1080#true, 10231#(and (or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4138#(<= ~n~0 2147483647), 4054#(and (or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16754#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0)) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:24,207 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,207 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:24,207 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:24,207 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6617], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:24,358 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 133#L93-4true, 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 71#L47-8true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:24,358 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,358 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:24,359 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 133#L93-4true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 151#L48true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:24,359 INFO L294 olderBase$Statistics]: this new event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,359 INFO L297 olderBase$Statistics]: existing Event has 169 ancestors and is cut-off event [2023-11-30 10:10:24,359 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:24,360 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 10:10:25,093 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6971], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 166#true, 109#L58true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:25,093 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:10:25,093 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:25,094 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:25,094 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:10:25,112 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6656], [6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 81#L72true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:25,112 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2023-11-30 10:10:25,112 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:25,113 INFO L297 olderBase$Statistics]: existing Event has 170 ancestors and is cut-off event [2023-11-30 10:10:25,113 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2023-11-30 10:10:25,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, 46#L47-7true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 159#true, 16832#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:25,944 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:10:25,944 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:25,944 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:10:25,945 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:26,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L54-->L58: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_93) (< v_~q_back~0_93 v_~n~0_53)) 1 0) 0)) (<= 0 (+ v_~q_back~0_92 2147483648)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (not (= (ite (= (select (select |v_#memory_int_66| v_~q~0.base_58) (+ v_~q~0.offset_58 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (<= v_~q_back~0_92 2147483647)) InVars {#memory_int=|v_#memory_int_66|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_11|, ~q_back~0=v_~q_back~0_92, thread1Thread1of1ForFork0_#t~mem4#1=|v_thread1Thread1of1ForFork0_#t~mem4#1_5|, thread1Thread1of1ForFork0_#t~post5#1=|v_thread1Thread1of1ForFork0_#t~post5#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_11|, #memory_int=|v_#memory_int_66|, ~q~0.base=v_~q~0.base_58, ~n~0=v_~n~0_53, ~q~0.offset=v_~q~0.offset_58} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~mem4#1, thread1Thread1of1ForFork0_#t~post5#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1][6971], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 109#L58true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), thread2Thread1of1ForFork1InUse, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 159#true, 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:26,018 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:10:26,018 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,018 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,018 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:10:26,039 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([520] L48-->L52: Formula: (and (not (= (ite (and (<= 0 v_~q_back~0_83) (< v_~q_back~0_83 v_~n~0_47)) 1 0) 0)) (<= 0 (+ 2147483649 v_~q_back~0_83)) (not (= (ite (= (select (select |v_#memory_int_60| v_~q~0.base_52) (+ (* v_~q_back~0_83 4) v_~q~0.offset_52)) 1) 1 0) 0)) (<= v_~q_back~0_83 2147483646) (= (+ v_~q_back~0_83 1) v_~q_back~0_82)) InVars {#memory_int=|v_#memory_int_60|, ~q_back~0=v_~q_back~0_83, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} OutVars{thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1_5|, ~q_back~0=v_~q_back~0_82, thread1Thread1of1ForFork0_#t~post3#1=|v_thread1Thread1of1ForFork0_#t~post3#1_5|, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1_5|, #memory_int=|v_#memory_int_60|, thread1Thread1of1ForFork0_#t~mem2#1=|v_thread1Thread1of1ForFork0_#t~mem2#1_5|, ~q~0.base=v_~q~0.base_52, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_52} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond#1, ~q_back~0, thread1Thread1of1ForFork0_#t~post3#1, thread1Thread1of1ForFork0_assume_abort_if_not_~cond#1, thread1Thread1of1ForFork0_#t~mem2#1][6656], [2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 13825#(and (<= 0 (+ 2147483650 ~s~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0))), 376#true, 18687#(<= ~q_back~0 (+ 2 ~q_front~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 7884#(and (<= 0 (+ ~s~0 2147483648)) (<= 1 |thread2Thread1of1ForFork1_~j~0#1|)), 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 23#L52true, 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 99#L65-2true, 83#L94-1true, 1076#true, 17654#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 894#(<= ~n~0 2147483647), 16832#true, 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 16756#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ 2147483649 ~s~0))), 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 4138#(<= ~n~0 2147483647), 12068#true, 14792#(and (= |thread2Thread1of1ForFork1_~j~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= 0 (+ ~s~0 2147483648)))]) [2023-11-30 10:10:26,040 INFO L294 olderBase$Statistics]: this new event has 171 ancestors and is cut-off event [2023-11-30 10:10:26,040 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:26,040 INFO L297 olderBase$Statistics]: existing Event has 171 ancestors and is cut-off event [2023-11-30 10:10:26,040 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 10:10:26,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6617], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 18685#(<= ~q_back~0 ~q_front~0), 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 16#L54true, 4700#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 16832#true, 159#true, 894#(<= ~n~0 2147483647), 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 1080#true, 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:26,584 INFO L294 olderBase$Statistics]: this new event has 173 ancestors and is cut-off event [2023-11-30 10:10:26,584 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:10:26,584 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2023-11-30 10:10:26,584 INFO L297 olderBase$Statistics]: existing Event has 173 ancestors and is cut-off event [2023-11-30 10:10:26,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 2324#true, 11184#true, 376#true, 18685#(<= ~q_back~0 ~q_front~0), 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7511#true, 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 4695#true, 799#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 83#L94-1true, 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 71#L47-8true, 159#true, 894#(<= ~n~0 2147483647), 16832#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:26,585 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:10:26,585 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:10:26,585 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,585 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,586 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L66-->L70: Formula: (and (not (= (ite (and (< v_~q_front~0_35 v_~n~0_41) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (<= v_~q_front~0_34 2147483647) (= |v_thread2Thread1of1ForFork1_~j~0#1_7| (select (select |v_#memory_int_54| v_~q~0.base_46) (+ (* v_~q_front~0_35 4) v_~q~0.offset_46))) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_35} OutVars{thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1_5|, thread2Thread1of1ForFork1_~j~0#1=|v_thread2Thread1of1ForFork1_~j~0#1_7|, ~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_54|, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_5|, thread2Thread1of1ForFork1_#t~mem6#1=|v_thread2Thread1of1ForFork1_#t~mem6#1_5|, ~q~0.base=v_~q~0.base_46, ~n~0=v_~n~0_41, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_46, ~q_front~0=v_~q_front~0_34} AuxVars[] AssignedVars[thread2Thread1of1ForFork1_assume_abort_if_not_~cond#1, thread2Thread1of1ForFork1_~j~0#1, thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, thread2Thread1of1ForFork1_#t~mem6#1, thread2Thread1of1ForFork1_#t~post7#1, ~q_front~0][6368], [18657#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0) (or (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646)) (< 1 ~q_back~0) (< ~q_front~0 0))), 2324#true, 6475#(and (<= 0 (+ 2147483650 ~s~0)) (or (< (+ ~q_back~0 1) 0) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0) (= ~q_front~0 ~q_back~0))), 11184#true, 18685#(<= ~q_back~0 ~q_front~0), 376#true, 7511#true, 13872#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 8526#(< |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|), 166#true, 94#L70true, 3880#(or (not (= ~q_back~0 0)) (not (= ~q_front~0 0)) (and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~s~0 2147483646))), 14817#true, 799#true, 4695#true, 5010#true, thread1Thread1of1ForFork0InUse, thread2Thread1of1ForFork1InUse, 10923#(or (and (or (< ~s~0 2147483646) (< 0 ~q_back~0)) (or (< ~q_front~0 (+ ~q_back~0 1)) (< 0 ~q_back~0)) (or (< 0 ~q_back~0) (< 0 (+ ~q_front~0 1)))) (< ~q_back~0 0)), 4992#(<= 0 (+ |thread1Thread1of1ForFork0_~i~0#1| 2147483648)), 83#L94-1true, 6713#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 1076#true, 10018#(or (< (+ ~q_back~0 1) 0) (and (<= ~s~0 2147483645) (= ~q_front~0 ~q_back~0)) (< 1 ~q_front~0) (< 0 ~q_back~0) (< ~q_front~0 0)), 151#L48true, 16832#true, 894#(<= ~n~0 2147483647), 159#true, 2320#(and (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ 2147483649 ~s~0))), 1069#true, 3174#(and (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= 0 (+ ~s~0 2147483648))), 1080#true, 16684#(and (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= |#StackHeapBarrier| |ULTIMATE.start_main_~#t2~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ 2147483649 ~s~0))), 4138#(<= ~n~0 2147483647), 13783#(and (<= 0 (+ 2147483650 ~s~0)) (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (not (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 0)) (<= ~q_front~0 ~q_back~0)), 12068#true]) [2023-11-30 10:10:26,586 INFO L294 olderBase$Statistics]: this new event has 172 ancestors and is cut-off event [2023-11-30 10:10:26,586 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,586 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 10:10:26,586 INFO L297 olderBase$Statistics]: existing Event has 172 ancestors and is cut-off event [2023-11-30 10:10:28,903 INFO L124 PetriNetUnfolderBase]: 21855/58434 cut-off events. [2023-11-30 10:10:28,903 INFO L125 PetriNetUnfolderBase]: For 7814602/8041994 co-relation queries the response was YES. [2023-11-30 10:10:29,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909096 conditions, 58434 events. 21855/58434 cut-off events. For 7814602/8041994 co-relation queries the response was YES. Maximal size of possible extension queue 1847. Compared 735872 event pairs, 600 based on Foata normal form. 1329/54261 useless extension candidates. Maximal degree in co-relation 454104. Up to 35227 conditions per place. [2023-11-30 10:10:30,118 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 2996 selfloop transitions, 2070 changer transitions 1327/9702 dead transitions. [2023-11-30 10:10:30,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1416 places, 9702 transitions, 498110 flow [2023-11-30 10:10:30,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 10:10:30,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 10:10:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 829 transitions. [2023-11-30 10:10:30,119 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8635416666666667 [2023-11-30 10:10:30,119 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 829 transitions. [2023-11-30 10:10:30,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 829 transitions. [2023-11-30 10:10:30,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 10:10:30,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 829 transitions. [2023-11-30 10:10:30,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 138.16666666666666) internal successors, (829), 6 states have internal predecessors, (829), 0 states have call successors, (0), 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-30 10:10:30,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 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-30 10:10:30,120 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 160.0) internal successors, (1120), 7 states have internal predecessors, (1120), 0 states have call successors, (0), 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-30 10:10:30,121 INFO L307 CegarLoopForPetriNet]: 133 programPoint places, 1283 predicate places. [2023-11-30 10:10:30,121 INFO L500 AbstractCegarLoop]: Abstraction has has 1416 places, 9702 transitions, 498110 flow [2023-11-30 10:10:30,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 135.9) internal successors, (1359), 10 states have internal predecessors, (1359), 0 states have call successors, (0), 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-30 10:10:30,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 10:10:30,121 INFO L232 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 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] [2023-11-30 10:10:30,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2023-11-30 10:10:30,326 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-30 10:10:30,327 INFO L425 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 10:10:30,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 10:10:30,327 INFO L85 PathProgramCache]: Analyzing trace with hash -87761837, now seen corresponding path program 2 times [2023-11-30 10:10:30,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 10:10:30,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869200423] [2023-11-30 10:10:30,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 10:10:30,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 10:10:30,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 10:10:30,496 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 33 proven. 60 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-30 10:10:30,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 10:10:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869200423] [2023-11-30 10:10:30,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869200423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 10:10:30,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191247343] [2023-11-30 10:10:30,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 10:10:30,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:10:30,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 10:10:30,497 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-30 10:10:30,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2023-11-30 10:10:30,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 10:10:30,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 10:10:30,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 10:10:30,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 10:10:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-30 10:10:30,739 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 10:10:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2023-11-30 10:10:30,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191247343] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 10:10:30,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 10:10:30,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 19 [2023-11-30 10:10:30,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049064505] [2023-11-30 10:10:30,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 10:10:30,871 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 10:10:30,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 10:10:30,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 10:10:30,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-11-30 10:10:30,872 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 160 [2023-11-30 10:10:30,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1416 places, 9702 transitions, 498110 flow. Second operand has 19 states, 19 states have (on average 100.05263157894737) internal successors, (1901), 19 states have internal predecessors, (1901), 0 states have call successors, (0), 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-30 10:10:30,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 10:10:30,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 160 [2023-11-30 10:10:30,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2023-11-30 10:10:35,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-11-30 10:10:35,727 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-11-30 10:10:35,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2023-11-30 10:10:35,732 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 10:10:35,734 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-30 10:10:35,931 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 10:10:35,931 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). [2023-11-30 10:10:35,932 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-11-30 10:10:35,933 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-11-30 10:10:35,934 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-11-30 10:10:35,934 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-11-30 10:10:35,934 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-11-30 10:10:35,934 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-11-30 10:10:35,934 INFO L457 BasicCegarLoop]: Path program histogram: [7, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 10:10:35,937 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 10:10:35,937 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 10:10:35,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 10:10:35 BasicIcfg [2023-11-30 10:10:35,939 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 10:10:35,940 INFO L158 Benchmark]: Toolchain (without parser) took 810163.73ms. Allocated memory was 490.7MB in the beginning and 6.4GB in the end (delta: 5.9GB). Free memory was 449.1MB in the beginning and 3.2GB in the end (delta: -2.7GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 339.7MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.70ms. Allocated memory is still 490.7MB. Free memory was 448.7MB in the beginning and 437.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.59ms. Allocated memory is still 490.7MB. Free memory was 437.0MB in the beginning and 435.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: Boogie Preprocessor took 20.48ms. Allocated memory is still 490.7MB. Free memory was 435.2MB in the beginning and 433.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: RCFGBuilder took 527.99ms. Allocated memory is still 490.7MB. Free memory was 433.5MB in the beginning and 403.4MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 10:10:35,940 INFO L158 Benchmark]: TraceAbstraction took 809412.35ms. Allocated memory was 490.7MB in the beginning and 6.4GB in the end (delta: 5.9GB). Free memory was 402.6MB in the beginning and 3.2GB in the end (delta: -2.7GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. [2023-11-30 10:10:35,941 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.10ms. Allocated memory is still 339.7MB. Free memory is still 291.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 167.70ms. Allocated memory is still 490.7MB. Free memory was 448.7MB in the beginning and 437.4MB in the end (delta: 11.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.59ms. Allocated memory is still 490.7MB. Free memory was 437.0MB in the beginning and 435.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.48ms. Allocated memory is still 490.7MB. Free memory was 435.2MB in the beginning and 433.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 527.99ms. Allocated memory is still 490.7MB. Free memory was 433.5MB in the beginning and 403.4MB in the end (delta: 30.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 809412.35ms. Allocated memory was 490.7MB in the beginning and 6.4GB in the end (delta: 5.9GB). Free memory was 402.6MB in the beginning and 3.2GB in the end (delta: -2.7GB). Peak memory consumption was 4.0GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 51]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 57]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 47]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 69]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 71]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 108]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (19states, 94/160 universal loopers) in iteration 32,while PetriNetUnfolder was constructing finite prefix that currently has 30583 conditions, 2092 events (563/2091 cut-off events. For 281266/290337 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 18834 event pairs, 75 based on Foata normal form. 199/2315 useless extension candidates. Maximal degree in co-relation 15025. Up to 662 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 187 locations, 24 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: 809.3s, OverallIterations: 32, TraceHistogramMax: 5, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 741.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 218 mSolverCounterUnknown, 20897 SdHoareTripleChecker+Valid, 76.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 20897 mSDsluCounter, 12386 SdHoareTripleChecker+Invalid, 73.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1321 IncrementalHoareTripleChecker+Unchecked, 11691 mSDsCounter, 2737 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 52794 IncrementalHoareTripleChecker+Invalid, 57070 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2737 mSolverCounterUnsat, 695 mSDtfsCounter, 52794 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7304 GetRequests, 4910 SyntacticMatches, 21 SemanticMatches, 2373 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 87778 ImplicationChecksByTransitivity, 106.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=498110occurred in iteration=31, InterpolantAutomatonStates: 1457, 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.4s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 58.4s InterpolantComputationTime, 6238 NumberOfCodeBlocks, 6100 NumberOfCodeBlocksAsserted, 74 NumberOfCheckSat, 8738 ConstructedInterpolants, 246 QuantifiedInterpolants, 112055 SizeOfPredicates, 370 NumberOfNonLiveVariables, 6376 ConjunctsInSsa, 591 ConjunctsInUnsatCore, 82 InterpolantComputations, 9 PerfectInterpolantSequences, 904/2099 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