/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.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.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:24:39,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:24:39,338 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 [2025-03-15 01:24:39,355 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:24:39,356 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:24:39,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:24:39,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:24:39,357 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:24:39,357 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:24:39,358 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:39,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:24:39,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All 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 -> ASSERTandASSUME [2025-03-15 01:24:39,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:24:39,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:24:39,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:24:39,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:24:39,607 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:24:39,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2025-03-15 01:24:40,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8c3bd52/d4bee8e4be184ac298ea8bc67ae8a38b/FLAG05419378c [2025-03-15 01:24:41,151 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:24:41,154 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2025-03-15 01:24:41,170 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8c3bd52/d4bee8e4be184ac298ea8bc67ae8a38b/FLAG05419378c [2025-03-15 01:24:41,451 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b8c3bd52/d4bee8e4be184ac298ea8bc67ae8a38b [2025-03-15 01:24:41,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:24:41,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:24:41,455 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:41,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:24:41,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:24:41,459 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:41,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed8fec1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41, skipping insertion in model container [2025-03-15 01:24:41,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:41,500 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:24:41,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:41,859 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:24:41,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:41,960 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:24:41,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41 WrapperNode [2025-03-15 01:24:41,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:41,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:41,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:24:41,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:24:41,966 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:41,978 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,000 INFO L138 Inliner]: procedures = 274, calls = 94, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 247 [2025-03-15 01:24:42,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:42,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:24:42,000 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:24:42,000 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:24:42,010 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,018 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,018 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,032 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,033 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,040 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,041 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:24:42,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:24:42,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:24:42,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:24:42,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (1/1) ... [2025-03-15 01:24:42,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:42,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:42,075 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) [2025-03-15 01:24:42,080 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 [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:24:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:24:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:24:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:24:42,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:24:42,096 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:24:42,204 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:24:42,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:24:42,510 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:24:42,511 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:24:42,532 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:24:42,533 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:24:42,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:42 BoogieIcfgContainer [2025-03-15 01:24:42,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:24:42,535 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:24:42,535 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:24:42,539 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:24:42,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:24:41" (1/3) ... [2025-03-15 01:24:42,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8c5065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:42, skipping insertion in model container [2025-03-15 01:24:42,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:41" (2/3) ... [2025-03-15 01:24:42,540 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8c5065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:42, skipping insertion in model container [2025-03-15 01:24:42,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:42" (3/3) ... [2025-03-15 01:24:42,542 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-03-15 01:24:42,556 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:24:42,558 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 277 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-15 01:24:42,558 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:24:42,668 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:24:42,726 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:42,737 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@375ea316, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:42,737 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-03-15 01:24:42,807 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:42,808 INFO L124 PetriNetUnfolderBase]: 5/177 cut-off events. [2025-03-15 01:24:42,809 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-15 01:24:42,809 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:42,810 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:42,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:42,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:42,816 INFO L85 PathProgramCache]: Analyzing trace with hash -872573243, now seen corresponding path program 1 times [2025-03-15 01:24:42,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:42,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054459992] [2025-03-15 01:24:42,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:42,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:42,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:44,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:44,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054459992] [2025-03-15 01:24:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054459992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:44,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:24:44,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227722729] [2025-03-15 01:24:44,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:44,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:24:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:44,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:24:44,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:24:44,407 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 289 [2025-03-15 01:24:44,415 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 289 transitions, 592 flow. Second operand has 12 states, 12 states have (on average 185.25) internal successors, (2223), 12 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:44,415 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:44,415 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 289 [2025-03-15 01:24:44,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,396 INFO L124 PetriNetUnfolderBase]: 390/2157 cut-off events. [2025-03-15 01:24:45,397 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-15 01:24:45,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2931 conditions, 2157 events. 390/2157 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15494 event pairs, 84 based on Foata normal form. 27/1911 useless extension candidates. Maximal degree in co-relation 2575. Up to 539 conditions per place. [2025-03-15 01:24:45,418 INFO L140 encePairwiseOnDemand]: 269/289 looper letters, 100 selfloop transitions, 16 changer transitions 6/289 dead transitions. [2025-03-15 01:24:45,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 289 transitions, 835 flow [2025-03-15 01:24:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:24:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:24:45,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2449 transitions. [2025-03-15 01:24:45,439 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6518498802235827 [2025-03-15 01:24:45,444 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, -1 predicate places. [2025-03-15 01:24:45,444 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 289 transitions, 835 flow [2025-03-15 01:24:45,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 185.25) internal successors, (2223), 12 states have internal predecessors, (2223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,445 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,445 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:45,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:24:45,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:45,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,447 INFO L85 PathProgramCache]: Analyzing trace with hash 738610208, now seen corresponding path program 1 times [2025-03-15 01:24:45,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121941724] [2025-03-15 01:24:45,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:46,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:46,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:46,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121941724] [2025-03-15 01:24:46,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121941724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:46,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:46,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:24:46,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009271707] [2025-03-15 01:24:46,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:46,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 01:24:46,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:46,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 01:24:46,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-03-15 01:24:46,215 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 289 [2025-03-15 01:24:46,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 289 transitions, 835 flow. Second operand has 13 states, 13 states have (on average 181.69230769230768) internal successors, (2362), 13 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:46,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:46,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 289 [2025-03-15 01:24:46,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:47,432 INFO L124 PetriNetUnfolderBase]: 865/3341 cut-off events. [2025-03-15 01:24:47,432 INFO L125 PetriNetUnfolderBase]: For 850/1002 co-relation queries the response was YES. [2025-03-15 01:24:47,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6238 conditions, 3341 events. 865/3341 cut-off events. For 850/1002 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 25789 event pairs, 89 based on Foata normal form. 14/2976 useless extension candidates. Maximal degree in co-relation 5714. Up to 1017 conditions per place. [2025-03-15 01:24:47,452 INFO L140 encePairwiseOnDemand]: 269/289 looper letters, 234 selfloop transitions, 26 changer transitions 6/427 dead transitions. [2025-03-15 01:24:47,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 427 transitions, 1914 flow [2025-03-15 01:24:47,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:24:47,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:24:47,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3610 transitions. [2025-03-15 01:24:47,462 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.657439446366782 [2025-03-15 01:24:47,463 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 17 predicate places. [2025-03-15 01:24:47,463 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 427 transitions, 1914 flow [2025-03-15 01:24:47,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 181.69230769230768) internal successors, (2362), 13 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,467 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:47,468 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:47,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:24:47,468 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:47,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:47,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1424128315, now seen corresponding path program 1 times [2025-03-15 01:24:47,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:47,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092356338] [2025-03-15 01:24:47,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:47,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:47,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:47,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092356338] [2025-03-15 01:24:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092356338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662322120] [2025-03-15 01:24:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:47,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:47,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:47,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:47,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 289 [2025-03-15 01:24:47,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 427 transitions, 1914 flow. Second operand has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:47,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 289 [2025-03-15 01:24:47,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:48,224 INFO L124 PetriNetUnfolderBase]: 1462/5701 cut-off events. [2025-03-15 01:24:48,225 INFO L125 PetriNetUnfolderBase]: For 2716/3230 co-relation queries the response was YES. [2025-03-15 01:24:48,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11085 conditions, 5701 events. 1462/5701 cut-off events. For 2716/3230 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 52706 event pairs, 211 based on Foata normal form. 50/5042 useless extension candidates. Maximal degree in co-relation 10421. Up to 1741 conditions per place. [2025-03-15 01:24:48,261 INFO L140 encePairwiseOnDemand]: 284/289 looper letters, 67 selfloop transitions, 4 changer transitions 7/449 dead transitions. [2025-03-15 01:24:48,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 449 transitions, 2189 flow [2025-03-15 01:24:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:48,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:48,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1091 transitions. [2025-03-15 01:24:48,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9437716262975778 [2025-03-15 01:24:48,264 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 20 predicate places. [2025-03-15 01:24:48,264 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 449 transitions, 2189 flow [2025-03-15 01:24:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 267.25) internal successors, (1069), 4 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,265 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,265 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:24:48,265 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:48,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1531046615, now seen corresponding path program 1 times [2025-03-15 01:24:48,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191279053] [2025-03-15 01:24:48,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:48,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:48,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:48,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191279053] [2025-03-15 01:24:48,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191279053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:48,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:48,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:24:48,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633735862] [2025-03-15 01:24:48,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:48,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:24:48,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:48,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:24:48,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:24:48,818 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 289 [2025-03-15 01:24:48,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 449 transitions, 2189 flow. Second operand has 12 states, 12 states have (on average 183.33333333333334) internal successors, (2200), 12 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:48,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 289 [2025-03-15 01:24:48,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:50,639 INFO L124 PetriNetUnfolderBase]: 1994/7072 cut-off events. [2025-03-15 01:24:50,640 INFO L125 PetriNetUnfolderBase]: For 7377/8412 co-relation queries the response was YES. [2025-03-15 01:24:50,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16951 conditions, 7072 events. 1994/7072 cut-off events. For 7377/8412 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 66444 event pairs, 264 based on Foata normal form. 104/6322 useless extension candidates. Maximal degree in co-relation 16019. Up to 2313 conditions per place. [2025-03-15 01:24:50,686 INFO L140 encePairwiseOnDemand]: 270/289 looper letters, 349 selfloop transitions, 30 changer transitions 7/562 dead transitions. [2025-03-15 01:24:50,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 562 transitions, 3656 flow [2025-03-15 01:24:50,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:24:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:24:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2724 transitions. [2025-03-15 01:24:50,695 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6732575383094415 [2025-03-15 01:24:50,696 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 33 predicate places. [2025-03-15 01:24:50,696 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 562 transitions, 3656 flow [2025-03-15 01:24:50,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 183.33333333333334) internal successors, (2200), 12 states have internal predecessors, (2200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,698 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:50,698 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:50,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:24:50,698 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:50,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1115063801, now seen corresponding path program 1 times [2025-03-15 01:24:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:50,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785131414] [2025-03-15 01:24:50,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:50,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:50,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785131414] [2025-03-15 01:24:50,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785131414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:50,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:50,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185484734] [2025-03-15 01:24:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:50,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:50,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:50,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:50,790 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2025-03-15 01:24:50,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 562 transitions, 3656 flow. Second operand has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:50,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2025-03-15 01:24:50,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:52,227 INFO L124 PetriNetUnfolderBase]: 3400/12276 cut-off events. [2025-03-15 01:24:52,227 INFO L125 PetriNetUnfolderBase]: For 15887/17041 co-relation queries the response was YES. [2025-03-15 01:24:52,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30633 conditions, 12276 events. 3400/12276 cut-off events. For 15887/17041 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 132077 event pairs, 632 based on Foata normal form. 56/10875 useless extension candidates. Maximal degree in co-relation 29639. Up to 3940 conditions per place. [2025-03-15 01:24:52,321 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 140 selfloop transitions, 4 changer transitions 7/610 dead transitions. [2025-03-15 01:24:52,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 610 transitions, 4404 flow [2025-03-15 01:24:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:52,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1349 transitions. [2025-03-15 01:24:52,329 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9335640138408304 [2025-03-15 01:24:52,329 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 37 predicate places. [2025-03-15 01:24:52,329 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 610 transitions, 4404 flow [2025-03-15 01:24:52,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:52,331 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:52,331 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:52,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:24:52,332 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:52,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:52,333 INFO L85 PathProgramCache]: Analyzing trace with hash -936670313, now seen corresponding path program 1 times [2025-03-15 01:24:52,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:52,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73336595] [2025-03-15 01:24:52,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:52,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:52,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:52,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73336595] [2025-03-15 01:24:52,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73336595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:52,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:52,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:52,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40918776] [2025-03-15 01:24:52,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:52,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:52,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:52,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:52,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:52,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2025-03-15 01:24:52,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 610 transitions, 4404 flow. Second operand has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:52,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:52,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2025-03-15 01:24:52,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:54,623 INFO L124 PetriNetUnfolderBase]: 4703/18496 cut-off events. [2025-03-15 01:24:54,624 INFO L125 PetriNetUnfolderBase]: For 31736/33649 co-relation queries the response was YES. [2025-03-15 01:24:54,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45100 conditions, 18496 events. 4703/18496 cut-off events. For 31736/33649 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 208255 event pairs, 1300 based on Foata normal form. 243/16476 useless extension candidates. Maximal degree in co-relation 43828. Up to 5913 conditions per place. [2025-03-15 01:24:54,747 INFO L140 encePairwiseOnDemand]: 282/289 looper letters, 143 selfloop transitions, 4 changer transitions 7/632 dead transitions. [2025-03-15 01:24:54,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 632 transitions, 4916 flow [2025-03-15 01:24:54,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:54,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1349 transitions. [2025-03-15 01:24:54,750 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9335640138408304 [2025-03-15 01:24:54,751 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 41 predicate places. [2025-03-15 01:24:54,751 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 632 transitions, 4916 flow [2025-03-15 01:24:54,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,751 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:54,751 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:24:54,752 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1814754600, now seen corresponding path program 1 times [2025-03-15 01:24:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193052555] [2025-03-15 01:24:54,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:54,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:54,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:54,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193052555] [2025-03-15 01:24:54,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193052555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:54,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:54,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:54,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458396267] [2025-03-15 01:24:54,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:54,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:24:54,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:54,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:24:54,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:24:54,853 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 289 [2025-03-15 01:24:54,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 632 transitions, 4916 flow. Second operand has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:54,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 289 [2025-03-15 01:24:54,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:55,208 INFO L124 PetriNetUnfolderBase]: 480/1918 cut-off events. [2025-03-15 01:24:55,212 INFO L125 PetriNetUnfolderBase]: For 12005/12164 co-relation queries the response was YES. [2025-03-15 01:24:55,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6828 conditions, 1918 events. 480/1918 cut-off events. For 12005/12164 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11634 event pairs, 79 based on Foata normal form. 0/1763 useless extension candidates. Maximal degree in co-relation 5448. Up to 683 conditions per place. [2025-03-15 01:24:55,231 INFO L140 encePairwiseOnDemand]: 285/289 looper letters, 87 selfloop transitions, 2 changer transitions 20/402 dead transitions. [2025-03-15 01:24:55,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 402 transitions, 3057 flow [2025-03-15 01:24:55,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:24:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:24:55,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2025-03-15 01:24:55,238 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9527104959630911 [2025-03-15 01:24:55,238 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 41 predicate places. [2025-03-15 01:24:55,239 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 402 transitions, 3057 flow [2025-03-15 01:24:55,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.0) internal successors, (810), 3 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:55,239 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:55,239 INFO L221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:55,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:24:55,244 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:55,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -781033572, now seen corresponding path program 1 times [2025-03-15 01:24:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:55,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365478919] [2025-03-15 01:24:55,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:55,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:56,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:56,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365478919] [2025-03-15 01:24:56,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365478919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:56,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:56,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-15 01:24:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674307876] [2025-03-15 01:24:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:56,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:24:56,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:56,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:24:56,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:24:56,130 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 289 [2025-03-15 01:24:56,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 402 transitions, 3057 flow. Second operand has 12 states, 12 states have (on average 187.16666666666666) internal successors, (2246), 12 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) [2025-03-15 01:24:56,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:56,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 289 [2025-03-15 01:24:56,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:57,001 INFO L124 PetriNetUnfolderBase]: 494/1924 cut-off events. [2025-03-15 01:24:57,001 INFO L125 PetriNetUnfolderBase]: For 16097/16270 co-relation queries the response was YES. [2025-03-15 01:24:57,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7794 conditions, 1924 events. 494/1924 cut-off events. For 16097/16270 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11693 event pairs, 79 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 6173. Up to 697 conditions per place. [2025-03-15 01:24:57,015 INFO L140 encePairwiseOnDemand]: 275/289 looper letters, 183 selfloop transitions, 13 changer transitions 20/406 dead transitions. [2025-03-15 01:24:57,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 406 transitions, 3520 flow [2025-03-15 01:24:57,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:24:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:24:57,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1934 transitions. [2025-03-15 01:24:57,020 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.669204152249135 [2025-03-15 01:24:57,022 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 50 predicate places. [2025-03-15 01:24:57,022 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 406 transitions, 3520 flow [2025-03-15 01:24:57,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 187.16666666666666) internal successors, (2246), 12 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) [2025-03-15 01:24:57,023 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:57,023 INFO L221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:57,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:24:57,023 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:24:57,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:57,025 INFO L85 PathProgramCache]: Analyzing trace with hash -607350140, now seen corresponding path program 1 times [2025-03-15 01:24:57,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:57,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922864967] [2025-03-15 01:24:57,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:57,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:58,342 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:58,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:58,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922864967] [2025-03-15 01:24:58,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922864967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:24:58,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417258017] [2025-03-15 01:24:58,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:58,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:24:58,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:58,346 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) [2025-03-15 01:24:58,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:24:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:58,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-15 01:24:58,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:24:58,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-15 01:24:58,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-15 01:24:59,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:59,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:24:59,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-03-15 01:24:59,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-15 01:24:59,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-15 01:25:00,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:25:00,045 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 23 treesize of output 16 [2025-03-15 01:25:00,269 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-15 01:25:00,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2025-03-15 01:25:00,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2025-03-15 01:25:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:00,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:00,658 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| Int) (v_ArrVal_153 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_153) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) is different from false [2025-03-15 01:25:00,870 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| Int) (v_ArrVal_153 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_153) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14|) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483650))))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24|))) is different from false [2025-03-15 01:25:01,306 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| Int) (v_ArrVal_151 Int) (v_ArrVal_153 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_151) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_153) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24|) (< v_ArrVal_151 (+ (select .cse0 .cse2) 1)) (< 0 (+ 2147483650 (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14|))))) is different from false [2025-03-15 01:25:01,349 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| Int) (v_ArrVal_151 Int) (v_ArrVal_153 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_14| Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_151) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_153) |c_~#queue~0.base|))) (or (< v_ArrVal_151 (+ (select .cse0 .cse1) 1)) (< 0 (+ 2147483650 (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_14|) (+ 88 |c_~#queue~0.offset|)))) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24|))))) is different from false [2025-03-15 01:25:02,119 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_18| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| Int) (v_ArrVal_151 Int) (v_ArrVal_153 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_14| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse3 (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_18| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse2 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse3 .cse4 v_ArrVal_151) .cse2 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24| 1))) |c_~#stored_elements~0.base| v_ArrVal_153) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_18|) (< v_ArrVal_151 (+ (select .cse3 .cse4) 1)) (< 0 (+ (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_14| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_14|) (+ 88 |c_~#queue~0.offset|)) 2147483650)) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_24|)))))) is different from false [2025-03-15 01:25:11,379 INFO L349 Elim1Store]: treesize reduction 267, result has 41.2 percent of original size [2025-03-15 01:25:11,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 281 treesize of output 337 [2025-03-15 01:25:11,420 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:25:11,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 244 treesize of output 224 [2025-03-15 01:25:11,446 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:11,446 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 96 treesize of output 94 [2025-03-15 01:25:11,461 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 42 treesize of output 34 [2025-03-15 01:25:11,537 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 17 treesize of output 9 [2025-03-15 01:25:11,584 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 17 treesize of output 9 [2025-03-15 01:25:11,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:11,677 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 112 treesize of output 128 [2025-03-15 01:25:11,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:11,993 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 223 treesize of output 211 [2025-03-15 01:25:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-03-15 01:25:20,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417258017] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:25:20,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:25:20,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 65 [2025-03-15 01:25:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047593670] [2025-03-15 01:25:20,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:25:20,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-15 01:25:20,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:20,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-15 01:25:20,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=434, Invalid=3189, Unknown=57, NotChecked=610, Total=4290 [2025-03-15 01:25:20,834 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 289 [2025-03-15 01:25:20,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 406 transitions, 3520 flow. Second operand has 66 states, 66 states have (on average 172.3030303030303) internal successors, (11372), 66 states have internal predecessors, (11372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:20,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:20,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 289 [2025-03-15 01:25:20,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:28,476 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:25:30,648 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] [2025-03-15 01:25:31,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:25:34,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:25:36,980 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] [2025-03-15 01:25:38,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:25:41,173 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] [2025-03-15 01:25:41,951 INFO L124 PetriNetUnfolderBase]: 1036/3846 cut-off events. [2025-03-15 01:25:41,952 INFO L125 PetriNetUnfolderBase]: For 39918/40275 co-relation queries the response was YES. [2025-03-15 01:25:41,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17540 conditions, 3846 events. 1036/3846 cut-off events. For 39918/40275 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 29448 event pairs, 165 based on Foata normal form. 0/3539 useless extension candidates. Maximal degree in co-relation 13929. Up to 1546 conditions per place. [2025-03-15 01:25:41,973 INFO L140 encePairwiseOnDemand]: 254/289 looper letters, 342 selfloop transitions, 62 changer transitions 30/603 dead transitions. [2025-03-15 01:25:41,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 603 transitions, 7324 flow [2025-03-15 01:25:41,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 01:25:41,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 01:25:41,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 8228 transitions. [2025-03-15 01:25:41,983 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6057571964956195 [2025-03-15 01:25:41,984 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 96 predicate places. [2025-03-15 01:25:41,984 INFO L471 AbstractCegarLoop]: Abstraction has has 379 places, 603 transitions, 7324 flow [2025-03-15 01:25:41,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 172.3030303030303) internal successors, (11372), 66 states have internal predecessors, (11372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:41,987 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:41,987 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:41,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 01:25:42,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:42,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:25:42,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1647984444, now seen corresponding path program 1 times [2025-03-15 01:25:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571674432] [2025-03-15 01:25:42,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:42,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:43,418 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:43,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571674432] [2025-03-15 01:25:43,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571674432] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:25:43,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719228033] [2025-03-15 01:25:43,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:43,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:25:43,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:25:43,421 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) [2025-03-15 01:25:43,421 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:25:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:43,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-03-15 01:25:43,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:25:43,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-15 01:25:43,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-15 01:25:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:25:44,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:25:44,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2025-03-15 01:25:44,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-15 01:25:44,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-15 01:25:44,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:25:44,545 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 23 treesize of output 16 [2025-03-15 01:25:44,765 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-15 01:25:44,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 24 [2025-03-15 01:25:44,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 22 treesize of output 10 [2025-03-15 01:25:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:44,782 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:25:45,250 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| Int)) (or (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_201) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22|)))))) is different from false [2025-03-15 01:25:45,530 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_198 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_198) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_201) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30|) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_198) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22|))))) is different from false [2025-03-15 01:25:45,548 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_198 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse2 v_ArrVal_198) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_201) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30|) (< (+ (select .cse0 .cse2) 1) v_ArrVal_198) (< (select (store .cse3 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22|))))) is different from false [2025-03-15 01:25:45,788 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int)) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_21| Int) (v_ArrVal_198 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse1 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_198) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_201) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_198) (< (select (store .cse0 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_21|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30|))))) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26|)))) is different from false [2025-03-15 01:25:45,834 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_21| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| Int) (v_ArrVal_198 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| Int) (v_ArrVal_201 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse0 (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse0 .cse1 v_ArrVal_198) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30| 1))) |c_~#stored_elements~0.base| v_ArrVal_201) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_198) (< (select (store .cse2 (+ |c_~#queue~0.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22| 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_21|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_30|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_26|) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_22|)))))) is different from false [2025-03-15 01:25:56,751 INFO L349 Elim1Store]: treesize reduction 267, result has 41.2 percent of original size [2025-03-15 01:25:56,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 279 treesize of output 335 [2025-03-15 01:25:56,780 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:25:56,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 220 [2025-03-15 01:25:56,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:56,802 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 96 treesize of output 94 [2025-03-15 01:25:56,817 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 38 treesize of output 30 [2025-03-15 01:25:56,856 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 17 treesize of output 9 [2025-03-15 01:25:56,910 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 17 treesize of output 9 [2025-03-15 01:25:56,988 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:56,988 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 123 treesize of output 139 [2025-03-15 01:25:57,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:25:57,311 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 175 treesize of output 183 [2025-03-15 01:26:05,556 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2025-03-15 01:26:05,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1719228033] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:26:05,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:26:05,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 24] total 65 [2025-03-15 01:26:05,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787464106] [2025-03-15 01:26:05,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:26:05,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2025-03-15 01:26:05,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:05,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2025-03-15 01:26:05,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=3108, Unknown=56, NotChecked=610, Total=4290 [2025-03-15 01:26:05,563 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 289 [2025-03-15 01:26:05,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 379 places, 603 transitions, 7324 flow. Second operand has 66 states, 66 states have (on average 172.33333333333334) internal successors, (11374), 66 states have internal predecessors, (11374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:05,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:05,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 289 [2025-03-15 01:26:05,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:25,194 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] [2025-03-15 01:26:27,643 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] [2025-03-15 01:26:29,664 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] [2025-03-15 01:26:36,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:26:38,507 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] [2025-03-15 01:26:41,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:26:43,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:26:45,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:26:47,842 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] [2025-03-15 01:26:51,905 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] [2025-03-15 01:26:53,907 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] [2025-03-15 01:26:56,223 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] [2025-03-15 01:26:58,294 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] [2025-03-15 01:26:59,398 INFO L124 PetriNetUnfolderBase]: 1776/6518 cut-off events. [2025-03-15 01:26:59,398 INFO L125 PetriNetUnfolderBase]: For 80478/81067 co-relation queries the response was YES. [2025-03-15 01:26:59,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32680 conditions, 6518 events. 1776/6518 cut-off events. For 80478/81067 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 55675 event pairs, 321 based on Foata normal form. 0/6005 useless extension candidates. Maximal degree in co-relation 26897. Up to 2707 conditions per place. [2025-03-15 01:26:59,442 INFO L140 encePairwiseOnDemand]: 255/289 looper letters, 588 selfloop transitions, 74 changer transitions 45/876 dead transitions. [2025-03-15 01:26:59,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 876 transitions, 13471 flow [2025-03-15 01:26:59,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 01:26:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 01:26:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 8227 transitions. [2025-03-15 01:26:59,448 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6056835750570566 [2025-03-15 01:26:59,449 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 142 predicate places. [2025-03-15 01:26:59,449 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 876 transitions, 13471 flow [2025-03-15 01:26:59,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 172.33333333333334) internal successors, (11374), 66 states have internal predecessors, (11374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:59,452 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:59,452 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:59,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 01:26:59,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-15 01:26:59,653 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:26:59,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash -2026197363, now seen corresponding path program 1 times [2025-03-15 01:26:59,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:59,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109822666] [2025-03-15 01:26:59,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:59,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:00,235 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:00,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109822666] [2025-03-15 01:27:00,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109822666] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:00,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618594552] [2025-03-15 01:27:00,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:00,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:00,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:00,238 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) [2025-03-15 01:27:00,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:27:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:00,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-15 01:27:00,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:00,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 21 [2025-03-15 01:27:00,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:00,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-03-15 01:27:01,086 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-15 01:27:01,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 41 [2025-03-15 01:27:01,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-03-15 01:27:01,148 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 31 treesize of output 13 [2025-03-15 01:27:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:01,185 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:01,470 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_248 (Array Int Int))) (< 0 (+ (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_248) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1)) 2147483650))) is different from false [2025-03-15 01:27:01,510 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_248 (Array Int Int))) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_248) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) .cse1))))) is different from false [2025-03-15 01:27:01,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:01,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2025-03-15 01:27:01,797 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:01,797 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 74 treesize of output 74 [2025-03-15 01:27:01,802 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 36 treesize of output 24 [2025-03-15 01:27:01,812 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 17 treesize of output 9 [2025-03-15 01:27:01,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:01,835 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 59 treesize of output 47 [2025-03-15 01:27:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618594552] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:02,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 18] total 48 [2025-03-15 01:27:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459985203] [2025-03-15 01:27:02,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:02,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-15 01:27:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:02,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-15 01:27:02,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1965, Unknown=2, NotChecked=182, Total=2352 [2025-03-15 01:27:02,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 289 [2025-03-15 01:27:02,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 876 transitions, 13471 flow. Second operand has 49 states, 49 states have (on average 176.24489795918367) internal successors, (8636), 49 states have internal predecessors, (8636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:02,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:02,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 289 [2025-03-15 01:27:02,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:06,565 INFO L124 PetriNetUnfolderBase]: 2145/7701 cut-off events. [2025-03-15 01:27:06,565 INFO L125 PetriNetUnfolderBase]: For 119420/120130 co-relation queries the response was YES. [2025-03-15 01:27:06,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42298 conditions, 7701 events. 2145/7701 cut-off events. For 119420/120130 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 68482 event pairs, 384 based on Foata normal form. 0/7114 useless extension candidates. Maximal degree in co-relation 35166. Up to 3194 conditions per place. [2025-03-15 01:27:06,604 INFO L140 encePairwiseOnDemand]: 262/289 looper letters, 714 selfloop transitions, 112 changer transitions 54/1078 dead transitions. [2025-03-15 01:27:06,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 1078 transitions, 19613 flow [2025-03-15 01:27:06,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-15 01:27:06,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-15 01:27:06,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4111 transitions. [2025-03-15 01:27:06,608 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6184744997743343 [2025-03-15 01:27:06,608 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 163 predicate places. [2025-03-15 01:27:06,609 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 1078 transitions, 19613 flow [2025-03-15 01:27:06,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 176.24489795918367) internal successors, (8636), 49 states have internal predecessors, (8636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:06,611 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:06,612 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:06,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 01:27:06,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:06,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:27:06,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:06,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1013778146, now seen corresponding path program 1 times [2025-03-15 01:27:06,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:06,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004166393] [2025-03-15 01:27:06,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:06,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,814 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:07,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004166393] [2025-03-15 01:27:07,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004166393] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:07,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910354503] [2025-03-15 01:27:07,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:07,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:07,816 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) [2025-03-15 01:27:07,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:27:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-15 01:27:07,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:08,109 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 13 treesize of output 9 [2025-03-15 01:27:08,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-15 01:27:08,559 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:08,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:08,573 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2025-03-15 01:27:08,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:27:08,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:08,656 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:27:08,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 31 [2025-03-15 01:27:08,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 3 [2025-03-15 01:27:08,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:27:08,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-03-15 01:27:09,050 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-15 01:27:09,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 16 [2025-03-15 01:27:09,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-15 01:27:09,090 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 19 treesize of output 7 [2025-03-15 01:27:09,140 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:09,140 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:09,480 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_302) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))) is different from false [2025-03-15 01:27:09,539 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_302) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 2147483647)))) is different from false [2025-03-15 01:27:09,563 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_302 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| 1))) |c_~#stored_elements~0.base| v_ArrVal_302) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) .cse1) 2147483647) (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44|))) is different from false [2025-03-15 01:27:09,998 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int)) (let ((.cse3 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_299 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (v_ArrVal_302 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| Int)) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_299) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| 1))) |c_~#stored_elements~0.base| v_ArrVal_302) |c_~#queue~0.base|)) (.cse2 (+ 84 |c_~#queue~0.offset|))) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44|) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse2) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|)))) (= .cse0 20))))) is different from false [2025-03-15 01:27:20,234 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| Int) (v_ArrVal_299 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_34| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| Int) (v_ArrVal_302 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| Int)) (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse5 (store .cse3 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42| 4)) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse4 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse2 (select .cse5 .cse4)) (.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse5 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) v_ArrVal_299) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44| 1))) |c_~#stored_elements~0.base| v_ArrVal_302) |c_~#queue~0.base|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38|) (< .cse2 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_44|) (= .cse2 20) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_42|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_38| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_34|) .cse1) 2147483647)))))) is different from false [2025-03-15 01:27:23,907 INFO L349 Elim1Store]: treesize reduction 267, result has 41.2 percent of original size [2025-03-15 01:27:23,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 277 treesize of output 333 [2025-03-15 01:27:23,923 INFO L159 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:23,925 INFO L164 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 201 [2025-03-15 01:27:23,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:23,949 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 285 treesize of output 283 [2025-03-15 01:27:23,964 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 38 treesize of output 30 [2025-03-15 01:27:23,987 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 17 treesize of output 9 [2025-03-15 01:27:24,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:24,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 77 [2025-03-15 01:27:24,161 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 17 treesize of output 9 [2025-03-15 01:27:24,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:27:24,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 125 [2025-03-15 01:27:24,558 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2025-03-15 01:27:24,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [910354503] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:24,558 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:24,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 24] total 63 [2025-03-15 01:27:24,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514178878] [2025-03-15 01:27:24,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:24,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-15 01:27:24,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:24,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-15 01:27:24,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=423, Invalid=2987, Unknown=32, NotChecked=590, Total=4032 [2025-03-15 01:27:24,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 289 [2025-03-15 01:27:24,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 1078 transitions, 19613 flow. Second operand has 64 states, 64 states have (on average 176.5625) internal successors, (11300), 64 states have internal predecessors, (11300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:24,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:24,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 289 [2025-03-15 01:27:24,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:34,332 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] [2025-03-15 01:28:36,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:28:38,641 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] [2025-03-15 01:28:40,650 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] [2025-03-15 01:28:53,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:28:59,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:29:07,619 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] [2025-03-15 01:29:24,252 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] [2025-03-15 01:29:47,970 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] [2025-03-15 01:29:50,221 INFO L124 PetriNetUnfolderBase]: 2576/9209 cut-off events. [2025-03-15 01:29:50,221 INFO L125 PetriNetUnfolderBase]: For 166665/167738 co-relation queries the response was YES. [2025-03-15 01:29:50,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55111 conditions, 9209 events. 2576/9209 cut-off events. For 166665/167738 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 84648 event pairs, 436 based on Foata normal form. 34/8572 useless extension candidates. Maximal degree in co-relation 44250. Up to 3941 conditions per place. [2025-03-15 01:29:50,288 INFO L140 encePairwiseOnDemand]: 256/289 looper letters, 906 selfloop transitions, 188 changer transitions 59/1366 dead transitions. [2025-03-15 01:29:50,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 1366 transitions, 27969 flow [2025-03-15 01:29:50,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-15 01:29:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-15 01:29:50,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 9825 transitions. [2025-03-15 01:29:50,294 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6181189053161371 [2025-03-15 01:29:50,295 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 217 predicate places. [2025-03-15 01:29:50,295 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 1366 transitions, 27969 flow [2025-03-15 01:29:50,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 176.5625) internal successors, (11300), 64 states have internal predecessors, (11300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:50,298 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:50,298 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:50,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:29:50,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:29:50,503 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:29:50,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:50,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1980343885, now seen corresponding path program 1 times [2025-03-15 01:29:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:50,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503782246] [2025-03-15 01:29:50,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:50,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:50,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:29:50,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503782246] [2025-03-15 01:29:50,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503782246] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:29:50,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [661051389] [2025-03-15 01:29:50,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:50,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:29:50,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:29:50,626 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) [2025-03-15 01:29:50,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:29:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:50,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:29:50,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:29:50,933 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:29:50,934 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:29:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [661051389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:29:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:29:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:29:50,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420320294] [2025-03-15 01:29:50,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:29:50,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:29:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:29:50,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:29:50,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:29:50,935 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2025-03-15 01:29:50,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 1366 transitions, 27969 flow. Second operand has 6 states, 6 states have (on average 264.5) internal successors, (1587), 6 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:50,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:29:50,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2025-03-15 01:29:50,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:29:53,122 INFO L124 PetriNetUnfolderBase]: 2555/9166 cut-off events. [2025-03-15 01:29:53,123 INFO L125 PetriNetUnfolderBase]: For 190081/191106 co-relation queries the response was YES. [2025-03-15 01:29:53,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57579 conditions, 9166 events. 2555/9166 cut-off events. For 190081/191106 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 84051 event pairs, 436 based on Foata normal form. 0/8523 useless extension candidates. Maximal degree in co-relation 46255. Up to 3920 conditions per place. [2025-03-15 01:29:53,194 INFO L140 encePairwiseOnDemand]: 284/289 looper letters, 776 selfloop transitions, 6 changer transitions 59/1386 dead transitions. [2025-03-15 01:29:53,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 505 places, 1386 transitions, 30198 flow [2025-03-15 01:29:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:29:53,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:29:53,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1879 transitions. [2025-03-15 01:29:53,196 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9288185862580326 [2025-03-15 01:29:53,196 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 222 predicate places. [2025-03-15 01:29:53,196 INFO L471 AbstractCegarLoop]: Abstraction has has 505 places, 1386 transitions, 30198 flow [2025-03-15 01:29:53,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 264.5) internal successors, (1587), 6 states have internal predecessors, (1587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:53,197 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:53,197 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:53,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 01:29:53,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-15 01:29:53,398 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:29:53,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1261117549, now seen corresponding path program 1 times [2025-03-15 01:29:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:53,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590658568] [2025-03-15 01:29:53,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:53,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:53,462 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:29:53,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:53,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590658568] [2025-03-15 01:29:53,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590658568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:29:53,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:29:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:29:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205495304] [2025-03-15 01:29:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:29:53,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:29:53,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:29:53,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:29:53,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:29:53,464 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2025-03-15 01:29:53,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 505 places, 1386 transitions, 30198 flow. Second operand has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:53,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:29:53,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2025-03-15 01:29:53,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:29:55,570 INFO L124 PetriNetUnfolderBase]: 2534/9107 cut-off events. [2025-03-15 01:29:55,570 INFO L125 PetriNetUnfolderBase]: For 215688/216711 co-relation queries the response was YES. [2025-03-15 01:29:55,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59929 conditions, 9107 events. 2534/9107 cut-off events. For 215688/216711 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 83470 event pairs, 436 based on Foata normal form. 0/8492 useless extension candidates. Maximal degree in co-relation 48198. Up to 3899 conditions per place. [2025-03-15 01:29:55,653 INFO L140 encePairwiseOnDemand]: 283/289 looper letters, 818 selfloop transitions, 8 changer transitions 59/1430 dead transitions. [2025-03-15 01:29:55,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 1430 transitions, 33251 flow [2025-03-15 01:29:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:29:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:29:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1339 transitions. [2025-03-15 01:29:55,655 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9266435986159169 [2025-03-15 01:29:55,656 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 225 predicate places. [2025-03-15 01:29:55,656 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 1430 transitions, 33251 flow [2025-03-15 01:29:55,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:55,656 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:55,657 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:29:55,657 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:29:55,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:55,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1719955788, now seen corresponding path program 1 times [2025-03-15 01:29:55,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:55,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038852708] [2025-03-15 01:29:55,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:55,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:55,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:29:55,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:55,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038852708] [2025-03-15 01:29:55,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038852708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:29:55,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:29:55,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:29:55,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331917397] [2025-03-15 01:29:55,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:29:55,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:29:55,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:29:55,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:29:55,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:29:55,786 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 289 [2025-03-15 01:29:55,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 1430 transitions, 33251 flow. Second operand has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:55,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:29:55,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 289 [2025-03-15 01:29:55,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:29:57,158 INFO L124 PetriNetUnfolderBase]: 1083/5485 cut-off events. [2025-03-15 01:29:57,159 INFO L125 PetriNetUnfolderBase]: For 153783/154563 co-relation queries the response was YES. [2025-03-15 01:29:57,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33019 conditions, 5485 events. 1083/5485 cut-off events. For 153783/154563 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 49940 event pairs, 30 based on Foata normal form. 382/5469 useless extension candidates. Maximal degree in co-relation 19171. Up to 2039 conditions per place. [2025-03-15 01:29:57,190 INFO L140 encePairwiseOnDemand]: 285/289 looper letters, 279 selfloop transitions, 19 changer transitions 68/921 dead transitions. [2025-03-15 01:29:57,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 510 places, 921 transitions, 18881 flow [2025-03-15 01:29:57,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:29:57,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:29:57,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 820 transitions. [2025-03-15 01:29:57,192 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9457900807381776 [2025-03-15 01:29:57,192 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 227 predicate places. [2025-03-15 01:29:57,192 INFO L471 AbstractCegarLoop]: Abstraction has has 510 places, 921 transitions, 18881 flow [2025-03-15 01:29:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 270.6666666666667) internal successors, (812), 3 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:57,193 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:57,193 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:57,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:29:57,193 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:29:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1933049489, now seen corresponding path program 1 times [2025-03-15 01:29:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140584543] [2025-03-15 01:29:57,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:57,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:29:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:29:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140584543] [2025-03-15 01:29:57,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140584543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:29:57,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178947943] [2025-03-15 01:29:57,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:57,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:29:57,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:29:57,285 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) [2025-03-15 01:29:57,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:29:57,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:29:57,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:29:57,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:29:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:29:57,475 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:29:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:29:57,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178947943] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:29:57,580 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:29:57,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 01:29:57,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407805944] [2025-03-15 01:29:57,580 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:29:57,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:29:57,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:29:57,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:29:57,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:29:57,582 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 289 [2025-03-15 01:29:57,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 510 places, 921 transitions, 18881 flow. Second operand has 10 states, 10 states have (on average 265.1) internal successors, (2651), 10 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:57,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:29:57,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 289 [2025-03-15 01:29:57,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:29:58,714 INFO L124 PetriNetUnfolderBase]: 828/4265 cut-off events. [2025-03-15 01:29:58,714 INFO L125 PetriNetUnfolderBase]: For 96253/96527 co-relation queries the response was YES. [2025-03-15 01:29:58,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27198 conditions, 4265 events. 828/4265 cut-off events. For 96253/96527 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 35382 event pairs, 99 based on Foata normal form. 0/3980 useless extension candidates. Maximal degree in co-relation 15516. Up to 1627 conditions per place. [2025-03-15 01:29:58,744 INFO L140 encePairwiseOnDemand]: 283/289 looper letters, 277 selfloop transitions, 9 changer transitions 51/851 dead transitions. [2025-03-15 01:29:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 851 transitions, 17331 flow [2025-03-15 01:29:58,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:29:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:29:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2400 transitions. [2025-03-15 01:29:58,747 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922722029988466 [2025-03-15 01:29:58,747 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 235 predicate places. [2025-03-15 01:29:58,747 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 851 transitions, 17331 flow [2025-03-15 01:29:58,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 265.1) internal successors, (2651), 10 states have internal predecessors, (2651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:29:58,747 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:29:58,748 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:29:58,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 01:29:58,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-15 01:29:58,949 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:29:58,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:29:58,950 INFO L85 PathProgramCache]: Analyzing trace with hash -529393013, now seen corresponding path program 1 times [2025-03-15 01:29:58,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:29:58,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398631579] [2025-03-15 01:29:58,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:29:58,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:29:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:30:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:30:00,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:30:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398631579] [2025-03-15 01:30:00,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398631579] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:30:00,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414571231] [2025-03-15 01:30:00,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:30:00,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:30:00,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:30:00,863 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) [2025-03-15 01:30:00,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:30:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:30:00,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-15 01:30:00,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:30:01,577 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 19 treesize of output 1 [2025-03-15 01:30:01,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-15 01:30:01,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:01,870 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 [2025-03-15 01:30:02,177 INFO L349 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2025-03-15 01:30:02,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 19 [2025-03-15 01:30:02,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:02,288 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 34 treesize of output 22 [2025-03-15 01:30:02,296 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-15 01:30:02,297 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:30:02,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414571231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:30:02,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:30:02,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [28] total 42 [2025-03-15 01:30:02,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456023020] [2025-03-15 01:30:02,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:30:02,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:30:02,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:30:02,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:30:02,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1663, Unknown=0, NotChecked=0, Total=1806 [2025-03-15 01:30:02,299 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 289 [2025-03-15 01:30:02,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 851 transitions, 17331 flow. Second operand has 18 states, 18 states have (on average 181.55555555555554) internal successors, (3268), 18 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:30:02,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:30:02,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 289 [2025-03-15 01:30:02,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:30:04,411 INFO L124 PetriNetUnfolderBase]: 826/4245 cut-off events. [2025-03-15 01:30:04,411 INFO L125 PetriNetUnfolderBase]: For 107006/107327 co-relation queries the response was YES. [2025-03-15 01:30:04,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28945 conditions, 4245 events. 826/4245 cut-off events. For 107006/107327 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 34981 event pairs, 74 based on Foata normal form. 0/3967 useless extension candidates. Maximal degree in co-relation 16570. Up to 1618 conditions per place. [2025-03-15 01:30:04,443 INFO L140 encePairwiseOnDemand]: 272/289 looper letters, 470 selfloop transitions, 91 changer transitions 51/854 dead transitions. [2025-03-15 01:30:04,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 854 transitions, 18677 flow [2025-03-15 01:30:04,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:30:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:30:04,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2585 transitions. [2025-03-15 01:30:04,447 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.638902619871478 [2025-03-15 01:30:04,448 INFO L298 CegarLoopForPetriNet]: 283 programPoint places, 246 predicate places. [2025-03-15 01:30:04,448 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 854 transitions, 18677 flow [2025-03-15 01:30:04,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 181.55555555555554) internal successors, (3268), 18 states have internal predecessors, (3268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:30:04,449 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:30:04,449 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:30:04,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:30:04,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:30:04,649 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2025-03-15 01:30:04,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:30:04,650 INFO L85 PathProgramCache]: Analyzing trace with hash 768686493, now seen corresponding path program 1 times [2025-03-15 01:30:04,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:30:04,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124270456] [2025-03-15 01:30:04,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:30:04,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:30:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:30:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:30:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:30:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124270456] [2025-03-15 01:30:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124270456] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:30:07,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266877778] [2025-03-15 01:30:07,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:30:07,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:30:07,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:30:07,216 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) [2025-03-15 01:30:07,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 01:30:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:30:07,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-15 01:30:07,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:30:07,571 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 13 treesize of output 9 [2025-03-15 01:30:07,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-15 01:30:08,128 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:30:08,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:08,147 INFO L349 Elim1Store]: treesize reduction 64, result has 22.9 percent of original size [2025-03-15 01:30:08,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:30:08,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:08,354 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:30:08,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-03-15 01:30:08,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 16 [2025-03-15 01:30:08,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:08,774 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 27 treesize of output 20 [2025-03-15 01:30:09,121 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:30:09,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:09,143 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-15 01:30:09,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-15 01:30:09,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:09,402 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-15 01:30:09,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 42 [2025-03-15 01:30:09,798 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:09,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2025-03-15 01:30:09,882 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-15 01:30:09,883 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 27 treesize of output 20 [2025-03-15 01:30:10,139 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2025-03-15 01:30:10,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 28 [2025-03-15 01:30:10,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:30:10,154 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 28 treesize of output 10 [2025-03-15 01:30:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:30:10,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:30:10,827 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2025-03-15 01:30:11,126 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2025-03-15 01:30:11,150 WARN L851 $PredicateComparison]: unable to prove that (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) (= |c_t1Thread1of1ForFork1_enqueue_#t~mem39#1| 20)) is different from false [2025-03-15 01:30:12,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse4 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse1 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (store .cse5 (+ (* (select .cse5 .cse4) 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse3 (select .cse0 .cse4)) (.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 .cse1 v_ArrVal_574) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (+ (select .cse0 .cse1) 1) v_ArrVal_574) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (= .cse3 20) (< .cse3 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2025-03-15 01:30:28,192 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork1_enqueue_#t~post41#1| 1))))) (let ((.cse2 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (.cse1 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse2 .cse1 v_ArrVal_574) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse3 (select .cse2 .cse4))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse1) 2147483647) (< (+ (select .cse2 .cse1) 1) v_ArrVal_574) (= 20 .cse3) (< (select .cse0 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< .cse3 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|)))))) is different from false [2025-03-15 01:30:28,305 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int)) (or (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse4 (+ 84 |c_~#queue~0.offset|)) (.cse5 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse3 (let ((.cse6 (select (store .cse5 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse6 (+ |c_~#queue~0.offset| (* (select .cse6 .cse4) 4)) |t1Thread1of1ForFork1_enqueue_~x#1|))) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse1 (select (store (store .cse5 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_574) .cse4 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse0 (select .cse3 .cse4))) (or (= .cse0 20) (< (select (store .cse1 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_574) (< (select .cse1 .cse4) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|)))))) (< |c_t1Thread1of1ForFork1_enqueue_#t~mem40#1| |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|))) is different from false [2025-03-15 01:30:30,939 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_568 Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse5 (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse5 .cse3)) (.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_574) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~post38#1| 1) v_ArrVal_568) (= .cse4 20) (< .cse4 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_574) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse6) 2147483647))))))) is different from false [2025-03-15 01:30:31,109 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int) (|t1Thread1of1ForFork1_enqueue_~x#1| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_568 Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse3 (+ 84 |c_~#queue~0.offset|)) (.cse7 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse6 (+ 88 |c_~#queue~0.offset|)) (.cse5 (let ((.cse8 (select (store .cse7 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse8 (+ (* (select .cse8 .cse3) 4) |c_~#queue~0.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)))) (let ((.cse4 (select .cse5 .cse3)) (.cse2 (select (store (store .cse7 |c_~#queue~0.base| (store (store .cse5 .cse6 v_ArrVal_574) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (= .cse4 20) (< .cse4 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (+ (select .cse5 .cse6) 1) v_ArrVal_574) (< (+ |c_t1Thread1of1ForFork1_enqueue_#t~mem37#1| 1) v_ArrVal_568) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse6) 2147483647))))))) is different from false [2025-03-15 01:30:34,079 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_568 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_48| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|) (+ (* 4 |c_t1Thread1of1ForFork1_enqueue_#t~mem36#1|) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse5 (+ 84 |c_~#queue~0.offset|)) (.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse1 .cse2 v_ArrVal_568) .cse3 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse7 (let ((.cse9 (select (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse9 (+ (* (select .cse9 .cse5) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_48|))) (.cse6 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse8 |c_~#queue~0.base| (store (store .cse7 .cse6 v_ArrVal_574) .cse5 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse0 (select .cse7 .cse5))) (or (< .cse0 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (+ (select .cse1 .cse2) 1) v_ArrVal_568) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse6) 2147483647) (= .cse0 20) (< (+ (select .cse7 .cse6) 1) v_ArrVal_574))))))) is different from false [2025-03-15 01:30:34,151 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58| Int)) (let ((.cse1 (+ 84 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|)) (.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58|) (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int) (v_ArrVal_574 Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_568 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_48| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse2 (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58| 4) |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork1_enqueue_~q#1.offset|))) (let ((.cse7 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_~q#1.base| (store (store .cse2 .cse3 v_ArrVal_568) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse6 (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse10 (+ |c_~#queue~0.offset| (* (select .cse10 .cse7) 4)) |v_t1Thread1of1ForFork1_enqueue_~x#1_48|))) (.cse5 (+ 88 |c_~#queue~0.offset|))) (let ((.cse4 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse6 .cse5 v_ArrVal_574) .cse7 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse8 (select .cse6 .cse7))) (or (< (+ (select .cse2 .cse3) 1) v_ArrVal_568) (< (select (store .cse4 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse5) 2147483647) (< (+ (select .cse6 .cse5) 1) v_ArrVal_574) (< (select .cse4 .cse7) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (= .cse8 20) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|) (< .cse8 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|)))))))))) is different from false [2025-03-15 01:30:34,296 WARN L851 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork1_enqueue_~x#1| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| Int) (v_ArrVal_574 Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58| Int) (v_ArrVal_571 (Array Int Int)) (|v_t1Thread1of1ForFork1_enqueue_~x#1_44| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| Int) (|v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| Int) (v_ArrVal_568 Int) (|v_t1Thread1of1ForFork1_enqueue_~x#1_48| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base|))) (let ((.cse7 (store .cse5 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58| 4) |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|) |t1Thread1of1ForFork1_enqueue_~x#1|)) (.cse8 (+ 88 |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset|)) (.cse6 (+ |c_t1Thread1of1ForFork1_enqueue_#in~q#1.offset| 84))) (let ((.cse1 (+ 84 |c_~#queue~0.offset|)) (.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork1_enqueue_#in~q#1.base| (store (store .cse7 .cse8 v_ArrVal_568) .cse6 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58| 1))))) (let ((.cse3 (let ((.cse10 (select (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_571) |c_~#queue~0.base|))) (store .cse10 (+ (* (select .cse10 .cse1) 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_48|))) (.cse2 (+ 88 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store .cse9 |c_~#queue~0.base| (store (store .cse3 .cse2 v_ArrVal_574) .cse1 (+ |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54| 1))) |c_~#stored_elements~0.base| v_ArrVal_576) |c_~#queue~0.base|)) (.cse4 (select .cse3 .cse1))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_50| 4) |c_~#queue~0.offset|) |v_t1Thread1of1ForFork1_enqueue_~x#1_44|) .cse2) 2147483647) (< (+ (select .cse3 .cse2) 1) v_ArrVal_574) (= .cse4 20) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~mem36#1_58|) (< .cse4 |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_54|) (< (select .cse7 .cse6) |v_t1Thread1of1ForFork1_enqueue_#t~post41#1_58|) (< (+ (select .cse7 .cse8) 1) v_ArrVal_568)))))))) is different from false [2025-03-15 01:31:07,157 INFO L349 Elim1Store]: treesize reduction 267, result has 41.2 percent of original size [2025-03-15 01:31:07,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 899 treesize of output 493 [2025-03-15 01:31:07,192 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2025-03-15 01:31:07,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 519 treesize of output 483 [2025-03-15 01:31:07,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:31:07,222 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 284 treesize of output 282 [2025-03-15 01:31:07,242 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 38 treesize of output 30 [2025-03-15 01:31:07,257 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 105 treesize of output 69 [2025-03-15 01:31:07,365 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 17 treesize of output 9 [2025-03-15 01:31:07,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:31:07,455 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 91 treesize of output 107 [2025-03-15 01:31:07,892 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 17 treesize of output 9 [2025-03-15 01:31:07,945 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-15 01:31:07,946 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 255 treesize of output 235 [2025-03-15 01:31:22,808 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 8 refuted. 3 times theorem prover too weak. 0 trivial. 14 not checked. [2025-03-15 01:31:22,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266877778] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:31:22,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:31:22,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 37] total 97 [2025-03-15 01:31:22,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73271220] [2025-03-15 01:31:22,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:31:22,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-15 01:31:22,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:31:22,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-15 01:31:22,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=954, Invalid=6391, Unknown=181, NotChecked=1980, Total=9506 [2025-03-15 01:31:22,814 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 289 [2025-03-15 01:31:22,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 854 transitions, 18677 flow. Second operand has 98 states, 98 states have (on average 167.83673469387756) internal successors, (16448), 98 states have internal predecessors, (16448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:31:22,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:31:22,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 289 [2025-03-15 01:31:22,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:31:42,013 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] [2025-03-15 01:32:20,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:32:22,728 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] [2025-03-15 01:32:25,811 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] [2025-03-15 01:32:43,733 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] [2025-03-15 01:32:45,826 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] [2025-03-15 01:32:47,856 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] [2025-03-15 01:32:49,901 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] [2025-03-15 01:32:52,575 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] [2025-03-15 01:32:54,611 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] [2025-03-15 01:32:56,887 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] [2025-03-15 01:32:58,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:00,931 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] [2025-03-15 01:33:02,954 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] [2025-03-15 01:33:04,984 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] [2025-03-15 01:33:26,548 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] [2025-03-15 01:33:28,596 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] [2025-03-15 01:33:50,548 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] [2025-03-15 01:33:52,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:54,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:33:58,761 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] [2025-03-15 01:34:01,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:03,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:05,116 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] [2025-03-15 01:34:07,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 [1] [2025-03-15 01:34:09,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:34:11,207 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] [2025-03-15 01:34:13,228 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] [2025-03-15 01:34:33,688 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] [2025-03-15 01:34:35,727 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] [2025-03-15 01:34:37,738 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] [2025-03-15 01:34:39,745 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] [2025-03-15 01:34:41,750 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] [2025-03-15 01:35:05,721 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] [2025-03-15 01:35:07,743 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] [2025-03-15 01:35:33,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:35:35,876 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] [2025-03-15 01:35:37,882 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] [2025-03-15 01:35:40,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:09,460 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] [2025-03-15 01:36:37,223 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] [2025-03-15 01:36:39,250 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] [2025-03-15 01:36:41,271 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] [2025-03-15 01:36:43,378 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] [2025-03-15 01:36:45,415 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] [2025-03-15 01:36:47,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:49,715 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] [2025-03-15 01:36:51,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:55,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:57,082 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:36:59,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:37:01,131 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] [2025-03-15 01:37:03,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:37:05,530 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] [2025-03-15 01:37:07,563 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] [2025-03-15 01:37:15,116 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] [2025-03-15 01:37:17,119 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] [2025-03-15 01:37:19,142 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] [2025-03-15 01:37:25,721 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] [2025-03-15 01:37:27,763 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] [2025-03-15 01:37:30,209 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] [2025-03-15 01:37:32,214 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] [2025-03-15 01:37:34,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:37:36,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:37:38,258 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] [2025-03-15 01:37:44,639 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] [2025-03-15 01:37:46,690 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] [2025-03-15 01:37:48,693 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] [2025-03-15 01:37:50,701 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] [2025-03-15 01:37:52,705 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] [2025-03-15 01:37:54,722 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] [2025-03-15 01:37:57,430 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] [2025-03-15 01:38:01,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:38:03,300 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] [2025-03-15 01:38:32,253 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] [2025-03-15 01:38:34,257 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] [2025-03-15 01:38:36,388 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] [2025-03-15 01:38:38,519 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] [2025-03-15 01:38:40,575 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] [2025-03-15 01:38:42,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:38:45,405 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] [2025-03-15 01:38:47,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:38:50,065 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] [2025-03-15 01:38:52,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-15 01:38:54,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] Received shutdown request... [2025-03-15 01:38:55,921 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 [2025-03-15 01:38:55,954 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:38:56,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-15 01:38:57,122 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2025-03-15 01:38:57,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2025-03-15 01:38:57,183 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 26 remaining) [2025-03-15 01:38:57,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:38:57,183 WARN L596 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 26 remaining) [2025-03-15 01:38:57,188 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 26 remaining) [2025-03-15 01:38:57,189 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 26 remaining) [2025-03-15 01:38:57,190 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 26 remaining) [2025-03-15 01:38:57,190 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:38:57,199 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:38:57,200 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:38:57,209 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:38:57 BasicIcfg [2025-03-15 01:38:57,209 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:38:57,210 INFO L158 Benchmark]: Toolchain (without parser) took 855755.69ms. Allocated memory was 71.3MB in the beginning and 490.7MB in the end (delta: 419.4MB). Free memory was 43.2MB in the beginning and 229.4MB in the end (delta: -186.2MB). Peak memory consumption was 230.0MB. Max. memory is 8.0GB. [2025-03-15 01:38:57,210 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:38:57,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.06ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 37.0MB in the end (delta: 6.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2025-03-15 01:38:57,210 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:38:57,210 INFO L158 Benchmark]: Boogie Preprocessor took 42.64ms. Allocated memory is still 71.3MB. Free memory was 34.1MB in the beginning and 32.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:38:57,211 INFO L158 Benchmark]: RCFGBuilder took 489.49ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 31.4MB in the end (delta: 821.8kB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. [2025-03-15 01:38:57,211 INFO L158 Benchmark]: TraceAbstraction took 854674.01ms. Allocated memory was 71.3MB in the beginning and 490.7MB in the end (delta: 419.4MB). Free memory was 30.3MB in the beginning and 229.4MB in the end (delta: -199.1MB). Peak memory consumption was 218.9MB. Max. memory is 8.0GB. [2025-03-15 01:38:57,211 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.15ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 506.06ms. Allocated memory is still 71.3MB. Free memory was 43.0MB in the beginning and 37.0MB in the end (delta: 6.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 71.3MB. Free memory was 37.0MB in the beginning and 34.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 42.64ms. Allocated memory is still 71.3MB. Free memory was 34.1MB in the beginning and 32.2MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 489.49ms. Allocated memory is still 71.3MB. Free memory was 32.2MB in the beginning and 31.4MB in the end (delta: 821.8kB). Peak memory consumption was 19.8MB. Max. memory is 8.0GB. * TraceAbstraction took 854674.01ms. Allocated memory was 71.3MB in the beginning and 490.7MB in the end (delta: 419.4MB). Free memory was 30.3MB in the beginning and 229.4MB in the end (delta: -199.1MB). Peak memory consumption was 218.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 981]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 988]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1029]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 996]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1002]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 433 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 854.5s, OverallIterations: 18, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 698.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 112 mSolverCounterUnknown, 7549 SdHoareTripleChecker+Valid, 257.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7549 mSDsluCounter, 3984 SdHoareTripleChecker+Invalid, 254.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8041 IncrementalHoareTripleChecker+Unchecked, 3552 mSDsCounter, 488 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 21063 IncrementalHoareTripleChecker+Invalid, 29705 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 488 mSolverCounterUnsat, 432 mSDtfsCounter, 21063 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3166 GetRequests, 2363 SyntacticMatches, 82 SemanticMatches, 721 ConstructedPredicates, 28 IntricatePredicates, 0 DeprecatedPredicates, 22561 ImplicationChecksByTransitivity, 541.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33251occurred in iteration=14, InterpolantAutomatonStates: 283, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 152.4s InterpolantComputationTime, 4417 NumberOfCodeBlocks, 4417 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 5476 ConstructedInterpolants, 436 QuantifiedInterpolants, 97919 SizeOfPredicates, 171 NumberOfNonLiveVariables, 3114 ConjunctsInSsa, 320 ConjunctsInUnsatCore, 32 InterpolantComputations, 12 PerfectInterpolantSequences, 105/491 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown