/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-more-queue-add-2-nl.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-wip.dk.empire-owicki-175f719-m [2023-11-30 09:43:53,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-30 09:43:53,292 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:43:53,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-30 09:43:53,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-30 09:43:53,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-30 09:43:53,326 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-30 09:43:53,326 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-30 09:43:53,327 INFO L153 SettingsManager]: * Use SBE=true [2023-11-30 09:43:53,327 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-30 09:43:53,327 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-30 09:43:53,327 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-30 09:43:53,334 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-30 09:43:53,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-30 09:43:53,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-30 09:43:53,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-30 09:43:53,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-30 09:43:53,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-30 09:43:53,339 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-30 09:43:53,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-30 09:43:53,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-30 09:43:53,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-30 09:43:53,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-30 09:43:53,340 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-11-30 09:43:53,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-30 09:43:53,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:43:53,341 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-30 09:43:53,341 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-30 09:43:53,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-30 09:43:53,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-30 09:43:53,341 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-30 09:43:53,341 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-30 09:43:53,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-30 09:43:53,342 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:43:53,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-30 09:43:53,521 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-30 09:43:53,523 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-30 09:43:53,524 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-30 09:43:53,525 INFO L274 PluginConnector]: CDTParser initialized [2023-11-30 09:43:53,526 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2023-11-30 09:43:54,616 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-30 09:43:54,790 INFO L384 CDTParser]: Found 1 translation units. [2023-11-30 09:43:54,790 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-queue-add-2-nl.wvr.c [2023-11-30 09:43:54,797 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff65f05af/1a05d455b36244a288eee28a3ea27fb0/FLAGf1ce66194 [2023-11-30 09:43:54,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff65f05af/1a05d455b36244a288eee28a3ea27fb0 [2023-11-30 09:43:54,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-30 09:43:54,812 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-11-30 09:43:54,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-30 09:43:54,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-30 09:43:54,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-30 09:43:54,819 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:43:54" (1/1) ... [2023-11-30 09:43:54,820 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2910f1d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:54, skipping insertion in model container [2023-11-30 09:43:54,821 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 09:43:54" (1/1) ... [2023-11-30 09:43:54,850 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-30 09:43:54,979 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:43:54,986 INFO L202 MainTranslator]: Completed pre-run [2023-11-30 09:43:55,006 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-30 09:43:55,013 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:43:55,013 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-30 09:43:55,019 INFO L206 MainTranslator]: Completed translation [2023-11-30 09:43:55,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55 WrapperNode [2023-11-30 09:43:55,020 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-30 09:43:55,021 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-30 09:43:55,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-30 09:43:55,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-30 09:43:55,026 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:43:55" (1/1) ... [2023-11-30 09:43:55,033 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:43:55" (1/1) ... [2023-11-30 09:43:55,061 INFO L138 Inliner]: procedures = 25, calls = 40, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 185 [2023-11-30 09:43:55,061 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-30 09:43:55,062 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-30 09:43:55,062 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-30 09:43:55,062 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-30 09:43:55,071 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,074 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,080 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,091 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-30 09:43:55,094 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-30 09:43:55,094 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-30 09:43:55,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-30 09:43:55,095 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (1/1) ... [2023-11-30 09:43:55,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-30 09:43:55,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:43:55,128 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:43:55,149 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:43:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-30 09:43:55,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-30 09:43:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-30 09:43:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-30 09:43:55,158 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-30 09:43:55,158 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-30 09:43:55,159 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-30 09:43:55,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-30 09:43:55,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-30 09:43:55,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-30 09:43:55,161 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:43:55,274 INFO L241 CfgBuilder]: Building ICFG [2023-11-30 09:43:55,276 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-30 09:43:55,530 INFO L282 CfgBuilder]: Performing block encoding [2023-11-30 09:43:55,660 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-30 09:43:55,660 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-30 09:43:55,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:43:55 BoogieIcfgContainer [2023-11-30 09:43:55,662 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-30 09:43:55,664 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-30 09:43:55,664 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-30 09:43:55,673 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-30 09:43:55,673 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 09:43:54" (1/3) ... [2023-11-30 09:43:55,673 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca2a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:43:55, skipping insertion in model container [2023-11-30 09:43:55,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 09:43:55" (2/3) ... [2023-11-30 09:43:55,674 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ca2a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 09:43:55, skipping insertion in model container [2023-11-30 09:43:55,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 09:43:55" (3/3) ... [2023-11-30 09:43:55,675 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2023-11-30 09:43:55,688 INFO L197 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-30 09:43:55,688 INFO L156 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-30 09:43:55,688 INFO L508 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-30 09:43:55,770 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-30 09:43:55,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 170 transitions, 354 flow [2023-11-30 09:43:55,857 INFO L124 PetriNetUnfolderBase]: 11/168 cut-off events. [2023-11-30 09:43:55,857 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-30 09:43:55,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 177 conditions, 168 events. 11/168 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 166 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 122. Up to 3 conditions per place. [2023-11-30 09:43:55,862 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 170 transitions, 354 flow [2023-11-30 09:43:55,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 146 transitions, 301 flow [2023-11-30 09:43:55,875 INFO L361 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-30 09:43:55,880 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;@73bada99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-30 09:43:55,880 INFO L363 AbstractCegarLoop]: Starting to check reachability of 24 error locations. [2023-11-30 09:43:55,894 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-30 09:43:55,894 INFO L124 PetriNetUnfolderBase]: 3/73 cut-off events. [2023-11-30 09:43:55,894 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-30 09:43:55,895 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:55,895 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] [2023-11-30 09:43:55,896 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:43:55,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:55,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1438214487, now seen corresponding path program 1 times [2023-11-30 09:43:55,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:55,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738871083] [2023-11-30 09:43:55,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:55,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:56,229 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:43:56,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:56,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738871083] [2023-11-30 09:43:56,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738871083] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:56,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:43:56,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:43:56,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8721048] [2023-11-30 09:43:56,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:56,239 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:43:56,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:56,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:43:56,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:43:56,270 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 170 [2023-11-30 09:43:56,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 146 transitions, 301 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:43:56,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:56,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 170 [2023-11-30 09:43:56,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:56,445 INFO L124 PetriNetUnfolderBase]: 30/234 cut-off events. [2023-11-30 09:43:56,445 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-30 09:43:56,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 234 events. 30/234 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 594 event pairs, 14 based on Foata normal form. 16/202 useless extension candidates. Maximal degree in co-relation 176. Up to 65 conditions per place. [2023-11-30 09:43:56,450 INFO L140 encePairwiseOnDemand]: 153/170 looper letters, 27 selfloop transitions, 5 changer transitions 3/145 dead transitions. [2023-11-30 09:43:56,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 145 transitions, 363 flow [2023-11-30 09:43:56,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:43:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:43:56,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 715 transitions. [2023-11-30 09:43:56,469 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8411764705882353 [2023-11-30 09:43:56,470 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 715 transitions. [2023-11-30 09:43:56,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 715 transitions. [2023-11-30 09:43:56,473 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:56,475 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 715 transitions. [2023-11-30 09:43:56,480 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.0) internal successors, (715), 5 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:56,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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:43:56,487 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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:43:56,491 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 1 predicate places. [2023-11-30 09:43:56,491 INFO L500 AbstractCegarLoop]: Abstraction has has 144 places, 145 transitions, 363 flow [2023-11-30 09:43:56,492 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 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:43:56,492 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:56,492 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, 1, 1, 1, 1, 1, 1] [2023-11-30 09:43:56,492 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-30 09:43:56,493 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:43:56,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:56,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1857943274, now seen corresponding path program 1 times [2023-11-30 09:43:56,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:56,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430743104] [2023-11-30 09:43:56,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:56,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:56,685 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:43:56,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430743104] [2023-11-30 09:43:56,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430743104] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:43:56,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1386427701] [2023-11-30 09:43:56,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:56,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:43:56,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:43:56,689 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:43:56,716 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:43:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:56,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:43:56,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:43:56,899 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:43:56,899 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:43:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1386427701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:56,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:43:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-30 09:43:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042599683] [2023-11-30 09:43:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:56,902 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:43:56,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:56,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:43:56,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-30 09:43:56,905 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 170 [2023-11-30 09:43:56,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 145 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 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:43:56,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:56,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 170 [2023-11-30 09:43:56,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:57,034 INFO L124 PetriNetUnfolderBase]: 30/233 cut-off events. [2023-11-30 09:43:57,034 INFO L125 PetriNetUnfolderBase]: For 54/80 co-relation queries the response was YES. [2023-11-30 09:43:57,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 233 events. 30/233 cut-off events. For 54/80 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 597 event pairs, 14 based on Foata normal form. 0/186 useless extension candidates. Maximal degree in co-relation 219. Up to 64 conditions per place. [2023-11-30 09:43:57,038 INFO L140 encePairwiseOnDemand]: 164/170 looper letters, 23 selfloop transitions, 8 changer transitions 3/144 dead transitions. [2023-11-30 09:43:57,039 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 144 transitions, 421 flow [2023-11-30 09:43:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-30 09:43:57,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-30 09:43:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 970 transitions. [2023-11-30 09:43:57,042 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8151260504201681 [2023-11-30 09:43:57,043 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 970 transitions. [2023-11-30 09:43:57,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 970 transitions. [2023-11-30 09:43:57,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:57,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 970 transitions. [2023-11-30 09:43:57,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.57142857142858) internal successors, (970), 7 states have internal predecessors, (970), 0 states have call successors, (0), 0 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:43:57,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:57,049 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 170.0) internal successors, (1360), 8 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:57,050 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 6 predicate places. [2023-11-30 09:43:57,050 INFO L500 AbstractCegarLoop]: Abstraction has has 149 places, 144 transitions, 421 flow [2023-11-30 09:43:57,051 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.16666666666666) internal successors, (817), 6 states have internal predecessors, (817), 0 states have call successors, (0), 0 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:43:57,051 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:57,052 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, 1, 1, 1, 1, 1, 1] [2023-11-30 09:43:57,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-30 09:43:57,257 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:43:57,258 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:43:57,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:57,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1761667067, now seen corresponding path program 1 times [2023-11-30 09:43:57,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:57,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190325938] [2023-11-30 09:43:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:57,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:57,418 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:43:57,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:57,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190325938] [2023-11-30 09:43:57,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190325938] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:43:57,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011528426] [2023-11-30 09:43:57,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:57,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:43:57,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:43:57,425 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:43:57,451 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:43:57,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:57,504 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:43:57,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:43:57,559 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:43:57,559 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:43:57,624 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:43:57,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011528426] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:43:57,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:43:57,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:43:57,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47070162] [2023-11-30 09:43:57,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:43:57,625 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:43:57,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:57,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:43:57,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:43:57,627 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 170 [2023-11-30 09:43:57,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 144 transitions, 421 flow. Second operand has 12 states, 12 states have (on average 136.83333333333334) internal successors, (1642), 12 states have internal predecessors, (1642), 0 states have call successors, (0), 0 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:43:57,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:57,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 170 [2023-11-30 09:43:57,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:57,812 INFO L124 PetriNetUnfolderBase]: 33/268 cut-off events. [2023-11-30 09:43:57,812 INFO L125 PetriNetUnfolderBase]: For 128/152 co-relation queries the response was YES. [2023-11-30 09:43:57,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 268 events. 33/268 cut-off events. For 128/152 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 775 event pairs, 14 based on Foata normal form. 0/220 useless extension candidates. Maximal degree in co-relation 320. Up to 90 conditions per place. [2023-11-30 09:43:57,814 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 39 selfloop transitions, 18 changer transitions 3/170 dead transitions. [2023-11-30 09:43:57,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 170 transitions, 691 flow [2023-11-30 09:43:57,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:43:57,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:43:57,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1936 transitions. [2023-11-30 09:43:57,819 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8134453781512605 [2023-11-30 09:43:57,819 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1936 transitions. [2023-11-30 09:43:57,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1936 transitions. [2023-11-30 09:43:57,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:57,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1936 transitions. [2023-11-30 09:43:57,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 138.28571428571428) internal successors, (1936), 14 states have internal predecessors, (1936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:57,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 170.0) internal successors, (2550), 15 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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:43:57,832 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 170.0) internal successors, (2550), 15 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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:43:57,833 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 19 predicate places. [2023-11-30 09:43:57,836 INFO L500 AbstractCegarLoop]: Abstraction has has 162 places, 170 transitions, 691 flow [2023-11-30 09:43:57,837 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 136.83333333333334) internal successors, (1642), 12 states have internal predecessors, (1642), 0 states have call successors, (0), 0 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:43:57,837 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:57,837 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] [2023-11-30 09:43:57,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-30 09:43:58,041 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:43:58,042 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:43:58,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:58,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1313162866, now seen corresponding path program 1 times [2023-11-30 09:43:58,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:58,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234590063] [2023-11-30 09:43:58,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:58,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:58,178 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:43:58,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:58,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234590063] [2023-11-30 09:43:58,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234590063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:58,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:43:58,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-30 09:43:58,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424787700] [2023-11-30 09:43:58,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:58,182 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:43:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:43:58,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-30 09:43:58,186 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 170 [2023-11-30 09:43:58,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 170 transitions, 691 flow. Second operand has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:43:58,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:58,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 170 [2023-11-30 09:43:58,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:58,326 INFO L124 PetriNetUnfolderBase]: 32/303 cut-off events. [2023-11-30 09:43:58,327 INFO L125 PetriNetUnfolderBase]: For 275/311 co-relation queries the response was YES. [2023-11-30 09:43:58,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 723 conditions, 303 events. 32/303 cut-off events. For 275/311 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 899 event pairs, 14 based on Foata normal form. 5/258 useless extension candidates. Maximal degree in co-relation 404. Up to 93 conditions per place. [2023-11-30 09:43:58,329 INFO L140 encePairwiseOnDemand]: 154/170 looper letters, 40 selfloop transitions, 8 changer transitions 9/174 dead transitions. [2023-11-30 09:43:58,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 174 transitions, 831 flow [2023-11-30 09:43:58,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-30 09:43:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-30 09:43:58,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1221 transitions. [2023-11-30 09:43:58,332 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7980392156862746 [2023-11-30 09:43:58,332 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1221 transitions. [2023-11-30 09:43:58,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1221 transitions. [2023-11-30 09:43:58,333 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:58,333 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1221 transitions. [2023-11-30 09:43:58,335 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 135.66666666666666) internal successors, (1221), 9 states have internal predecessors, (1221), 0 states have call successors, (0), 0 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:43:58,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 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:43:58,338 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 170.0) internal successors, (1700), 10 states have internal predecessors, (1700), 0 states have call successors, (0), 0 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:43:58,340 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 27 predicate places. [2023-11-30 09:43:58,340 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 174 transitions, 831 flow [2023-11-30 09:43:58,340 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:43:58,340 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:58,341 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] [2023-11-30 09:43:58,341 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-30 09:43:58,341 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:43:58,341 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:58,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1985958099, now seen corresponding path program 1 times [2023-11-30 09:43:58,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:58,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249486385] [2023-11-30 09:43:58,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:58,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:58,567 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:43:58,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:58,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249486385] [2023-11-30 09:43:58,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249486385] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:43:58,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805461322] [2023-11-30 09:43:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:58,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:43:58,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:43:58,573 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:43:58,597 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:43:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:58,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:43:58,677 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:43:58,753 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:43:58,753 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:43:58,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805461322] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:58,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:43:58,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2023-11-30 09:43:58,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786606219] [2023-11-30 09:43:58,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:58,757 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:43:58,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:58,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:43:58,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-30 09:43:58,760 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 170 [2023-11-30 09:43:58,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 174 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:43:58,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:58,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 170 [2023-11-30 09:43:58,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:58,813 INFO L124 PetriNetUnfolderBase]: 15/258 cut-off events. [2023-11-30 09:43:58,813 INFO L125 PetriNetUnfolderBase]: For 284/300 co-relation queries the response was YES. [2023-11-30 09:43:58,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587 conditions, 258 events. 15/258 cut-off events. For 284/300 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 614 event pairs, 5 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 405. Up to 64 conditions per place. [2023-11-30 09:43:58,815 INFO L140 encePairwiseOnDemand]: 164/170 looper letters, 10 selfloop transitions, 3 changer transitions 9/171 dead transitions. [2023-11-30 09:43:58,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 171 transitions, 831 flow [2023-11-30 09:43:58,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:43:58,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:43:58,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 576 transitions. [2023-11-30 09:43:58,818 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8470588235294118 [2023-11-30 09:43:58,818 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 576 transitions. [2023-11-30 09:43:58,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 576 transitions. [2023-11-30 09:43:58,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:58,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 576 transitions. [2023-11-30 09:43:58,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.0) internal successors, (576), 4 states have internal predecessors, (576), 0 states have call successors, (0), 0 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:43:58,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:43:58,821 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:43:58,823 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 27 predicate places. [2023-11-30 09:43:58,823 INFO L500 AbstractCegarLoop]: Abstraction has has 170 places, 171 transitions, 831 flow [2023-11-30 09:43:58,823 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:43:58,823 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:58,823 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] [2023-11-30 09:43:58,831 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:43:59,028 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:43:59,028 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:43:59,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:59,029 INFO L85 PathProgramCache]: Analyzing trace with hash -502656782, now seen corresponding path program 1 times [2023-11-30 09:43:59,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:59,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16715210] [2023-11-30 09:43:59,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:59,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:59,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:59,088 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:43:59,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:59,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16715210] [2023-11-30 09:43:59,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16715210] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:59,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:43:59,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:43:59,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201964884] [2023-11-30 09:43:59,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:59,089 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:43:59,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:59,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:43:59,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:43:59,090 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2023-11-30 09:43:59,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 831 flow. Second operand has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:43:59,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:59,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2023-11-30 09:43:59,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:59,170 INFO L124 PetriNetUnfolderBase]: 56/330 cut-off events. [2023-11-30 09:43:59,171 INFO L125 PetriNetUnfolderBase]: For 1065/1125 co-relation queries the response was YES. [2023-11-30 09:43:59,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 330 events. 56/330 cut-off events. For 1065/1125 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1230 event pairs, 26 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 551. Up to 103 conditions per place. [2023-11-30 09:43:59,173 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 27 selfloop transitions, 5 changer transitions 10/187 dead transitions. [2023-11-30 09:43:59,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 187 transitions, 1025 flow [2023-11-30 09:43:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-30 09:43:59,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-30 09:43:59,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 719 transitions. [2023-11-30 09:43:59,175 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8458823529411764 [2023-11-30 09:43:59,176 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 719 transitions. [2023-11-30 09:43:59,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 719 transitions. [2023-11-30 09:43:59,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:59,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 719 transitions. [2023-11-30 09:43:59,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.8) internal successors, (719), 5 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:59,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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:43:59,179 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 170.0) internal successors, (1020), 6 states have internal predecessors, (1020), 0 states have call successors, (0), 0 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:43:59,180 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 31 predicate places. [2023-11-30 09:43:59,180 INFO L500 AbstractCegarLoop]: Abstraction has has 174 places, 187 transitions, 1025 flow [2023-11-30 09:43:59,181 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 0 states have call successors, (0), 0 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:43:59,181 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:59,181 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:43:59,181 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-30 09:43:59,181 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:43:59,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:59,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1566056787, now seen corresponding path program 1 times [2023-11-30 09:43:59,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:59,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652104754] [2023-11-30 09:43:59,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:59,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:59,239 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:43:59,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:59,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652104754] [2023-11-30 09:43:59,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652104754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:43:59,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:43:59,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-30 09:43:59,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008895575] [2023-11-30 09:43:59,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:43:59,241 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-30 09:43:59,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:59,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-30 09:43:59,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-30 09:43:59,242 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 170 [2023-11-30 09:43:59,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 187 transitions, 1025 flow. Second operand has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:59,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:59,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 170 [2023-11-30 09:43:59,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:43:59,296 INFO L124 PetriNetUnfolderBase]: 69/399 cut-off events. [2023-11-30 09:43:59,296 INFO L125 PetriNetUnfolderBase]: For 1852/2014 co-relation queries the response was YES. [2023-11-30 09:43:59,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 399 events. 69/399 cut-off events. For 1852/2014 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1601 event pairs, 6 based on Foata normal form. 5/353 useless extension candidates. Maximal degree in co-relation 764. Up to 119 conditions per place. [2023-11-30 09:43:59,299 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 17 selfloop transitions, 3 changer transitions 10/190 dead transitions. [2023-11-30 09:43:59,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 190 transitions, 1119 flow [2023-11-30 09:43:59,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-30 09:43:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-30 09:43:59,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-11-30 09:43:59,301 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8745098039215686 [2023-11-30 09:43:59,301 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-11-30 09:43:59,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-11-30 09:43:59,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:43:59,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-11-30 09:43:59,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 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:43:59,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:43:59,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 170.0) internal successors, (680), 4 states have internal predecessors, (680), 0 states have call successors, (0), 0 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:43:59,304 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 33 predicate places. [2023-11-30 09:43:59,304 INFO L500 AbstractCegarLoop]: Abstraction has has 176 places, 190 transitions, 1119 flow [2023-11-30 09:43:59,305 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:43:59,305 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:43:59,305 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:43:59,305 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-30 09:43:59,305 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:43:59,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:43:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash -2060003323, now seen corresponding path program 1 times [2023-11-30 09:43:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:43:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940043352] [2023-11-30 09:43:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:59,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:43:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:59,472 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:43:59,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:43:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940043352] [2023-11-30 09:43:59,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940043352] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:43:59,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626090028] [2023-11-30 09:43:59,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:43:59,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:43:59,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:43:59,474 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:43:59,497 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:43:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:43:59,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-30 09:43:59,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:43:59,719 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:43:59,720 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:43:59,955 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:43:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626090028] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:43:59,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:43:59,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2023-11-30 09:43:59,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724648672] [2023-11-30 09:43:59,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:43:59,957 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-30 09:43:59,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:43:59,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-30 09:43:59,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2023-11-30 09:43:59,961 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2023-11-30 09:43:59,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 190 transitions, 1119 flow. Second operand has 19 states, 19 states have (on average 126.78947368421052) internal successors, (2409), 19 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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:43:59,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:43:59,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2023-11-30 09:43:59,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:00,281 INFO L124 PetriNetUnfolderBase]: 102/667 cut-off events. [2023-11-30 09:44:00,282 INFO L125 PetriNetUnfolderBase]: For 3571/3673 co-relation queries the response was YES. [2023-11-30 09:44:00,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2085 conditions, 667 events. 102/667 cut-off events. For 3571/3673 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3540 event pairs, 25 based on Foata normal form. 16/580 useless extension candidates. Maximal degree in co-relation 869. Up to 162 conditions per place. [2023-11-30 09:44:00,287 INFO L140 encePairwiseOnDemand]: 155/170 looper letters, 65 selfloop transitions, 23 changer transitions 10/206 dead transitions. [2023-11-30 09:44:00,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 206 transitions, 1571 flow [2023-11-30 09:44:00,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-30 09:44:00,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-30 09:44:00,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2293 transitions. [2023-11-30 09:44:00,293 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7493464052287582 [2023-11-30 09:44:00,293 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2293 transitions. [2023-11-30 09:44:00,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2293 transitions. [2023-11-30 09:44:00,295 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:00,295 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2293 transitions. [2023-11-30 09:44:00,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 127.38888888888889) internal successors, (2293), 18 states have internal predecessors, (2293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:44:00,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 170.0) internal successors, (3230), 19 states have internal predecessors, (3230), 0 states have call successors, (0), 0 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:44:00,306 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 170.0) internal successors, (3230), 19 states have internal predecessors, (3230), 0 states have call successors, (0), 0 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:44:00,308 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 50 predicate places. [2023-11-30 09:44:00,308 INFO L500 AbstractCegarLoop]: Abstraction has has 193 places, 206 transitions, 1571 flow [2023-11-30 09:44:00,309 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 126.78947368421052) internal successors, (2409), 19 states have internal predecessors, (2409), 0 states have call successors, (0), 0 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:44:00,309 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:00,309 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:00,320 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:44:00,516 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:44:00,517 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:44:00,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:00,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1843893657, now seen corresponding path program 1 times [2023-11-30 09:44:00,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:00,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896004081] [2023-11-30 09:44:00,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:00,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:01,859 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:44:01,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896004081] [2023-11-30 09:44:01,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896004081] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:01,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327924955] [2023-11-30 09:44:01,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:01,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:01,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:01,864 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:44:01,889 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:44:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:01,963 INFO L262 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-30 09:44:01,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:02,423 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:44:03,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:44:03,201 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 22 treesize of output 17 [2023-11-30 09:44:03,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:44:03,437 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 22 treesize of output 17 [2023-11-30 09:44:03,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-30 09:44:03,655 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:44:03,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:04,866 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:04,866 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 31 treesize of output 32 [2023-11-30 09:44:04,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:04,878 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 87 treesize of output 79 [2023-11-30 09:44:04,885 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 68 treesize of output 56 [2023-11-30 09:44:04,891 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 30 treesize of output 24 [2023-11-30 09:44:06,195 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:44:06,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327924955] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:06,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:06,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 22] total 63 [2023-11-30 09:44:06,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656043019] [2023-11-30 09:44:06,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:06,196 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-30 09:44:06,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:06,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-30 09:44:06,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3768, Unknown=4, NotChecked=0, Total=4032 [2023-11-30 09:44:06,203 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 170 [2023-11-30 09:44:06,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 206 transitions, 1571 flow. Second operand has 64 states, 64 states have (on average 84.140625) internal successors, (5385), 64 states have internal predecessors, (5385), 0 states have call successors, (0), 0 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:44:06,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:06,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 170 [2023-11-30 09:44:06,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:14,654 INFO L124 PetriNetUnfolderBase]: 382/1258 cut-off events. [2023-11-30 09:44:14,654 INFO L125 PetriNetUnfolderBase]: For 15118/15343 co-relation queries the response was YES. [2023-11-30 09:44:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5052 conditions, 1258 events. 382/1258 cut-off events. For 15118/15343 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8266 event pairs, 85 based on Foata normal form. 36/1115 useless extension candidates. Maximal degree in co-relation 1889. Up to 356 conditions per place. [2023-11-30 09:44:14,664 INFO L140 encePairwiseOnDemand]: 134/170 looper letters, 139 selfloop transitions, 65 changer transitions 17/293 dead transitions. [2023-11-30 09:44:14,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 293 transitions, 2684 flow [2023-11-30 09:44:14,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-11-30 09:44:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-11-30 09:44:14,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4021 transitions. [2023-11-30 09:44:14,674 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5032540675844805 [2023-11-30 09:44:14,674 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4021 transitions. [2023-11-30 09:44:14,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4021 transitions. [2023-11-30 09:44:14,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:14,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4021 transitions. [2023-11-30 09:44:14,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 85.55319148936171) internal successors, (4021), 47 states have internal predecessors, (4021), 0 states have call successors, (0), 0 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:44:14,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 170.0) internal successors, (8160), 48 states have internal predecessors, (8160), 0 states have call successors, (0), 0 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:44:14,697 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 170.0) internal successors, (8160), 48 states have internal predecessors, (8160), 0 states have call successors, (0), 0 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:44:14,697 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 96 predicate places. [2023-11-30 09:44:14,698 INFO L500 AbstractCegarLoop]: Abstraction has has 239 places, 293 transitions, 2684 flow [2023-11-30 09:44:14,700 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 84.140625) internal successors, (5385), 64 states have internal predecessors, (5385), 0 states have call successors, (0), 0 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:44:14,700 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:14,700 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:14,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-30 09:44:14,906 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:44:14,906 INFO L425 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:14,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:14,907 INFO L85 PathProgramCache]: Analyzing trace with hash -128219071, now seen corresponding path program 1 times [2023-11-30 09:44:14,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:14,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425927988] [2023-11-30 09:44:14,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:14,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:14,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:15,498 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:44:15,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:15,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425927988] [2023-11-30 09:44:15,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425927988] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:15,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641792055] [2023-11-30 09:44:15,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:15,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:15,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:15,500 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:44:15,502 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:44:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:15,596 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-30 09:44:15,599 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:15,974 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:44:16,288 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:44:16,341 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:44:16,457 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:44:16,457 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:17,398 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:17,399 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 60 treesize of output 48 [2023-11-30 09:44:17,410 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 09:44:17,410 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 140 treesize of output 127 [2023-11-30 09:44:17,422 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 09:44:17,422 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 100 [2023-11-30 09:44:17,431 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-30 09:44:17,431 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 79 treesize of output 67 [2023-11-30 09:44:17,765 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:44:17,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641792055] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:17,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:17,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 17] total 51 [2023-11-30 09:44:17,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614204510] [2023-11-30 09:44:17,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:17,768 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-11-30 09:44:17,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:17,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-11-30 09:44:17,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2274, Unknown=18, NotChecked=0, Total=2652 [2023-11-30 09:44:17,775 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-11-30 09:44:17,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 293 transitions, 2684 flow. Second operand has 52 states, 52 states have (on average 90.40384615384616) internal successors, (4701), 52 states have internal predecessors, (4701), 0 states have call successors, (0), 0 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:44:17,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:17,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-11-30 09:44:17,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:20,542 INFO L124 PetriNetUnfolderBase]: 584/1765 cut-off events. [2023-11-30 09:44:20,542 INFO L125 PetriNetUnfolderBase]: For 22508/23474 co-relation queries the response was YES. [2023-11-30 09:44:20,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8219 conditions, 1765 events. 584/1765 cut-off events. For 22508/23474 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 13046 event pairs, 78 based on Foata normal form. 87/1605 useless extension candidates. Maximal degree in co-relation 3728. Up to 531 conditions per place. [2023-11-30 09:44:20,558 INFO L140 encePairwiseOnDemand]: 136/170 looper letters, 194 selfloop transitions, 71 changer transitions 20/368 dead transitions. [2023-11-30 09:44:20,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 368 transitions, 4128 flow [2023-11-30 09:44:20,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-11-30 09:44:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-11-30 09:44:20,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3514 transitions. [2023-11-30 09:44:20,564 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5439628482972136 [2023-11-30 09:44:20,564 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3514 transitions. [2023-11-30 09:44:20,564 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3514 transitions. [2023-11-30 09:44:20,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:20,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3514 transitions. [2023-11-30 09:44:20,572 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 92.47368421052632) internal successors, (3514), 38 states have internal predecessors, (3514), 0 states have call successors, (0), 0 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:44:20,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 170.0) internal successors, (6630), 39 states have internal predecessors, (6630), 0 states have call successors, (0), 0 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:44:20,580 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 170.0) internal successors, (6630), 39 states have internal predecessors, (6630), 0 states have call successors, (0), 0 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:44:20,580 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 133 predicate places. [2023-11-30 09:44:20,580 INFO L500 AbstractCegarLoop]: Abstraction has has 276 places, 368 transitions, 4128 flow [2023-11-30 09:44:20,582 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 90.40384615384616) internal successors, (4701), 52 states have internal predecessors, (4701), 0 states have call successors, (0), 0 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:44:20,582 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:20,582 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:20,590 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:44:20,787 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:44:20,787 INFO L425 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:20,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1326129119, now seen corresponding path program 2 times [2023-11-30 09:44:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:20,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656329617] [2023-11-30 09:44:20,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:20,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:21,900 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:44:21,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656329617] [2023-11-30 09:44:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656329617] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2133751788] [2023-11-30 09:44:21,901 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:21,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:21,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:21,904 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:44:21,908 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:44:21,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:44:21,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:21,992 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 09:44:21,994 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:21,998 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:44:22,104 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:44:22,105 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:44:22,341 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:44:22,447 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:44:22,447 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:22,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2133751788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:22,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:22,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [22] total 33 [2023-11-30 09:44:22,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537599519] [2023-11-30 09:44:22,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:22,448 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:44:22,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:22,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:44:22,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1036, Unknown=0, NotChecked=0, Total=1122 [2023-11-30 09:44:22,450 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 170 [2023-11-30 09:44:22,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 368 transitions, 4128 flow. Second operand has 13 states, 13 states have (on average 107.6923076923077) internal successors, (1400), 13 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:44:22,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:22,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 170 [2023-11-30 09:44:22,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:23,088 INFO L124 PetriNetUnfolderBase]: 788/2300 cut-off events. [2023-11-30 09:44:23,088 INFO L125 PetriNetUnfolderBase]: For 33861/36441 co-relation queries the response was YES. [2023-11-30 09:44:23,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11885 conditions, 2300 events. 788/2300 cut-off events. For 33861/36441 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 17710 event pairs, 98 based on Foata normal form. 148/2127 useless extension candidates. Maximal degree in co-relation 6326. Up to 797 conditions per place. [2023-11-30 09:44:23,111 INFO L140 encePairwiseOnDemand]: 154/170 looper letters, 235 selfloop transitions, 52 changer transitions 20/435 dead transitions. [2023-11-30 09:44:23,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 435 transitions, 5645 flow [2023-11-30 09:44:23,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 09:44:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 09:44:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1652 transitions. [2023-11-30 09:44:23,114 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.647843137254902 [2023-11-30 09:44:23,114 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1652 transitions. [2023-11-30 09:44:23,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1652 transitions. [2023-11-30 09:44:23,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:23,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1652 transitions. [2023-11-30 09:44:23,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 110.13333333333334) internal successors, (1652), 15 states have internal predecessors, (1652), 0 states have call successors, (0), 0 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:44:23,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:23,120 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:23,120 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 147 predicate places. [2023-11-30 09:44:23,120 INFO L500 AbstractCegarLoop]: Abstraction has has 290 places, 435 transitions, 5645 flow [2023-11-30 09:44:23,121 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.6923076923077) internal successors, (1400), 13 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:44:23,121 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:23,121 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:23,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-30 09:44:23,326 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:44:23,327 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:44:23,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:23,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1094138539, now seen corresponding path program 3 times [2023-11-30 09:44:23,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:23,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608545006] [2023-11-30 09:44:23,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:23,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:23,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:23,830 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:44:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608545006] [2023-11-30 09:44:23,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608545006] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096532764] [2023-11-30 09:44:23,830 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:44:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:23,832 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:44:23,857 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:44:23,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-30 09:44:23,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:23,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 09:44:23,926 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:24,066 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:44:24,066 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:24,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096532764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:24,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:24,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2023-11-30 09:44:24,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452458857] [2023-11-30 09:44:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:24,068 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:44:24,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:24,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:44:24,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-11-30 09:44:24,069 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2023-11-30 09:44:24,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 435 transitions, 5645 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:44:24,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:24,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2023-11-30 09:44:24,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:24,536 INFO L124 PetriNetUnfolderBase]: 814/2327 cut-off events. [2023-11-30 09:44:24,536 INFO L125 PetriNetUnfolderBase]: For 42596/46178 co-relation queries the response was YES. [2023-11-30 09:44:24,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13675 conditions, 2327 events. 814/2327 cut-off events. For 42596/46178 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 17983 event pairs, 97 based on Foata normal form. 72/2078 useless extension candidates. Maximal degree in co-relation 7300. Up to 1165 conditions per place. [2023-11-30 09:44:24,561 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 284 selfloop transitions, 21 changer transitions 21/473 dead transitions. [2023-11-30 09:44:24,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 473 transitions, 6868 flow [2023-11-30 09:44:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 09:44:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 09:44:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 799 transitions. [2023-11-30 09:44:24,563 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7833333333333333 [2023-11-30 09:44:24,563 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 799 transitions. [2023-11-30 09:44:24,563 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 799 transitions. [2023-11-30 09:44:24,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:24,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 799 transitions. [2023-11-30 09:44:24,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.16666666666666) internal successors, (799), 6 states have internal predecessors, (799), 0 states have call successors, (0), 0 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:44:24,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:44:24,565 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:44:24,566 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 152 predicate places. [2023-11-30 09:44:24,566 INFO L500 AbstractCegarLoop]: Abstraction has has 295 places, 473 transitions, 6868 flow [2023-11-30 09:44:24,566 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:44:24,566 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:24,566 INFO L232 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:24,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-30 09:44:24,771 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:44:24,771 INFO L425 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:24,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash 461608548, now seen corresponding path program 1 times [2023-11-30 09:44:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:24,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260294135] [2023-11-30 09:44:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:24,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:24,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:25,324 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:44:25,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260294135] [2023-11-30 09:44:25,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260294135] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:25,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373061941] [2023-11-30 09:44:25,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:25,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:25,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:25,328 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:44:25,356 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:44:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:25,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 35 conjunts are in the unsatisfiable core [2023-11-30 09:44:25,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:25,819 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:44:26,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:44:26,353 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:44:26,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:44:26,440 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:44:26,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-30 09:44:26,661 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:44:26,662 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:27,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:27,498 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 29 treesize of output 30 [2023-11-30 09:44:27,505 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:27,506 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 157 treesize of output 141 [2023-11-30 09:44:27,511 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 27 treesize of output 21 [2023-11-30 09:44:27,515 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 28 treesize of output 16 [2023-11-30 09:44:28,455 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:44:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373061941] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:28,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:28,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22, 22] total 58 [2023-11-30 09:44:28,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542702729] [2023-11-30 09:44:28,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:28,457 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-30 09:44:28,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:28,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-30 09:44:28,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=3169, Unknown=7, NotChecked=0, Total=3422 [2023-11-30 09:44:28,461 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 170 [2023-11-30 09:44:28,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 473 transitions, 6868 flow. Second operand has 59 states, 59 states have (on average 87.33898305084746) internal successors, (5153), 59 states have internal predecessors, (5153), 0 states have call successors, (0), 0 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:44:28,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:28,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 170 [2023-11-30 09:44:28,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:33,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-30 09:44:38,220 INFO L124 PetriNetUnfolderBase]: 762/2142 cut-off events. [2023-11-30 09:44:38,221 INFO L125 PetriNetUnfolderBase]: For 49519/58722 co-relation queries the response was YES. [2023-11-30 09:44:38,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14290 conditions, 2142 events. 762/2142 cut-off events. For 49519/58722 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 15966 event pairs, 79 based on Foata normal form. 223/2078 useless extension candidates. Maximal degree in co-relation 7849. Up to 1013 conditions per place. [2023-11-30 09:44:38,239 INFO L140 encePairwiseOnDemand]: 131/170 looper letters, 297 selfloop transitions, 89 changer transitions 40/501 dead transitions. [2023-11-30 09:44:38,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 349 places, 501 transitions, 8185 flow [2023-11-30 09:44:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2023-11-30 09:44:38,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2023-11-30 09:44:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 4857 transitions. [2023-11-30 09:44:38,244 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5194652406417112 [2023-11-30 09:44:38,245 INFO L72 ComplementDD]: Start complementDD. Operand 55 states and 4857 transitions. [2023-11-30 09:44:38,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 4857 transitions. [2023-11-30 09:44:38,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:38,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 55 states and 4857 transitions. [2023-11-30 09:44:38,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 56 states, 55 states have (on average 88.30909090909091) internal successors, (4857), 55 states have internal predecessors, (4857), 0 states have call successors, (0), 0 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:44:38,261 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 56 states, 56 states have (on average 170.0) internal successors, (9520), 56 states have internal predecessors, (9520), 0 states have call successors, (0), 0 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:44:38,262 INFO L81 ComplementDD]: Finished complementDD. Result has 56 states, 56 states have (on average 170.0) internal successors, (9520), 56 states have internal predecessors, (9520), 0 states have call successors, (0), 0 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:44:38,263 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 206 predicate places. [2023-11-30 09:44:38,263 INFO L500 AbstractCegarLoop]: Abstraction has has 349 places, 501 transitions, 8185 flow [2023-11-30 09:44:38,264 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 87.33898305084746) internal successors, (5153), 59 states have internal predecessors, (5153), 0 states have call successors, (0), 0 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:44:38,264 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:38,264 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, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:38,275 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:44:38,474 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:44:38,475 INFO L425 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:38,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash 2029936408, now seen corresponding path program 2 times [2023-11-30 09:44:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433675566] [2023-11-30 09:44:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:38,625 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:44:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433675566] [2023-11-30 09:44:38,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433675566] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:38,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66838189] [2023-11-30 09:44:38,626 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:38,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:38,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:38,627 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:44:38,632 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:44:38,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:44:38,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:38,716 INFO L262 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-30 09:44:38,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:38,848 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:44:38,849 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:38,959 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:44:38,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66838189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:38,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:38,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2023-11-30 09:44:38,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419856943] [2023-11-30 09:44:38,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:38,960 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-30 09:44:38,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:38,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-30 09:44:38,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2023-11-30 09:44:38,962 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 170 [2023-11-30 09:44:38,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 501 transitions, 8185 flow. Second operand has 18 states, 18 states have (on average 124.77777777777777) internal successors, (2246), 18 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:44:38,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:38,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 170 [2023-11-30 09:44:38,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:39,702 INFO L124 PetriNetUnfolderBase]: 779/2202 cut-off events. [2023-11-30 09:44:39,702 INFO L125 PetriNetUnfolderBase]: For 62420/68611 co-relation queries the response was YES. [2023-11-30 09:44:39,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15286 conditions, 2202 events. 779/2202 cut-off events. For 62420/68611 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 16635 event pairs, 85 based on Foata normal form. 56/1950 useless extension candidates. Maximal degree in co-relation 8370. Up to 1062 conditions per place. [2023-11-30 09:44:39,722 INFO L140 encePairwiseOnDemand]: 156/170 looper letters, 183 selfloop transitions, 34 changer transitions 39/513 dead transitions. [2023-11-30 09:44:39,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 513 transitions, 8859 flow [2023-11-30 09:44:39,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-30 09:44:39,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-30 09:44:39,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 2984 transitions. [2023-11-30 09:44:39,725 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7313725490196078 [2023-11-30 09:44:39,725 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 2984 transitions. [2023-11-30 09:44:39,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 2984 transitions. [2023-11-30 09:44:39,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:39,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 2984 transitions. [2023-11-30 09:44:39,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 124.33333333333333) internal successors, (2984), 24 states have internal predecessors, (2984), 0 states have call successors, (0), 0 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:44:39,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 170.0) internal successors, (4250), 25 states have internal predecessors, (4250), 0 states have call successors, (0), 0 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:44:39,734 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 170.0) internal successors, (4250), 25 states have internal predecessors, (4250), 0 states have call successors, (0), 0 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:44:39,734 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 228 predicate places. [2023-11-30 09:44:39,734 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 513 transitions, 8859 flow [2023-11-30 09:44:39,735 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 124.77777777777777) internal successors, (2246), 18 states have internal predecessors, (2246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:44:39,735 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:39,735 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:44:39,743 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:44:39,941 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,SelfDestructingSolverStorable13 [2023-11-30 09:44:39,941 INFO L425 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:39,941 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2021860684, now seen corresponding path program 1 times [2023-11-30 09:44:39,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:39,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822461767] [2023-11-30 09:44:39,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:39,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:40,019 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:44:40,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:40,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822461767] [2023-11-30 09:44:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822461767] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:40,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-30 09:44:40,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-30 09:44:40,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130395777] [2023-11-30 09:44:40,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:40,020 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-30 09:44:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-30 09:44:40,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-30 09:44:40,021 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 170 [2023-11-30 09:44:40,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 513 transitions, 8859 flow. Second operand has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:44:40,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:40,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 170 [2023-11-30 09:44:40,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:40,500 INFO L124 PetriNetUnfolderBase]: 1086/3065 cut-off events. [2023-11-30 09:44:40,500 INFO L125 PetriNetUnfolderBase]: For 128527/142565 co-relation queries the response was YES. [2023-11-30 09:44:40,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21773 conditions, 3065 events. 1086/3065 cut-off events. For 128527/142565 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 24127 event pairs, 151 based on Foata normal form. 167/2791 useless extension candidates. Maximal degree in co-relation 14613. Up to 1455 conditions per place. [2023-11-30 09:44:40,527 INFO L140 encePairwiseOnDemand]: 166/170 looper letters, 99 selfloop transitions, 86 changer transitions 148/575 dead transitions. [2023-11-30 09:44:40,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 575 transitions, 11467 flow [2023-11-30 09:44:40,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:44:40,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:44:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 596 transitions. [2023-11-30 09:44:40,528 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.8764705882352941 [2023-11-30 09:44:40,528 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 596 transitions. [2023-11-30 09:44:40,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 596 transitions. [2023-11-30 09:44:40,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:40,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 596 transitions. [2023-11-30 09:44:40,529 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 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:44:40,530 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:44:40,530 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:44:40,531 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 228 predicate places. [2023-11-30 09:44:40,531 INFO L500 AbstractCegarLoop]: Abstraction has has 371 places, 575 transitions, 11467 flow [2023-11-30 09:44:40,531 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 146.25) internal successors, (585), 4 states have internal predecessors, (585), 0 states have call successors, (0), 0 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:44:40,531 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:40,531 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:40,531 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-30 09:44:40,531 INFO L425 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:40,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:40,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1467614728, now seen corresponding path program 2 times [2023-11-30 09:44:40,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:40,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770785461] [2023-11-30 09:44:40,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:40,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:40,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:41,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:41,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770785461] [2023-11-30 09:44:41,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770785461] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:41,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310309052] [2023-11-30 09:44:41,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:41,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:41,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:41,844 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:44:41,854 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:44:41,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:44:41,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:41,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 09:44:41,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:41,938 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:44:42,028 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:44:42,028 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:44:42,273 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:44:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:44:42,347 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:42,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310309052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:42,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:42,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20] total 30 [2023-11-30 09:44:42,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280278665] [2023-11-30 09:44:42,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:42,348 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:44:42,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:42,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:44:42,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2023-11-30 09:44:42,350 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 170 [2023-11-30 09:44:42,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 575 transitions, 11467 flow. Second operand has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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:44:42,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:42,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 170 [2023-11-30 09:44:42,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:43,164 INFO L124 PetriNetUnfolderBase]: 1099/3137 cut-off events. [2023-11-30 09:44:43,164 INFO L125 PetriNetUnfolderBase]: For 106226/120334 co-relation queries the response was YES. [2023-11-30 09:44:43,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24243 conditions, 3137 events. 1099/3137 cut-off events. For 106226/120334 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 25021 event pairs, 155 based on Foata normal form. 215/2948 useless extension candidates. Maximal degree in co-relation 16028. Up to 1501 conditions per place. [2023-11-30 09:44:43,196 INFO L140 encePairwiseOnDemand]: 154/170 looper letters, 258 selfloop transitions, 33 changer transitions 149/577 dead transitions. [2023-11-30 09:44:43,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 577 transitions, 12393 flow [2023-11-30 09:44:43,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 09:44:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 09:44:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1654 transitions. [2023-11-30 09:44:43,198 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6486274509803922 [2023-11-30 09:44:43,198 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1654 transitions. [2023-11-30 09:44:43,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1654 transitions. [2023-11-30 09:44:43,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:43,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1654 transitions. [2023-11-30 09:44:43,201 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 110.26666666666667) internal successors, (1654), 15 states have internal predecessors, (1654), 0 states have call successors, (0), 0 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:44:43,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:43,203 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:43,204 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 242 predicate places. [2023-11-30 09:44:43,204 INFO L500 AbstractCegarLoop]: Abstraction has has 385 places, 577 transitions, 12393 flow [2023-11-30 09:44:43,204 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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:44:43,205 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:43,205 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] [2023-11-30 09:44:43,216 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:44:43,416 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:44:43,416 INFO L425 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:43,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:43,417 INFO L85 PathProgramCache]: Analyzing trace with hash -2028278842, now seen corresponding path program 2 times [2023-11-30 09:44:43,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:43,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001190790] [2023-11-30 09:44:43,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:43,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:43,485 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:44:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001190790] [2023-11-30 09:44:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001190790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197488784] [2023-11-30 09:44:43,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:43,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:43,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:43,487 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:44:43,504 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:44:43,581 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:44:43,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:43,583 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-30 09:44:43,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:43,614 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:44:43,614 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:43,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197488784] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:43,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:43,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-11-30 09:44:43,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713992811] [2023-11-30 09:44:43,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:43,615 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-30 09:44:43,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:43,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-30 09:44:43,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-30 09:44:43,617 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2023-11-30 09:44:43,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 577 transitions, 12393 flow. Second operand has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 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:44:43,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:43,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2023-11-30 09:44:43,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:44,266 INFO L124 PetriNetUnfolderBase]: 999/2879 cut-off events. [2023-11-30 09:44:44,266 INFO L125 PetriNetUnfolderBase]: For 109927/121901 co-relation queries the response was YES. [2023-11-30 09:44:44,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23779 conditions, 2879 events. 999/2879 cut-off events. For 109927/121901 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 22502 event pairs, 76 based on Foata normal form. 134/2655 useless extension candidates. Maximal degree in co-relation 15265. Up to 1352 conditions per place. [2023-11-30 09:44:44,295 INFO L140 encePairwiseOnDemand]: 165/170 looper letters, 217 selfloop transitions, 7 changer transitions 154/604 dead transitions. [2023-11-30 09:44:44,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 604 transitions, 13919 flow [2023-11-30 09:44:44,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-30 09:44:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-30 09:44:44,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 569 transitions. [2023-11-30 09:44:44,296 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.836764705882353 [2023-11-30 09:44:44,297 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 569 transitions. [2023-11-30 09:44:44,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 569 transitions. [2023-11-30 09:44:44,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:44,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 569 transitions. [2023-11-30 09:44:44,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.25) internal successors, (569), 4 states have internal predecessors, (569), 0 states have call successors, (0), 0 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:44:44,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:44:44,299 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 170.0) internal successors, (850), 5 states have internal predecessors, (850), 0 states have call successors, (0), 0 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:44:44,299 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 244 predicate places. [2023-11-30 09:44:44,299 INFO L500 AbstractCegarLoop]: Abstraction has has 387 places, 604 transitions, 13919 flow [2023-11-30 09:44:44,299 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 139.6) internal successors, (698), 5 states have internal predecessors, (698), 0 states have call successors, (0), 0 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:44:44,299 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:44,300 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:44,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-30 09:44:44,507 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:44:44,507 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:44:44,507 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:44,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1115811718, now seen corresponding path program 3 times [2023-11-30 09:44:44,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:44,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63572600] [2023-11-30 09:44:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:44,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:45,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:45,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63572600] [2023-11-30 09:44:45,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63572600] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:45,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769366185] [2023-11-30 09:44:45,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:44:45,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:45,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:45,458 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:44:45,459 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:44:45,533 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-30 09:44:45,533 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:45,534 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-30 09:44:45,535 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:45,661 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:44:45,661 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:45,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769366185] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:45,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:45,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2023-11-30 09:44:45,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693812265] [2023-11-30 09:44:45,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:45,662 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:44:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:45,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:44:45,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2023-11-30 09:44:45,663 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2023-11-30 09:44:45,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 387 places, 604 transitions, 13919 flow. Second operand has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 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:44:45,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:45,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2023-11-30 09:44:45,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:46,266 INFO L124 PetriNetUnfolderBase]: 1107/3054 cut-off events. [2023-11-30 09:44:46,266 INFO L125 PetriNetUnfolderBase]: For 142146/163995 co-relation queries the response was YES. [2023-11-30 09:44:46,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27626 conditions, 3054 events. 1107/3054 cut-off events. For 142146/163995 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 23304 event pairs, 97 based on Foata normal form. 87/2758 useless extension candidates. Maximal degree in co-relation 18420. Up to 1578 conditions per place. [2023-11-30 09:44:46,290 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 285 selfloop transitions, 20 changer transitions 156/612 dead transitions. [2023-11-30 09:44:46,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 612 transitions, 15051 flow [2023-11-30 09:44:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 09:44:46,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 09:44:46,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 801 transitions. [2023-11-30 09:44:46,291 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7852941176470588 [2023-11-30 09:44:46,291 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 801 transitions. [2023-11-30 09:44:46,291 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 801 transitions. [2023-11-30 09:44:46,291 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:46,291 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 801 transitions. [2023-11-30 09:44:46,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.5) internal successors, (801), 6 states have internal predecessors, (801), 0 states have call successors, (0), 0 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:44:46,293 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:44:46,293 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:44:46,295 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 249 predicate places. [2023-11-30 09:44:46,295 INFO L500 AbstractCegarLoop]: Abstraction has has 392 places, 612 transitions, 15051 flow [2023-11-30 09:44:46,295 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 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:44:46,295 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:46,295 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:46,306 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:44:46,501 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:44:46,501 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:44:46,502 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1715046167, now seen corresponding path program 1 times [2023-11-30 09:44:46,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:46,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350175826] [2023-11-30 09:44:46,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:46,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:47,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:47,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350175826] [2023-11-30 09:44:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350175826] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:47,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385856011] [2023-11-30 09:44:47,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:47,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:47,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:47,260 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:44:47,264 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:44:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:47,338 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-30 09:44:47,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:47,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:47,730 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:47,783 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:44:47,784 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:44:48,570 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:48,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385856011] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:48,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:48,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 42 [2023-11-30 09:44:48,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680125246] [2023-11-30 09:44:48,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:48,571 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-30 09:44:48,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:48,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-30 09:44:48,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=1478, Unknown=0, NotChecked=0, Total=1806 [2023-11-30 09:44:48,576 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 170 [2023-11-30 09:44:48,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 612 transitions, 15051 flow. Second operand has 43 states, 43 states have (on average 98.16279069767442) internal successors, (4221), 43 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:44:48,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:48,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 170 [2023-11-30 09:44:48,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:50,581 INFO L124 PetriNetUnfolderBase]: 1382/4423 cut-off events. [2023-11-30 09:44:50,581 INFO L125 PetriNetUnfolderBase]: For 174335/192385 co-relation queries the response was YES. [2023-11-30 09:44:50,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38251 conditions, 4423 events. 1382/4423 cut-off events. For 174335/192385 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 37592 event pairs, 89 based on Foata normal form. 221/4165 useless extension candidates. Maximal degree in co-relation 26095. Up to 1998 conditions per place. [2023-11-30 09:44:50,622 INFO L140 encePairwiseOnDemand]: 140/170 looper letters, 343 selfloop transitions, 148 changer transitions 182/759 dead transitions. [2023-11-30 09:44:50,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 759 transitions, 20286 flow [2023-11-30 09:44:50,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-30 09:44:50,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-30 09:44:50,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 4158 transitions. [2023-11-30 09:44:50,628 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5823529411764706 [2023-11-30 09:44:50,628 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 4158 transitions. [2023-11-30 09:44:50,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 4158 transitions. [2023-11-30 09:44:50,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:50,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 4158 transitions. [2023-11-30 09:44:50,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 99.0) internal successors, (4158), 42 states have internal predecessors, (4158), 0 states have call successors, (0), 0 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:44:50,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 170.0) internal successors, (7310), 43 states have internal predecessors, (7310), 0 states have call successors, (0), 0 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:44:50,640 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 170.0) internal successors, (7310), 43 states have internal predecessors, (7310), 0 states have call successors, (0), 0 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:44:50,640 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 290 predicate places. [2023-11-30 09:44:50,640 INFO L500 AbstractCegarLoop]: Abstraction has has 433 places, 759 transitions, 20286 flow [2023-11-30 09:44:50,641 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 98.16279069767442) internal successors, (4221), 43 states have internal predecessors, (4221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-30 09:44:50,641 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:50,642 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:50,647 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:44:50,847 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:44:50,847 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:44:50,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:50,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1311791871, now seen corresponding path program 2 times [2023-11-30 09:44:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:50,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898344818] [2023-11-30 09:44:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:52,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898344818] [2023-11-30 09:44:52,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898344818] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:52,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269733949] [2023-11-30 09:44:52,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:52,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:52,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:52,157 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:44:52,172 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:44:52,256 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:44:52,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:52,258 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-30 09:44:52,261 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:52,267 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:44:52,357 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:44:52,357 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:44:52,600 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:44:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:44:52,693 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269733949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:52,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:52,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [20] total 30 [2023-11-30 09:44:52,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237611333] [2023-11-30 09:44:52,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:52,693 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:44:52,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:52,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:44:52,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=855, Unknown=0, NotChecked=0, Total=930 [2023-11-30 09:44:52,695 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 170 [2023-11-30 09:44:52,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 759 transitions, 20286 flow. Second operand has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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:44:52,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:52,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 170 [2023-11-30 09:44:52,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:53,881 INFO L124 PetriNetUnfolderBase]: 1353/4417 cut-off events. [2023-11-30 09:44:53,881 INFO L125 PetriNetUnfolderBase]: For 179574/191036 co-relation queries the response was YES. [2023-11-30 09:44:53,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40147 conditions, 4417 events. 1353/4417 cut-off events. For 179574/191036 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 38013 event pairs, 78 based on Foata normal form. 65/4004 useless extension candidates. Maximal degree in co-relation 27147. Up to 1989 conditions per place. [2023-11-30 09:44:53,915 INFO L140 encePairwiseOnDemand]: 155/170 looper letters, 416 selfloop transitions, 25 changer transitions 202/780 dead transitions. [2023-11-30 09:44:53,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 780 transitions, 22079 flow [2023-11-30 09:44:53,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 09:44:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 09:44:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1648 transitions. [2023-11-30 09:44:53,917 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6462745098039215 [2023-11-30 09:44:53,917 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1648 transitions. [2023-11-30 09:44:53,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1648 transitions. [2023-11-30 09:44:53,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:53,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1648 transitions. [2023-11-30 09:44:53,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 109.86666666666666) internal successors, (1648), 15 states have internal predecessors, (1648), 0 states have call successors, (0), 0 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:44:53,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:53,921 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:44:53,922 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 304 predicate places. [2023-11-30 09:44:53,922 INFO L500 AbstractCegarLoop]: Abstraction has has 447 places, 780 transitions, 22079 flow [2023-11-30 09:44:53,922 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.61538461538461) internal successors, (1399), 13 states have internal predecessors, (1399), 0 states have call successors, (0), 0 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:44:53,922 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:53,922 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] [2023-11-30 09:44:53,931 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:44:54,130 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:44:54,131 INFO L425 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:44:54,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:54,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1547865920, now seen corresponding path program 1 times [2023-11-30 09:44:54,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:54,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196186858] [2023-11-30 09:44:54,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:54,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:54,203 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:44:54,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196186858] [2023-11-30 09:44:54,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196186858] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:54,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859029997] [2023-11-30 09:44:54,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:54,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:54,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:54,205 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:44:54,225 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:44:54,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:54,296 INFO L262 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-30 09:44:54,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:54,320 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:44:54,320 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:44:54,357 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:44:54,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859029997] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:44:54,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:44:54,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2023-11-30 09:44:54,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501414111] [2023-11-30 09:44:54,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:44:54,358 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-30 09:44:54,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:54,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-30 09:44:54,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-30 09:44:54,359 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 170 [2023-11-30 09:44:54,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 780 transitions, 22079 flow. Second operand has 12 states, 12 states have (on average 139.83333333333334) internal successors, (1678), 12 states have internal predecessors, (1678), 0 states have call successors, (0), 0 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:44:54,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:54,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 170 [2023-11-30 09:44:54,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:44:56,298 INFO L124 PetriNetUnfolderBase]: 2200/6631 cut-off events. [2023-11-30 09:44:56,298 INFO L125 PetriNetUnfolderBase]: For 308175/339582 co-relation queries the response was YES. [2023-11-30 09:44:56,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63728 conditions, 6631 events. 2200/6631 cut-off events. For 308175/339582 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 57975 event pairs, 62 based on Foata normal form. 221/6125 useless extension candidates. Maximal degree in co-relation 49727. Up to 3598 conditions per place. [2023-11-30 09:44:56,363 INFO L140 encePairwiseOnDemand]: 163/170 looper letters, 458 selfloop transitions, 18 changer transitions 202/967 dead transitions. [2023-11-30 09:44:56,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 460 places, 967 transitions, 30245 flow [2023-11-30 09:44:56,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-30 09:44:56,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-30 09:44:56,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1996 transitions. [2023-11-30 09:44:56,365 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.838655462184874 [2023-11-30 09:44:56,365 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1996 transitions. [2023-11-30 09:44:56,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1996 transitions. [2023-11-30 09:44:56,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:44:56,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1996 transitions. [2023-11-30 09:44:56,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 142.57142857142858) internal successors, (1996), 14 states have internal predecessors, (1996), 0 states have call successors, (0), 0 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:44:56,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 170.0) internal successors, (2550), 15 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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:44:56,370 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 170.0) internal successors, (2550), 15 states have internal predecessors, (2550), 0 states have call successors, (0), 0 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:44:56,370 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 317 predicate places. [2023-11-30 09:44:56,370 INFO L500 AbstractCegarLoop]: Abstraction has has 460 places, 967 transitions, 30245 flow [2023-11-30 09:44:56,370 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 139.83333333333334) internal successors, (1678), 12 states have internal predecessors, (1678), 0 states have call successors, (0), 0 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:44:56,370 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:44:56,370 INFO L232 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44:56,376 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:44:56,575 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:44:56,576 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:44:56,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:44:56,576 INFO L85 PathProgramCache]: Analyzing trace with hash 2010842937, now seen corresponding path program 2 times [2023-11-30 09:44:56,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:44:56,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385886337] [2023-11-30 09:44:56,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:44:56,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:44:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:44:57,880 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:44:57,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:44:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385886337] [2023-11-30 09:44:57,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385886337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:44:57,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514238633] [2023-11-30 09:44:57,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:44:57,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:44:57,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:44:57,881 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:44:57,883 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:44:57,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-30 09:44:57,962 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:44:57,962 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-30 09:44:57,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:44:57,972 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:44:58,059 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-30 09:44:58,059 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:44:58,289 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:44:58,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-30 09:44:58,398 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:44:58,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514238633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:44:58,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:44:58,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [25] total 36 [2023-11-30 09:44:58,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450051789] [2023-11-30 09:44:58,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:44:58,399 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-30 09:44:58,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:44:58,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-30 09:44:58,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1237, Unknown=0, NotChecked=0, Total=1332 [2023-11-30 09:44:58,400 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 170 [2023-11-30 09:44:58,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 460 places, 967 transitions, 30245 flow. Second operand has 13 states, 13 states have (on average 107.6923076923077) internal successors, (1400), 13 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:44:58,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:44:58,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 170 [2023-11-30 09:44:58,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:45:00,381 INFO L124 PetriNetUnfolderBase]: 2155/6561 cut-off events. [2023-11-30 09:45:00,381 INFO L125 PetriNetUnfolderBase]: For 336566/376198 co-relation queries the response was YES. [2023-11-30 09:45:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65835 conditions, 6561 events. 2155/6561 cut-off events. For 336566/376198 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 57217 event pairs, 52 based on Foata normal form. 63/5922 useless extension candidates. Maximal degree in co-relation 51186. Up to 3598 conditions per place. [2023-11-30 09:45:00,446 INFO L140 encePairwiseOnDemand]: 155/170 looper letters, 563 selfloop transitions, 21 changer transitions 222/966 dead transitions. [2023-11-30 09:45:00,446 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 966 transitions, 31819 flow [2023-11-30 09:45:00,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-30 09:45:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2023-11-30 09:45:00,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1647 transitions. [2023-11-30 09:45:00,447 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.6458823529411765 [2023-11-30 09:45:00,447 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1647 transitions. [2023-11-30 09:45:00,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1647 transitions. [2023-11-30 09:45:00,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:45:00,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1647 transitions. [2023-11-30 09:45:00,450 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 109.8) internal successors, (1647), 15 states have internal predecessors, (1647), 0 states have call successors, (0), 0 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:45:00,452 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:45:00,452 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 170.0) internal successors, (2720), 16 states have internal predecessors, (2720), 0 states have call successors, (0), 0 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:45:00,452 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 331 predicate places. [2023-11-30 09:45:00,452 INFO L500 AbstractCegarLoop]: Abstraction has has 474 places, 966 transitions, 31819 flow [2023-11-30 09:45:00,453 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 107.6923076923077) internal successors, (1400), 13 states have internal predecessors, (1400), 0 states have call successors, (0), 0 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:45:00,453 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:45:00,453 INFO L232 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:45:00,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-30 09:45:00,656 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:45:00,657 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:45:00,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:45:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash 383921378, now seen corresponding path program 3 times [2023-11-30 09:45:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:45:00,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127253174] [2023-11-30 09:45:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:45:00,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:45:02,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:45:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127253174] [2023-11-30 09:45:02,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127253174] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:45:02,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107500511] [2023-11-30 09:45:02,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:45:02,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:45:02,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:45:02,309 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:45:02,311 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:45:02,391 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-30 09:45:02,392 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:45:02,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-30 09:45:02,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:45:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-30 09:45:02,583 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-30 09:45:02,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107500511] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-30 09:45:02,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-30 09:45:02,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [26] total 30 [2023-11-30 09:45:02,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605752962] [2023-11-30 09:45:02,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-30 09:45:02,584 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-30 09:45:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:45:02,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-30 09:45:02,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=850, Unknown=0, NotChecked=0, Total=930 [2023-11-30 09:45:02,585 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 170 [2023-11-30 09:45:02,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 966 transitions, 31819 flow. Second operand has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:45:02,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:45:02,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 170 [2023-11-30 09:45:02,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:45:04,103 INFO L124 PetriNetUnfolderBase]: 2246/6800 cut-off events. [2023-11-30 09:45:04,104 INFO L125 PetriNetUnfolderBase]: For 387597/433758 co-relation queries the response was YES. [2023-11-30 09:45:04,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71844 conditions, 6800 events. 2246/6800 cut-off events. For 387597/433758 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 59822 event pairs, 72 based on Foata normal form. 90/6180 useless extension candidates. Maximal degree in co-relation 55939. Up to 3629 conditions per place. [2023-11-30 09:45:04,174 INFO L140 encePairwiseOnDemand]: 164/170 looper letters, 549 selfloop transitions, 7 changer transitions 244/979 dead transitions. [2023-11-30 09:45:04,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 479 places, 979 transitions, 33752 flow [2023-11-30 09:45:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-30 09:45:04,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-30 09:45:04,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 796 transitions. [2023-11-30 09:45:04,177 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.7803921568627451 [2023-11-30 09:45:04,177 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 796 transitions. [2023-11-30 09:45:04,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 796 transitions. [2023-11-30 09:45:04,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:45:04,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 796 transitions. [2023-11-30 09:45:04,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 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:45:04,178 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:45:04,179 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 170.0) internal successors, (1190), 7 states have internal predecessors, (1190), 0 states have call successors, (0), 0 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:45:04,179 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 336 predicate places. [2023-11-30 09:45:04,179 INFO L500 AbstractCegarLoop]: Abstraction has has 479 places, 979 transitions, 33752 flow [2023-11-30 09:45:04,179 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.33333333333333) internal successors, (764), 6 states have internal predecessors, (764), 0 states have call successors, (0), 0 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:45:04,179 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:45:04,179 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:45:04,185 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 09:45:04,379 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 09:45:04,380 INFO L425 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:45:04,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:45:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1947798412, now seen corresponding path program 1 times [2023-11-30 09:45:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:45:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913923632] [2023-11-30 09:45:04,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:45:04,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:05,683 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:45:05,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:45:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913923632] [2023-11-30 09:45:05,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913923632] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:45:05,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190556412] [2023-11-30 09:45:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:45:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:45:05,684 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 09:45:05,686 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 09:45:05,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:05,771 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-30 09:45:05,773 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:45:06,380 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:45:06,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:45:06,557 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-30 09:45:06,558 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:45:07,333 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:45:07,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190556412] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:45:07,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:45:07,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 16] total 58 [2023-11-30 09:45:07,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401834788] [2023-11-30 09:45:07,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:45:07,334 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2023-11-30 09:45:07,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:45:07,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2023-11-30 09:45:07,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3139, Unknown=0, NotChecked=0, Total=3422 [2023-11-30 09:45:07,337 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 170 [2023-11-30 09:45:07,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 979 transitions, 33752 flow. Second operand has 59 states, 59 states have (on average 88.03389830508475) internal successors, (5194), 59 states have internal predecessors, (5194), 0 states have call successors, (0), 0 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:45:07,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:45:07,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 170 [2023-11-30 09:45:07,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:45:22,914 INFO L124 PetriNetUnfolderBase]: 6884/21713 cut-off events. [2023-11-30 09:45:22,914 INFO L125 PetriNetUnfolderBase]: For 1417515/1605005 co-relation queries the response was YES. [2023-11-30 09:45:23,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226769 conditions, 21713 events. 6884/21713 cut-off events. For 1417515/1605005 co-relation queries the response was YES. Maximal size of possible extension queue 685. Compared 250467 event pairs, 54 based on Foata normal form. 2501/21888 useless extension candidates. Maximal degree in co-relation 110238. Up to 13307 conditions per place. [2023-11-30 09:45:23,260 INFO L140 encePairwiseOnDemand]: 133/170 looper letters, 1516 selfloop transitions, 952 changer transitions 321/2886 dead transitions. [2023-11-30 09:45:23,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 2886 transitions, 110229 flow [2023-11-30 09:45:23,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2023-11-30 09:45:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2023-11-30 09:45:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 11991 transitions. [2023-11-30 09:45:23,272 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5343582887700534 [2023-11-30 09:45:23,272 INFO L72 ComplementDD]: Start complementDD. Operand 132 states and 11991 transitions. [2023-11-30 09:45:23,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 132 states and 11991 transitions. [2023-11-30 09:45:23,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:45:23,276 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 132 states and 11991 transitions. [2023-11-30 09:45:23,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 133 states, 132 states have (on average 90.8409090909091) internal successors, (11991), 132 states have internal predecessors, (11991), 0 states have call successors, (0), 0 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:45:23,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 133 states, 133 states have (on average 170.0) internal successors, (22610), 133 states have internal predecessors, (22610), 0 states have call successors, (0), 0 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:45:23,319 INFO L81 ComplementDD]: Finished complementDD. Result has 133 states, 133 states have (on average 170.0) internal successors, (22610), 133 states have internal predecessors, (22610), 0 states have call successors, (0), 0 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:45:23,320 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 467 predicate places. [2023-11-30 09:45:23,320 INFO L500 AbstractCegarLoop]: Abstraction has has 610 places, 2886 transitions, 110229 flow [2023-11-30 09:45:23,321 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 88.03389830508475) internal successors, (5194), 59 states have internal predecessors, (5194), 0 states have call successors, (0), 0 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:45:23,321 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:45:23,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:45:23,330 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 09:45:23,527 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 09:45:23,527 INFO L425 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:45:23,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:45:23,528 INFO L85 PathProgramCache]: Analyzing trace with hash 355522922, now seen corresponding path program 2 times [2023-11-30 09:45:23,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:45:23,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080833791] [2023-11-30 09:45:23,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:23,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:45:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:24,258 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:45:24,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:45:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080833791] [2023-11-30 09:45:24,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080833791] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:45:24,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188969710] [2023-11-30 09:45:24,258 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:45:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:45:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:45:24,259 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 09:45:24,260 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 09:45:24,362 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:45:24,362 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:45:24,363 INFO L262 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-30 09:45:24,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:45:24,822 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:45:25,103 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:45:25,152 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:45:25,433 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-30 09:45:25,433 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:45:25,456 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:45:25,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:45:28,947 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:45:28,948 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:45:28,957 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2023-11-30 09:45:28,957 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:45:28,972 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 09:45:28,973 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:45:28,985 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-30 09:45:28,985 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:45:29,531 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:45:29,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188969710] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:45:29,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:45:29,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 25, 21] total 65 [2023-11-30 09:45:29,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411354170] [2023-11-30 09:45:29,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:45:29,533 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2023-11-30 09:45:29,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:45:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2023-11-30 09:45:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3759, Unknown=16, NotChecked=0, Total=4290 [2023-11-30 09:45:29,536 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-11-30 09:45:29,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 2886 transitions, 110229 flow. Second operand has 66 states, 66 states have (on average 90.43939393939394) internal successors, (5969), 66 states have internal predecessors, (5969), 0 states have call successors, (0), 0 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:45:29,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:45:29,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-11-30 09:45:29,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:45:45,040 INFO L124 PetriNetUnfolderBase]: 6280/19459 cut-off events. [2023-11-30 09:45:45,040 INFO L125 PetriNetUnfolderBase]: For 1355683/1471248 co-relation queries the response was YES. [2023-11-30 09:45:45,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216893 conditions, 19459 events. 6280/19459 cut-off events. For 1355683/1471248 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 217524 event pairs, 63 based on Foata normal form. 1731/19196 useless extension candidates. Maximal degree in co-relation 96107. Up to 11511 conditions per place. [2023-11-30 09:45:45,307 INFO L140 encePairwiseOnDemand]: 136/170 looper letters, 1625 selfloop transitions, 619 changer transitions 353/2706 dead transitions. [2023-11-30 09:45:45,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 2706 transitions, 108046 flow [2023-11-30 09:45:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2023-11-30 09:45:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2023-11-30 09:45:45,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 5522 transitions. [2023-11-30 09:45:45,312 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5413725490196079 [2023-11-30 09:45:45,312 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 5522 transitions. [2023-11-30 09:45:45,312 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 5522 transitions. [2023-11-30 09:45:45,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:45:45,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 5522 transitions. [2023-11-30 09:45:45,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 92.03333333333333) internal successors, (5522), 60 states have internal predecessors, (5522), 0 states have call successors, (0), 0 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:45:45,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 170.0) internal successors, (10370), 61 states have internal predecessors, (10370), 0 states have call successors, (0), 0 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:45:45,326 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 170.0) internal successors, (10370), 61 states have internal predecessors, (10370), 0 states have call successors, (0), 0 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:45:45,326 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 514 predicate places. [2023-11-30 09:45:45,326 INFO L500 AbstractCegarLoop]: Abstraction has has 657 places, 2706 transitions, 108046 flow [2023-11-30 09:45:45,327 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 90.43939393939394) internal successors, (5969), 66 states have internal predecessors, (5969), 0 states have call successors, (0), 0 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:45:45,327 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:45:45,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:45:45,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2023-11-30 09:45:45,536 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 09:45:45,536 INFO L425 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:45:45,537 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:45:45,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1977397294, now seen corresponding path program 1 times [2023-11-30 09:45:45,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:45:45,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152249653] [2023-11-30 09:45:45,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:45,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:45:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:46,452 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:45:46,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:45:46,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152249653] [2023-11-30 09:45:46,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152249653] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:45:46,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588431460] [2023-11-30 09:45:46,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:45:46,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:45:46,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:45:46,456 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 09:45:46,464 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 09:45:46,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:45:46,561 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-30 09:45:46,563 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:45:47,387 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:45:47,387 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:45:47,620 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2023-11-30 09:45:47,620 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 48 treesize of output 37 [2023-11-30 09:45:48,295 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:45:48,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588431460] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:45:48,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:45:48,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 16] total 57 [2023-11-30 09:45:48,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76815331] [2023-11-30 09:45:48,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:45:48,296 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2023-11-30 09:45:48,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:45:48,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2023-11-30 09:45:48,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=2907, Unknown=0, NotChecked=0, Total=3306 [2023-11-30 09:45:48,300 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 170 [2023-11-30 09:45:48,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 2706 transitions, 108046 flow. Second operand has 58 states, 58 states have (on average 97.70689655172414) internal successors, (5667), 58 states have internal predecessors, (5667), 0 states have call successors, (0), 0 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:45:48,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:45:48,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 170 [2023-11-30 09:45:48,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:46:05,546 INFO L124 PetriNetUnfolderBase]: 7975/24363 cut-off events. [2023-11-30 09:46:05,547 INFO L125 PetriNetUnfolderBase]: For 1789936/1927521 co-relation queries the response was YES. [2023-11-30 09:46:05,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286190 conditions, 24363 events. 7975/24363 cut-off events. For 1789936/1927521 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 285628 event pairs, 113 based on Foata normal form. 1965/23856 useless extension candidates. Maximal degree in co-relation 138253. Up to 14500 conditions per place. [2023-11-30 09:46:05,902 INFO L140 encePairwiseOnDemand]: 138/170 looper letters, 1943 selfloop transitions, 809 changer transitions 452/3316 dead transitions. [2023-11-30 09:46:05,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 3316 transitions, 140225 flow [2023-11-30 09:46:05,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2023-11-30 09:46:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2023-11-30 09:46:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 7499 transitions. [2023-11-30 09:46:05,908 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.588156862745098 [2023-11-30 09:46:05,909 INFO L72 ComplementDD]: Start complementDD. Operand 75 states and 7499 transitions. [2023-11-30 09:46:05,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 7499 transitions. [2023-11-30 09:46:05,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:46:05,910 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 75 states and 7499 transitions. [2023-11-30 09:46:05,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 76 states, 75 states have (on average 99.98666666666666) internal successors, (7499), 75 states have internal predecessors, (7499), 0 states have call successors, (0), 0 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:46:05,925 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 76 states, 76 states have (on average 170.0) internal successors, (12920), 76 states have internal predecessors, (12920), 0 states have call successors, (0), 0 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:46:05,926 INFO L81 ComplementDD]: Finished complementDD. Result has 76 states, 76 states have (on average 170.0) internal successors, (12920), 76 states have internal predecessors, (12920), 0 states have call successors, (0), 0 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:46:05,926 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 588 predicate places. [2023-11-30 09:46:05,926 INFO L500 AbstractCegarLoop]: Abstraction has has 731 places, 3316 transitions, 140225 flow [2023-11-30 09:46:05,927 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 97.70689655172414) internal successors, (5667), 58 states have internal predecessors, (5667), 0 states have call successors, (0), 0 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:46:05,927 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:46:05,927 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:46:05,935 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 09:46:06,132 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 09:46:06,133 INFO L425 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:46:06,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:46:06,133 INFO L85 PathProgramCache]: Analyzing trace with hash -477100582, now seen corresponding path program 2 times [2023-11-30 09:46:06,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:46:06,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241543383] [2023-11-30 09:46:06,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:46:06,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:46:06,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:46:06,971 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:46:06,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:46:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241543383] [2023-11-30 09:46:06,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241543383] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:46:06,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698292969] [2023-11-30 09:46:06,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:46:06,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:46:06,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:46:06,972 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 09:46:06,980 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 09:46:07,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:46:07,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:46:07,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-30 09:46:07,100 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:46:08,006 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2023-11-30 09:46:08,007 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 46 treesize of output 19 [2023-11-30 09:46:08,029 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:46:08,029 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:46:08,356 INFO L349 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2023-11-30 09:46:08,356 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 47 treesize of output 42 [2023-11-30 09:46:09,776 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:46:09,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698292969] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:46:09,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:46:09,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 16, 15] total 48 [2023-11-30 09:46:09,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924158934] [2023-11-30 09:46:09,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:46:09,777 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-30 09:46:09,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:46:09,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-30 09:46:09,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=2037, Unknown=0, NotChecked=0, Total=2352 [2023-11-30 09:46:09,779 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 170 [2023-11-30 09:46:09,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 731 places, 3316 transitions, 140225 flow. Second operand has 49 states, 49 states have (on average 98.06122448979592) internal successors, (4805), 49 states have internal predecessors, (4805), 0 states have call successors, (0), 0 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:46:09,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:46:09,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 170 [2023-11-30 09:46:09,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:46:37,237 INFO L124 PetriNetUnfolderBase]: 10119/30833 cut-off events. [2023-11-30 09:46:37,237 INFO L125 PetriNetUnfolderBase]: For 2516856/2701996 co-relation queries the response was YES. [2023-11-30 09:46:37,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 379897 conditions, 30833 events. 10119/30833 cut-off events. For 2516856/2701996 co-relation queries the response was YES. Maximal size of possible extension queue 1076. Compared 378536 event pairs, 107 based on Foata normal form. 3357/31080 useless extension candidates. Maximal degree in co-relation 220260. Up to 18515 conditions per place. [2023-11-30 09:46:37,772 INFO L140 encePairwiseOnDemand]: 134/170 looper letters, 2280 selfloop transitions, 1244 changer transitions 702/4338 dead transitions. [2023-11-30 09:46:37,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 809 places, 4338 transitions, 191913 flow [2023-11-30 09:46:37,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2023-11-30 09:46:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2023-11-30 09:46:37,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 7847 transitions. [2023-11-30 09:46:37,778 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.584288905435592 [2023-11-30 09:46:37,778 INFO L72 ComplementDD]: Start complementDD. Operand 79 states and 7847 transitions. [2023-11-30 09:46:37,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 79 states and 7847 transitions. [2023-11-30 09:46:37,779 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:46:37,779 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 79 states and 7847 transitions. [2023-11-30 09:46:37,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 80 states, 79 states have (on average 99.32911392405063) internal successors, (7847), 79 states have internal predecessors, (7847), 0 states have call successors, (0), 0 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:46:37,799 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 80 states, 80 states have (on average 170.0) internal successors, (13600), 80 states have internal predecessors, (13600), 0 states have call successors, (0), 0 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:46:37,800 INFO L81 ComplementDD]: Finished complementDD. Result has 80 states, 80 states have (on average 170.0) internal successors, (13600), 80 states have internal predecessors, (13600), 0 states have call successors, (0), 0 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:46:37,801 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 666 predicate places. [2023-11-30 09:46:37,801 INFO L500 AbstractCegarLoop]: Abstraction has has 809 places, 4338 transitions, 191913 flow [2023-11-30 09:46:37,801 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 98.06122448979592) internal successors, (4805), 49 states have internal predecessors, (4805), 0 states have call successors, (0), 0 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:46:37,802 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:46:37,802 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:46:37,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-11-30 09:46:38,006 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 09:46:38,007 INFO L425 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:46:38,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:46:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash -973885644, now seen corresponding path program 3 times [2023-11-30 09:46:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:46:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234271695] [2023-11-30 09:46:38,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:46:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:46:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:46:38,756 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:46:38,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:46:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234271695] [2023-11-30 09:46:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234271695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:46:38,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093186744] [2023-11-30 09:46:38,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-30 09:46:38,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:46:38,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:46:38,758 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 09:46:38,759 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 09:46:38,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-30 09:46:38,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:46:38,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-30 09:46:38,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:46:39,282 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:46:39,282 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:46:39,474 INFO L349 Elim1Store]: treesize reduction 13, result has 64.9 percent of original size [2023-11-30 09:46:39,474 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 48 treesize of output 37 [2023-11-30 09:46:39,553 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:46:39,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093186744] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:46:39,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:46:39,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 8, 8] total 35 [2023-11-30 09:46:39,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653245978] [2023-11-30 09:46:39,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:46:39,555 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-30 09:46:39,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:46:39,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-30 09:46:39,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2023-11-30 09:46:39,557 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 170 [2023-11-30 09:46:39,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 809 places, 4338 transitions, 191913 flow. Second operand has 36 states, 36 states have (on average 98.11111111111111) internal successors, (3532), 36 states have internal predecessors, (3532), 0 states have call successors, (0), 0 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:46:39,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:46:39,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 170 [2023-11-30 09:46:39,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:47:09,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3566], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4778#(<= ~n~0 2147483647), 3599#true, 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 1158#true, 10971#(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))), 38#L61true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 863#true, 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:47:09,045 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-30 09:47:09,045 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:47:09,045 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:47:09,046 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:47:09,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 90#L77true, 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 5736#true, 176#true]) [2023-11-30 09:47:09,053 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-30 09:47:09,053 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:47:09,053 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:47:09,053 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:47:11,301 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 153#L70-2true, 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 176#true, 5736#true]) [2023-11-30 09:47:11,302 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:47:11,302 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:11,302 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:11,302 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:11,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 6418#true, 5736#true]) [2023-11-30 09:47:11,307 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:47:11,307 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:11,307 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:11,307 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:12,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3566], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3599#true, 4778#(<= ~n~0 2147483647), 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 1158#true, 38#L61true, 10971#(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))), 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 863#true, 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:47:12,060 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:47:12,060 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:12,060 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:12,060 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:47:12,070 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 90#L77true, 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 6418#true, 176#true]) [2023-11-30 09:47:12,070 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 09:47:12,070 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:12,070 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:12,070 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:12,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3358], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 119#L57true, 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:47:12,350 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 09:47:12,350 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:12,350 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:12,350 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:47:14,071 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 153#L70-2true, 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 5736#true, 176#true]) [2023-11-30 09:47:14,071 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:47:14,072 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,072 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,072 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3568], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 6418#true, 5736#true]) [2023-11-30 09:47:14,076 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:47:14,076 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,076 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,076 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:47:14,887 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3358], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 119#L57true, 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:47:14,888 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 09:47:14,888 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:47:14,888 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:47:14,888 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:47:23,330 INFO L124 PetriNetUnfolderBase]: 13270/40477 cut-off events. [2023-11-30 09:47:23,330 INFO L125 PetriNetUnfolderBase]: For 3503063/3738771 co-relation queries the response was YES. [2023-11-30 09:47:23,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517048 conditions, 40477 events. 13270/40477 cut-off events. For 3503063/3738771 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 522226 event pairs, 187 based on Foata normal form. 4039/40439 useless extension candidates. Maximal degree in co-relation 266082. Up to 23869 conditions per place. [2023-11-30 09:47:24,046 INFO L140 encePairwiseOnDemand]: 142/170 looper letters, 3190 selfloop transitions, 1440 changer transitions 765/5507 dead transitions. [2023-11-30 09:47:24,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 904 places, 5507 transitions, 255492 flow [2023-11-30 09:47:24,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-30 09:47:24,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2023-11-30 09:47:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 9690 transitions. [2023-11-30 09:47:24,054 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.59375 [2023-11-30 09:47:24,055 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 9690 transitions. [2023-11-30 09:47:24,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 9690 transitions. [2023-11-30 09:47:24,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:47:24,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 9690 transitions. [2023-11-30 09:47:24,063 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 100.9375) internal successors, (9690), 96 states have internal predecessors, (9690), 0 states have call successors, (0), 0 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:47:24,073 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 170.0) internal successors, (16490), 97 states have internal predecessors, (16490), 0 states have call successors, (0), 0 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:47:24,074 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 170.0) internal successors, (16490), 97 states have internal predecessors, (16490), 0 states have call successors, (0), 0 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:47:24,075 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 761 predicate places. [2023-11-30 09:47:24,075 INFO L500 AbstractCegarLoop]: Abstraction has has 904 places, 5507 transitions, 255492 flow [2023-11-30 09:47:24,075 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 98.11111111111111) internal successors, (3532), 36 states have internal predecessors, (3532), 0 states have call successors, (0), 0 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:47:24,075 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:47:24,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:47:24,084 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 09:47:24,280 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 09:47:24,281 INFO L425 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:47:24,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:47:24,281 INFO L85 PathProgramCache]: Analyzing trace with hash -316292574, now seen corresponding path program 4 times [2023-11-30 09:47:24,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:47:24,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452046287] [2023-11-30 09:47:24,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:47:24,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:47:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:47:25,241 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:47:25,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:47:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452046287] [2023-11-30 09:47:25,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452046287] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:47:25,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717135054] [2023-11-30 09:47:25,242 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-30 09:47:25,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:47:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:47:25,244 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 09:47:25,252 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 09:47:25,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-30 09:47:25,506 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:47:25,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-30 09:47:25,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:47:26,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:47:26,397 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:47:26,765 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:47:26,765 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:47:27,249 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:47:27,249 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 96 treesize of output 98 [2023-11-30 09:47:27,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:47:27,263 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 48 treesize of output 46 [2023-11-30 09:47:28,977 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:47:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717135054] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:47:28,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:47:28,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2023-11-30 09:47:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042007615] [2023-11-30 09:47:28,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:47:28,978 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-30 09:47:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:47:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-30 09:47:28,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=4321, Unknown=1, NotChecked=0, Total=4692 [2023-11-30 09:47:28,982 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 170 [2023-11-30 09:47:28,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 904 places, 5507 transitions, 255492 flow. Second operand has 69 states, 69 states have (on average 88.44927536231884) internal successors, (6103), 69 states have internal predecessors, (6103), 0 states have call successors, (0), 0 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:47:28,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:47:28,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 170 [2023-11-30 09:47:28,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:47:34,192 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:48:37,345 INFO L124 PetriNetUnfolderBase]: 14752/44711 cut-off events. [2023-11-30 09:48:37,345 INFO L125 PetriNetUnfolderBase]: For 4257978/4542301 co-relation queries the response was YES. [2023-11-30 09:48:37,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 595468 conditions, 44711 events. 14752/44711 cut-off events. For 4257978/4542301 co-relation queries the response was YES. Maximal size of possible extension queue 1729. Compared 588533 event pairs, 222 based on Foata normal form. 4545/44828 useless extension candidates. Maximal degree in co-relation 316353. Up to 26537 conditions per place. [2023-11-30 09:48:38,356 INFO L140 encePairwiseOnDemand]: 138/170 looper letters, 3580 selfloop transitions, 1547 changer transitions 846/6079 dead transitions. [2023-11-30 09:48:38,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 999 places, 6079 transitions, 294392 flow [2023-11-30 09:48:38,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2023-11-30 09:48:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2023-11-30 09:48:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 8678 transitions. [2023-11-30 09:48:38,361 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5317401960784314 [2023-11-30 09:48:38,362 INFO L72 ComplementDD]: Start complementDD. Operand 96 states and 8678 transitions. [2023-11-30 09:48:38,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 8678 transitions. [2023-11-30 09:48:38,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:48:38,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 96 states and 8678 transitions. [2023-11-30 09:48:38,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 97 states, 96 states have (on average 90.39583333333333) internal successors, (8678), 96 states have internal predecessors, (8678), 0 states have call successors, (0), 0 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:48:38,378 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 97 states, 97 states have (on average 170.0) internal successors, (16490), 97 states have internal predecessors, (16490), 0 states have call successors, (0), 0 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:48:38,380 INFO L81 ComplementDD]: Finished complementDD. Result has 97 states, 97 states have (on average 170.0) internal successors, (16490), 97 states have internal predecessors, (16490), 0 states have call successors, (0), 0 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:48:38,380 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 856 predicate places. [2023-11-30 09:48:38,380 INFO L500 AbstractCegarLoop]: Abstraction has has 999 places, 6079 transitions, 294392 flow [2023-11-30 09:48:38,381 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 88.44927536231884) internal successors, (6103), 69 states have internal predecessors, (6103), 0 states have call successors, (0), 0 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:48:38,381 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:48:38,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:48:38,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2023-11-30 09:48:38,587 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 09:48:38,587 INFO L425 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:48:38,587 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:48:38,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1749077712, now seen corresponding path program 5 times [2023-11-30 09:48:38,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:48:38,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019384155] [2023-11-30 09:48:38,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:48:38,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:48:38,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:48:39,749 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:48:39,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:48:39,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019384155] [2023-11-30 09:48:39,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019384155] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:48:39,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867565211] [2023-11-30 09:48:39,750 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-30 09:48:39,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:48:39,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:48:39,751 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 09:48:39,753 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 09:48:39,856 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2023-11-30 09:48:39,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:48:39,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-30 09:48:39,859 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:48:40,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:48:40,213 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 09:48:40,473 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:48:40,473 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:48:40,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:48:40,855 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 96 treesize of output 98 [2023-11-30 09:48:40,870 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:48:40,870 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 48 treesize of output 46 [2023-11-30 09:48:41,434 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:48:41,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867565211] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:48:41,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:48:41,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 15, 15] total 52 [2023-11-30 09:48:41,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159950571] [2023-11-30 09:48:41,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:48:41,435 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-30 09:48:41,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:48:41,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-30 09:48:41,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2593, Unknown=13, NotChecked=0, Total=2756 [2023-11-30 09:48:41,439 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 170 [2023-11-30 09:48:41,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 6079 transitions, 294392 flow. Second operand has 53 states, 53 states have (on average 88.9245283018868) internal successors, (4713), 53 states have internal predecessors, (4713), 0 states have call successors, (0), 0 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:48:41,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:48:41,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 170 [2023-11-30 09:48:41,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:48:45,512 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 09:48:51,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-30 09:48:58,917 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 09:49:07,404 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:49:10,463 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 09:49:12,561 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:49:31,400 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:49:37,488 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 09:49:49,943 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3694], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 119#L57true, 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:49:49,944 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true, 6418#true]) [2023-11-30 09:49:49,944 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 90#L77true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true, 6418#true]) [2023-11-30 09:49:49,944 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:49:49,944 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 153#L70-2true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 6418#true, 176#true]) [2023-11-30 09:49:49,945 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:49,945 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3928], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4778#(<= ~n~0 2147483647), 3599#true, 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 23#L76-1true, 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 1158#true, 38#L61true, 10971#(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))), 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 863#true, 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:49:49,946 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-30 09:49:49,946 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:49:49,946 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:49:49,946 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:49:55,663 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3694], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 119#L57true, 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:49:55,664 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 153#L70-2true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true, 6418#true]) [2023-11-30 09:49:55,664 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,664 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true, 6418#true]) [2023-11-30 09:49:55,665 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3927], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 90#L77true, 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 176#true, 5736#true]) [2023-11-30 09:49:55,665 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:55,665 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:49:55,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][3928], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4778#(<= ~n~0 2147483647), 3599#true, 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 21#L101-1true, 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 1158#true, 38#L61true, 10971#(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))), 863#true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:49:55,666 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:49:55,666 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:55,666 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:49:55,666 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:50:08,181 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:50:14,828 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:50:29,824 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 09:50:32,292 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 09:50:36,458 INFO L124 PetriNetUnfolderBase]: 16945/51427 cut-off events. [2023-11-30 09:50:36,458 INFO L125 PetriNetUnfolderBase]: For 5603254/5960483 co-relation queries the response was YES. [2023-11-30 09:50:36,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721511 conditions, 51427 events. 16945/51427 cut-off events. For 5603254/5960483 co-relation queries the response was YES. Maximal size of possible extension queue 1615. Compared 669130 event pairs, 313 based on Foata normal form. 7327/53446 useless extension candidates. Maximal degree in co-relation 356626. Up to 30147 conditions per place. [2023-11-30 09:50:37,484 INFO L140 encePairwiseOnDemand]: 141/170 looper letters, 4088 selfloop transitions, 2612 changer transitions 1054/7860 dead transitions. [2023-11-30 09:50:37,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1132 places, 7860 transitions, 392586 flow [2023-11-30 09:50:37,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2023-11-30 09:50:37,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2023-11-30 09:50:37,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 14623 transitions. [2023-11-30 09:50:37,491 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.5409914909359971 [2023-11-30 09:50:37,491 INFO L72 ComplementDD]: Start complementDD. Operand 159 states and 14623 transitions. [2023-11-30 09:50:37,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 159 states and 14623 transitions. [2023-11-30 09:50:37,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:50:37,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 159 states and 14623 transitions. [2023-11-30 09:50:37,505 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 160 states, 159 states have (on average 91.96855345911949) internal successors, (14623), 159 states have internal predecessors, (14623), 0 states have call successors, (0), 0 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:50:37,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 160 states, 160 states have (on average 170.0) internal successors, (27200), 160 states have internal predecessors, (27200), 0 states have call successors, (0), 0 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:50:37,527 INFO L81 ComplementDD]: Finished complementDD. Result has 160 states, 160 states have (on average 170.0) internal successors, (27200), 160 states have internal predecessors, (27200), 0 states have call successors, (0), 0 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:50:37,528 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 989 predicate places. [2023-11-30 09:50:37,528 INFO L500 AbstractCegarLoop]: Abstraction has has 1132 places, 7860 transitions, 392586 flow [2023-11-30 09:50:37,528 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 88.9245283018868) internal successors, (4713), 53 states have internal predecessors, (4713), 0 states have call successors, (0), 0 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:50:37,528 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:50:37,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:50:37,533 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 09:50:37,729 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 09:50:37,729 INFO L425 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:50:37,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:50:37,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1506041706, now seen corresponding path program 6 times [2023-11-30 09:50:37,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:50:37,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311549454] [2023-11-30 09:50:37,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:50:37,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:50:37,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:50:38,855 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:50:38,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:50:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311549454] [2023-11-30 09:50:38,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311549454] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:50:38,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240165706] [2023-11-30 09:50:38,856 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-30 09:50:38,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:50:38,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:50:38,863 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 09:50:38,864 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 09:50:38,975 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-11-30 09:50:38,976 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:50:38,977 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-30 09:50:38,979 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:50:39,497 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:50:39,835 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:50:39,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:50:39,992 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:50:40,567 INFO L349 Elim1Store]: treesize reduction 34, result has 17.1 percent of original size [2023-11-30 09:50:40,568 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 39 treesize of output 19 [2023-11-30 09:50:40,616 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:50:40,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:50:42,862 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:50:42,862 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 116 treesize of output 80 [2023-11-30 09:50:42,898 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:50:42,898 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 408 treesize of output 386 [2023-11-30 09:50:42,914 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-30 09:50:42,930 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:50:42,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 138 [2023-11-30 09:50:42,955 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:50:42,955 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 109 treesize of output 89 [2023-11-30 09:50:45,276 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:50:45,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240165706] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:50:45,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:50:45,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 72 [2023-11-30 09:50:45,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222365941] [2023-11-30 09:50:45,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:50:45,277 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2023-11-30 09:50:45,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:50:45,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2023-11-30 09:50:45,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4815, Unknown=4, NotChecked=0, Total=5256 [2023-11-30 09:50:45,280 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 170 [2023-11-30 09:50:45,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1132 places, 7860 transitions, 392586 flow. Second operand has 73 states, 73 states have (on average 87.32876712328768) internal successors, (6375), 73 states have internal predecessors, (6375), 0 states have call successors, (0), 0 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:50:45,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:50:45,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 170 [2023-11-30 09:50:45,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:52:53,012 INFO L124 PetriNetUnfolderBase]: 17457/52971 cut-off events. [2023-11-30 09:52:53,013 INFO L125 PetriNetUnfolderBase]: For 5984834/6308417 co-relation queries the response was YES. [2023-11-30 09:52:53,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770399 conditions, 52971 events. 17457/52971 cut-off events. For 5984834/6308417 co-relation queries the response was YES. Maximal size of possible extension queue 1745. Compared 695845 event pairs, 331 based on Foata normal form. 6158/53661 useless extension candidates. Maximal degree in co-relation 366317. Up to 30823 conditions per place. [2023-11-30 09:52:54,137 INFO L140 encePairwiseOnDemand]: 134/170 looper letters, 5302 selfloop transitions, 1532 changer transitions 1064/8004 dead transitions. [2023-11-30 09:52:54,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1201 places, 8004 transitions, 415009 flow [2023-11-30 09:52:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-11-30 09:52:54,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2023-11-30 09:52:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 6196 transitions. [2023-11-30 09:52:54,140 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.520672268907563 [2023-11-30 09:52:54,140 INFO L72 ComplementDD]: Start complementDD. Operand 70 states and 6196 transitions. [2023-11-30 09:52:54,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 6196 transitions. [2023-11-30 09:52:54,141 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:52:54,141 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 70 states and 6196 transitions. [2023-11-30 09:52:54,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 71 states, 70 states have (on average 88.51428571428572) internal successors, (6196), 70 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 09:52:54,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 71 states, 71 states have (on average 170.0) internal successors, (12070), 71 states have internal predecessors, (12070), 0 states have call successors, (0), 0 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:52:54,154 INFO L81 ComplementDD]: Finished complementDD. Result has 71 states, 71 states have (on average 170.0) internal successors, (12070), 71 states have internal predecessors, (12070), 0 states have call successors, (0), 0 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:52:54,155 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 1058 predicate places. [2023-11-30 09:52:54,155 INFO L500 AbstractCegarLoop]: Abstraction has has 1201 places, 8004 transitions, 415009 flow [2023-11-30 09:52:54,156 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 87.32876712328768) internal successors, (6375), 73 states have internal predecessors, (6375), 0 states have call successors, (0), 0 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:52:54,156 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:52:54,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:52:54,166 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 09:52:54,361 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 09:52:54,362 INFO L425 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:52:54,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:52:54,362 INFO L85 PathProgramCache]: Analyzing trace with hash -158174256, now seen corresponding path program 7 times [2023-11-30 09:52:54,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:52:54,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57471649] [2023-11-30 09:52:54,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:52:54,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:52:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:52:55,432 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:52:55,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:52:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57471649] [2023-11-30 09:52:55,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57471649] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:52:55,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590624453] [2023-11-30 09:52:55,432 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-11-30 09:52:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:52:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:52:55,433 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 09:52:55,435 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 09:52:55,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:52:55,540 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-30 09:52:55,542 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:52:56,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-30 09:52:56,452 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 29 treesize of output 22 [2023-11-30 09:52:56,718 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:52:56,719 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:52:57,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:52:57,133 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 75 treesize of output 77 [2023-11-30 09:52:57,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:52:57,139 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 18 treesize of output 5 [2023-11-30 09:52:58,583 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:52:58,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590624453] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:52:58,583 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:52:58,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 68 [2023-11-30 09:52:58,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516314191] [2023-11-30 09:52:58,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:52:58,584 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2023-11-30 09:52:58,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:52:58,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2023-11-30 09:52:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=4334, Unknown=0, NotChecked=0, Total=4692 [2023-11-30 09:52:58,588 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 170 [2023-11-30 09:52:58,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1201 places, 8004 transitions, 415009 flow. Second operand has 69 states, 69 states have (on average 88.44927536231884) internal successors, (6103), 69 states have internal predecessors, (6103), 0 states have call successors, (0), 0 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:52:58,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:52:58,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 170 [2023-11-30 09:52:58,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:54:12,067 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4084], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3599#true, 4778#(<= ~n~0 2147483647), 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16893#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 17855#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1158#true, 38#L61true, 10971#(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))), 863#true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:54:12,068 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-30 09:54:12,068 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 09:54:12,068 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:54:12,068 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:54:15,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 90#L77true, 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 6418#true, 5736#true]) [2023-11-30 09:54:15,299 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-30 09:54:15,299 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:54:15,299 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:54:15,299 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 09:54:20,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4084], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3599#true, 4778#(<= ~n~0 2147483647), 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 21#L101-1true, 16893#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 17855#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1158#true, 10971#(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))), 38#L61true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 863#true, 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:54:20,150 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:54:20,150 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:54:20,151 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:20,151 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:21,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 153#L70-2true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true, 6418#true]) [2023-11-30 09:54:21,307 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:54:21,307 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:21,307 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:54:21,307 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:21,316 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true, 6418#true]) [2023-11-30 09:54:21,316 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:54:21,316 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:21,316 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:54:21,316 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:54:23,041 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 90#L77true, 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 6418#true, 176#true]) [2023-11-30 09:54:23,042 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:54:23,042 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:54:23,042 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:54:23,042 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 09:54:24,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3832], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 119#L57true, 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:54:24,914 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:54:24,914 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:54:24,914 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:54:24,914 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 09:54:30,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 153#L70-2true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 176#true, 5736#true]) [2023-11-30 09:54:30,668 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-30 09:54:30,668 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:54:30,668 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 09:54:30,668 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:54:30,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4100], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true, 6418#true]) [2023-11-30 09:54:30,676 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2023-11-30 09:54:30,676 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2023-11-30 09:54:30,676 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:54:30,676 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2023-11-30 09:54:33,043 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3832], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 119#L57true, 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7565#true, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:54:33,043 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2023-11-30 09:54:33,043 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:54:33,043 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2023-11-30 09:54:33,043 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2023-11-30 09:55:01,099 INFO L124 PetriNetUnfolderBase]: 17653/53615 cut-off events. [2023-11-30 09:55:01,099 INFO L125 PetriNetUnfolderBase]: For 6450231/6795188 co-relation queries the response was YES. [2023-11-30 09:55:01,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 805840 conditions, 53615 events. 17653/53615 cut-off events. For 6450231/6795188 co-relation queries the response was YES. Maximal size of possible extension queue 1776. Compared 707676 event pairs, 364 based on Foata normal form. 5636/53706 useless extension candidates. Maximal degree in co-relation 384916. Up to 31120 conditions per place. [2023-11-30 09:55:02,437 INFO L140 encePairwiseOnDemand]: 138/170 looper letters, 5301 selfloop transitions, 1635 changer transitions 1076/8118 dead transitions. [2023-11-30 09:55:02,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1286 places, 8118 transitions, 436472 flow [2023-11-30 09:55:02,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2023-11-30 09:55:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2023-11-30 09:55:02,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 7755 transitions. [2023-11-30 09:55:02,441 INFO L542 CegarLoopForPetriNet]: DFA transition density 0.530437756497948 [2023-11-30 09:55:02,441 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 7755 transitions. [2023-11-30 09:55:02,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 7755 transitions. [2023-11-30 09:55:02,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-30 09:55:02,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 7755 transitions. [2023-11-30 09:55:02,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 90.17441860465117) internal successors, (7755), 86 states have internal predecessors, (7755), 0 states have call successors, (0), 0 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:55:02,457 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 170.0) internal successors, (14790), 87 states have internal predecessors, (14790), 0 states have call successors, (0), 0 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:55:02,458 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 170.0) internal successors, (14790), 87 states have internal predecessors, (14790), 0 states have call successors, (0), 0 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:55:02,459 INFO L307 CegarLoopForPetriNet]: 143 programPoint places, 1143 predicate places. [2023-11-30 09:55:02,459 INFO L500 AbstractCegarLoop]: Abstraction has has 1286 places, 8118 transitions, 436472 flow [2023-11-30 09:55:02,460 INFO L501 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 88.44927536231884) internal successors, (6103), 69 states have internal predecessors, (6103), 0 states have call successors, (0), 0 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:55:02,460 INFO L224 CegarLoopForPetriNet]: Found error trace [2023-11-30 09:55:02,460 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:55:02,466 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 09:55:02,665 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 09:55:02,666 INFO L425 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-11-30 09:55:02,666 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-30 09:55:02,666 INFO L85 PathProgramCache]: Analyzing trace with hash 659887178, now seen corresponding path program 8 times [2023-11-30 09:55:02,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-30 09:55:02,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946069207] [2023-11-30 09:55:02,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-30 09:55:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-30 09:55:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-30 09:55:03,366 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:55:03,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-30 09:55:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946069207] [2023-11-30 09:55:03,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946069207] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-30 09:55:03,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816150596] [2023-11-30 09:55:03,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-30 09:55:03,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:55:03,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-30 09:55:03,368 INFO L229 MonitoredProcess]: Starting monitored process 29 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:55:03,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2023-11-30 09:55:03,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-30 09:55:03,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-30 09:55:03,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-30 09:55:03,489 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-30 09:55:04,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 23 treesize of output 1 [2023-11-30 09:55:04,312 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:55:04,365 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:55:04,799 INFO L349 Elim1Store]: treesize reduction 38, result has 15.6 percent of original size [2023-11-30 09:55:04,802 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 46 treesize of output 19 [2023-11-30 09:55:04,831 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-30 09:55:04,831 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-30 09:55:06,818 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-30 09:55:06,818 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 119 treesize of output 83 [2023-11-30 09:55:06,852 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:55:06,852 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 250 treesize of output 253 [2023-11-30 09:55:06,893 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:55:06,893 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 217 treesize of output 203 [2023-11-30 09:55:06,941 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-30 09:55:06,942 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 142 treesize of output 153 [2023-11-30 09:55:09,037 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:55:09,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816150596] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-30 09:55:09,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-30 09:55:09,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 25, 22] total 67 [2023-11-30 09:55:09,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42682607] [2023-11-30 09:55:09,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-30 09:55:09,038 INFO L576 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-30 09:55:09,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-30 09:55:09,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-30 09:55:09,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=4000, Unknown=22, NotChecked=0, Total=4556 [2023-11-30 09:55:09,042 INFO L497 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 170 [2023-11-30 09:55:09,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1286 places, 8118 transitions, 436472 flow. Second operand has 68 states, 68 states have (on average 90.41176470588235) internal successors, (6148), 68 states have internal predecessors, (6148), 0 states have call successors, (0), 0 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:55:09,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-30 09:55:09,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 170 [2023-11-30 09:55:09,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-30 09:56:24,908 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4170], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 18804#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3599#true, 4778#(<= ~n~0 2147483647), 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 16893#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 23#L76-1true, 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 17855#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1158#true, 10971#(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))), 38#L61true, 863#true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:56:24,908 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2023-11-30 09:56:24,908 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2023-11-30 09:56:24,908 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:56:24,909 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2023-11-30 09:56:29,076 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4169], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 90#L77true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 18017#(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)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true, 6418#true]) [2023-11-30 09:56:29,076 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2023-11-30 09:56:29,077 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:56:29,077 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2023-11-30 09:56:29,077 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2023-11-30 09:56:35,197 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4170], [2532#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 6779#(<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648)), 18804#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 12858#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 4778#(<= ~n~0 2147483647), 3599#true, 3243#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 15787#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 13757#(and (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 14793#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 21#L101-1true, 16893#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 23#L76-1true, 9998#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= 0 (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1| 2147483648))), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 17855#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 1158#true, 10971#(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))), 38#L61true, 4676#(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) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 863#true, 11898#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0))) (<= (+ ~s~0 |thread2Thread1of1ForFork1_~j~0#1|) 2147483647)), 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 5736#true]) [2023-11-30 09:56:35,198 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:56:35,198 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:35,198 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:56:35,198 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:36,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4169], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 3599#true, 4778#(<= ~n~0 2147483647), 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 153#L70-2true, 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 18017#(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)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 6418#true, 176#true, 5736#true]) [2023-11-30 09:56:36,694 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:56:36,694 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:36,695 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:36,695 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:56:36,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4169], [11934#(<= ~q_front~0 ~q_back~0), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 4042#(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)), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 39#L70-3true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 18017#(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)), 1158#true, 38#L61true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true, 6418#true]) [2023-11-30 09:56:36,706 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2023-11-30 09:56:36,706 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:36,706 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2023-11-30 09:56:36,706 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2023-11-30 09:56:38,830 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([545] L57-->L61: Formula: (and (not (= (ite (= (select (select |v_#memory_int_70| v_~q~0.base_62) (+ v_~q~0.offset_62 (* v_~q_back~0_93 4))) 0) 1 0) 0)) (not (= (ite (and (< v_~q_back~0_93 v_~n~0_47) (<= 0 v_~q_back~0_93)) 1 0) 0)) (= (+ v_~q_back~0_93 1) v_~q_back~0_92) (<= 0 (+ 2147483649 v_~q_back~0_93)) (<= v_~q_back~0_93 2147483646)) InVars {#memory_int=|v_#memory_int_70|, ~q_back~0=v_~q_back~0_93, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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_70|, ~q~0.base=v_~q~0.base_62, ~n~0=v_~n~0_47, ~q~0.offset=v_~q~0.offset_62} 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][4169], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 90#L77true, 21#L101-1true, 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 5353#true, thread2Thread1of1ForFork1InUse, 7565#true, thread1Thread1of1ForFork0InUse, 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 18017#(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)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 38#L61true, 863#true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 176#true, 6418#true, 5736#true]) [2023-11-30 09:56:38,830 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:56:38,830 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 09:56:38,830 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:56:38,830 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:56:40,104 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([564] L71-->L75: Formula: (and (= (+ v_~q_front~0_35 1) v_~q_front~0_34) (= (select (select |v_#memory_int_58| v_~q~0.base_50) (+ (* v_~q_front~0_35 4) v_~q~0.offset_50)) |v_thread2Thread1of1ForFork1_~j~0#1_7|) (<= v_~q_front~0_34 2147483647) (not (= (ite (and (< v_~q_front~0_35 v_~n~0_35) (< v_~q_front~0_35 v_~q_back~0_74) (<= 0 v_~q_front~0_35)) 1 0) 0)) (<= 0 (+ v_~q_front~0_34 2147483648))) InVars {~q_back~0=v_~q_back~0_74, #memory_int=|v_#memory_int_58|, ~q~0.base=v_~q~0.base_50, ~n~0=v_~n~0_35, ~q~0.offset=v_~q~0.offset_50, ~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_58|, 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_50, ~n~0=v_~n~0_35, thread2Thread1of1ForFork1_#t~post7#1=|v_thread2Thread1of1ForFork1_#t~post7#1_5|, ~q~0.offset=v_~q~0.offset_50, ~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][3901], [11934#(<= ~q_front~0 ~q_back~0), 4042#(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)), 11866#(and (<= ~q_front~0 ~q_back~0) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 5360#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1151#true, 6070#true, 4778#(<= ~n~0 2147483647), 3599#true, 2454#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 119#L57true, 9944#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 10205#(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)), 3235#(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) (or (= ~q_front~0 0) (not (= ~q_back~0 0)))), 15773#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 8323#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 976#(<= ~n~0 2147483647), 3325#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 1162#true, 8#L100-4true, 5353#true, thread2Thread1of1ForFork1InUse, thread1Thread1of1ForFork0InUse, 6420#(and (or (< 0 ~q_front~0) (= ~q_front~0 ~q_back~0)) (<= ~q_front~0 ~q_back~0)), 7565#true, 16863#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t1~0#1.base|) (<= ~q_front~0 ~q_back~0)), 14783#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 17825#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#t2~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1) (<= ~q_front~0 ~q_back~0)), 18017#(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)), 1158#true, 12878#(<= ~q_front~0 ~q_back~0), 863#true, 141#L75true, 404#true, 169#true, 7186#(= (select |#valid| |ULTIMATE.start_main_~#t2~0#1.base|) 1), 8630#true, 5736#true, 176#true]) [2023-11-30 09:56:40,104 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2023-11-30 09:56:40,105 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2023-11-30 09:56:40,105 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2023-11-30 09:56:40,105 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event Received shutdown request... [2023-11-30 09:56:45,363 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-11-30 09:56:45,363 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 09:56:45,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-30 09:56:45,603 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 24 remaining) [2023-11-30 09:56:45,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2023-11-30 09:56:45,803 WARN L482 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-30 09:56:45,804 WARN L624 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). [2023-11-30 09:56:45,805 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 24 remaining) [2023-11-30 09:56:45,806 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 24 remaining) [2023-11-30 09:56:45,807 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 24 remaining) [2023-11-30 09:56:45,808 INFO L810 garLoopResultBuilder]: Registering result TIMEOUT for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 24 remaining) [2023-11-30 09:56:45,808 INFO L457 BasicCegarLoop]: Path program histogram: [8, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-30 09:56:45,811 INFO L222 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-30 09:56:45,811 INFO L172 ceAbstractionStarter]: Computing trace abstraction results [2023-11-30 09:56:45,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 09:56:45 BasicIcfg [2023-11-30 09:56:45,814 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-30 09:56:45,815 INFO L158 Benchmark]: Toolchain (without parser) took 771004.55ms. Allocated memory was 614.5MB in the beginning and 7.9GB in the end (delta: 7.3GB). Free memory was 558.2MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-30 09:56:45,815 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory is still 316.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-11-30 09:56:45,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.36ms. Allocated memory is still 614.5MB. Free memory was 557.9MB in the beginning and 546.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-11-30 09:56:45,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.05ms. Allocated memory is still 614.5MB. Free memory was 546.2MB in the beginning and 543.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 09:56:45,815 INFO L158 Benchmark]: Boogie Preprocessor took 31.01ms. Allocated memory is still 614.5MB. Free memory was 543.9MB in the beginning and 542.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-11-30 09:56:45,815 INFO L158 Benchmark]: RCFGBuilder took 567.98ms. Allocated memory is still 614.5MB. Free memory was 542.2MB in the beginning and 511.8MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-11-30 09:56:45,816 INFO L158 Benchmark]: TraceAbstraction took 770150.73ms. Allocated memory was 614.5MB in the beginning and 7.9GB in the end (delta: 7.3GB). Free memory was 511.1MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. [2023-11-30 09:56:45,817 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 371.2MB. Free memory is still 316.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 204.36ms. Allocated memory is still 614.5MB. Free memory was 557.9MB in the beginning and 546.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 41.05ms. Allocated memory is still 614.5MB. Free memory was 546.2MB in the beginning and 543.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.01ms. Allocated memory is still 614.5MB. Free memory was 543.9MB in the beginning and 542.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 567.98ms. Allocated memory is still 614.5MB. Free memory was 542.2MB in the beginning and 511.8MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 770150.73ms. Allocated memory was 614.5MB in the beginning and 7.9GB in the end (delta: 7.3GB). Free memory was 511.1MB in the beginning and 4.6GB in the end (delta: -4.1GB). Peak memory consumption was 4.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 53]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 60]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 49]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 74]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 76]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 115]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - TimeoutResultAtElement [Line: 99]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (68states, 88/170 universal loopers) in iteration 33,while PetriNetUnfolder was constructing finite prefix that currently has 614461 conditions, 38075 events (12621/38074 cut-off events. For 5236349/5514747 co-relation queries the response was YES. Maximal size of possible extension queue 1862. Compared 526868 event pairs, 365 based on Foata normal form. 4807/40625 useless extension candidates. Maximal degree in co-relation 314630. Up to 21012 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 201 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: 770.0s, OverallIterations: 33, TraceHistogramMax: 5, PathProgramHistogramMax: 8, EmptinessCheckTime: 0.0s, AutomataDifference: 692.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 125 mSolverCounterUnknown, 16082 SdHoareTripleChecker+Valid, 54.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 16082 mSDsluCounter, 13656 SdHoareTripleChecker+Invalid, 50.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12793 mSDsCounter, 2324 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45005 IncrementalHoareTripleChecker+Invalid, 47454 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2324 mSolverCounterUnsat, 863 mSDtfsCounter, 45005 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6734 GetRequests, 4514 SyntacticMatches, 7 SemanticMatches, 2213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75509 ImplicationChecksByTransitivity, 97.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=436472occurred in iteration=32, InterpolantAutomatonStates: 1224, 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.4s SatisfiabilityAnalysisTime, 67.5s InterpolantComputationTime, 6566 NumberOfCodeBlocks, 6386 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 8528 ConstructedInterpolants, 358 QuantifiedInterpolants, 109431 SizeOfPredicates, 381 NumberOfNonLiveVariables, 6633 ConjunctsInSsa, 629 ConjunctsInUnsatCore, 79 InterpolantComputations, 15 PerfectInterpolantSequences, 355/1173 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