/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/triangular-longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:27:03,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:27:03,321 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:27:03,358 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:27:03,358 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:27:03,358 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:27:03,359 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:27:03,359 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:27:03,359 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:27:03,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:27:03,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:27:03,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:27:03,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:27:03,361 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:27:03,361 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:27:03,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:27:03,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:27:03,600 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:27:03,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:27:03,603 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:27:03,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-03-15 01:27:04,762 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23df58442/cfc5410e08ea4c82bb976b011bb71625/FLAG08f94867a [2025-03-15 01:27:04,980 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:27:04,980 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/triangular-longest-2.i [2025-03-15 01:27:04,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23df58442/cfc5410e08ea4c82bb976b011bb71625/FLAG08f94867a [2025-03-15 01:27:05,329 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23df58442/cfc5410e08ea4c82bb976b011bb71625 [2025-03-15 01:27:05,330 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:27:05,331 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:27:05,332 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:27:05,332 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:27:05,335 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:27:05,336 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,336 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a508f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05, skipping insertion in model container [2025-03-15 01:27:05,336 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,358 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:27:05,594 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:27:05,602 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:27:05,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:27:05,661 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:27:05,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05 WrapperNode [2025-03-15 01:27:05,661 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:27:05,662 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:27:05,662 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:27:05,662 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:27:05,666 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:27:05" (1/1) ... [2025-03-15 01:27:05,677 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:27:05" (1/1) ... [2025-03-15 01:27:05,693 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-15 01:27:05,693 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:27:05,694 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:27:05,694 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:27:05,694 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:27:05,698 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,709 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,718 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:27:05,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:27:05,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:27:05,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:27:05,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (1/1) ... [2025-03-15 01:27:05,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:27:05,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:05,743 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:27:05,745 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:27:05,769 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-15 01:27:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-15 01:27:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:27:05,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:27:05,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:27:05,771 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:27:05,850 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:27:05,852 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:27:05,958 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:27:05,958 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:27:05,981 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:27:05,981 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:27:05,982 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:27:05 BoogieIcfgContainer [2025-03-15 01:27:05,982 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:27:05,984 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:27:05,984 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:27:05,987 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:27:05,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:27:05" (1/3) ... [2025-03-15 01:27:05,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268ef4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:27:05, skipping insertion in model container [2025-03-15 01:27:05,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:27:05" (2/3) ... [2025-03-15 01:27:05,988 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@268ef4c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:27:05, skipping insertion in model container [2025-03-15 01:27:05,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:27:05" (3/3) ... [2025-03-15 01:27:05,989 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longest-2.i [2025-03-15 01:27:05,999 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:27:06,000 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longest-2.i that has 3 procedures, 74 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 01:27:06,000 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:27:06,054 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:27:06,083 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:27:06,098 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;@48f27a34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:27:06,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 01:27:06,125 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:27:06,126 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-15 01:27:06,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:27:06,127 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:06,128 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] [2025-03-15 01:27:06,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:06,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:06,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772315, now seen corresponding path program 1 times [2025-03-15 01:27:06,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:06,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777907967] [2025-03-15 01:27:06,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:06,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:06,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:06,347 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:27:06,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:06,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777907967] [2025-03-15 01:27:06,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777907967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:06,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:06,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:27:06,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232597510] [2025-03-15 01:27:06,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:06,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:27:06,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:06,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:27:06,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:27:06,376 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:27:06,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 77 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:06,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:27:06,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:06,498 INFO L124 PetriNetUnfolderBase]: 90/374 cut-off events. [2025-03-15 01:27:06,498 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:27:06,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 374 events. 90/374 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2147 event pairs, 23 based on Foata normal form. 44/301 useless extension candidates. Maximal degree in co-relation 497. Up to 69 conditions per place. [2025-03-15 01:27:06,505 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 13 selfloop transitions, 3 changer transitions 0/77 dead transitions. [2025-03-15 01:27:06,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 192 flow [2025-03-15 01:27:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:27:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:27:06,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2025-03-15 01:27:06,514 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.922077922077922 [2025-03-15 01:27:06,519 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, -2 predicate places. [2025-03-15 01:27:06,519 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 192 flow [2025-03-15 01:27:06,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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,520 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:06,520 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] [2025-03-15 01:27:06,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:27:06,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:06,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1860772316, now seen corresponding path program 1 times [2025-03-15 01:27:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:06,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535929738] [2025-03-15 01:27:06,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:06,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:06,581 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:27:06,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:06,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535929738] [2025-03-15 01:27:06,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535929738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:06,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:06,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:27:06,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529990998] [2025-03-15 01:27:06,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:06,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:27:06,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:06,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:27:06,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:27:06,584 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:27:06,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:06,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:27:06,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:06,656 INFO L124 PetriNetUnfolderBase]: 75/359 cut-off events. [2025-03-15 01:27:06,656 INFO L125 PetriNetUnfolderBase]: For 33/55 co-relation queries the response was YES. [2025-03-15 01:27:06,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 359 events. 75/359 cut-off events. For 33/55 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1874 event pairs, 10 based on Foata normal form. 6/261 useless extension candidates. Maximal degree in co-relation 591. Up to 76 conditions per place. [2025-03-15 01:27:06,661 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 19 selfloop transitions, 4 changer transitions 0/84 dead transitions. [2025-03-15 01:27:06,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 84 transitions, 266 flow [2025-03-15 01:27:06,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:27:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:27:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2025-03-15 01:27:06,663 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9004329004329005 [2025-03-15 01:27:06,664 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 0 predicate places. [2025-03-15 01:27:06,664 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 84 transitions, 266 flow [2025-03-15 01:27:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 3 states have internal predecessors, (195), 0 states have call successors, (0), 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,664 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:06,664 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] [2025-03-15 01:27:06,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:27:06,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:06,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1495807743, now seen corresponding path program 1 times [2025-03-15 01:27:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300897483] [2025-03-15 01:27:06,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:06,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:06,763 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:27:06,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:06,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300897483] [2025-03-15 01:27:06,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300897483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:06,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:06,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:06,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421281658] [2025-03-15 01:27:06,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:06,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:06,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:06,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:06,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:06,768 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:06,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 84 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:06,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:06,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:06,946 INFO L124 PetriNetUnfolderBase]: 322/937 cut-off events. [2025-03-15 01:27:06,946 INFO L125 PetriNetUnfolderBase]: For 426/565 co-relation queries the response was YES. [2025-03-15 01:27:06,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2346 conditions, 937 events. 322/937 cut-off events. For 426/565 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6795 event pairs, 122 based on Foata normal form. 4/604 useless extension candidates. Maximal degree in co-relation 2315. Up to 350 conditions per place. [2025-03-15 01:27:06,958 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 62 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-03-15 01:27:06,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 605 flow [2025-03-15 01:27:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:06,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:06,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 318 transitions. [2025-03-15 01:27:06,960 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.825974025974026 [2025-03-15 01:27:06,960 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 4 predicate places. [2025-03-15 01:27:06,960 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 121 transitions, 605 flow [2025-03-15 01:27:06,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 0 states have call successors, (0), 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,961 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:06,961 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] [2025-03-15 01:27:06,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:27:06,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:06,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875667, now seen corresponding path program 1 times [2025-03-15 01:27:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:06,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852434090] [2025-03-15 01:27:06,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,004 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:27:07,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:07,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852434090] [2025-03-15 01:27:07,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852434090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:07,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:07,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:27:07,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011620045] [2025-03-15 01:27:07,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:07,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:27:07,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:07,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:27:07,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:27:07,006 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:27:07,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 121 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:07,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:07,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:27:07,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:07,143 INFO L124 PetriNetUnfolderBase]: 481/1386 cut-off events. [2025-03-15 01:27:07,144 INFO L125 PetriNetUnfolderBase]: For 1262/1491 co-relation queries the response was YES. [2025-03-15 01:27:07,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3947 conditions, 1386 events. 481/1386 cut-off events. For 1262/1491 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 11433 event pairs, 89 based on Foata normal form. 15/939 useless extension candidates. Maximal degree in co-relation 3913. Up to 546 conditions per place. [2025-03-15 01:27:07,170 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:27:07,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 134 transitions, 837 flow [2025-03-15 01:27:07,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:27:07,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:27:07,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-15 01:27:07,171 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-03-15 01:27:07,173 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 6 predicate places. [2025-03-15 01:27:07,173 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 134 transitions, 837 flow [2025-03-15 01:27:07,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:07,174 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:07,174 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] [2025-03-15 01:27:07,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:27:07,174 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:07,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:07,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1676875666, now seen corresponding path program 1 times [2025-03-15 01:27:07,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691655957] [2025-03-15 01:27:07,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,236 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:27:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691655957] [2025-03-15 01:27:07,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691655957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:07,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:07,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 01:27:07,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864142858] [2025-03-15 01:27:07,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:07,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:27:07,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:27:07,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:27:07,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 77 [2025-03-15 01:27:07,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 134 transitions, 837 flow. Second operand has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:07,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:07,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 77 [2025-03-15 01:27:07,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:07,372 INFO L124 PetriNetUnfolderBase]: 482/1292 cut-off events. [2025-03-15 01:27:07,372 INFO L125 PetriNetUnfolderBase]: For 1928/2239 co-relation queries the response was YES. [2025-03-15 01:27:07,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4266 conditions, 1292 events. 482/1292 cut-off events. For 1928/2239 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 9783 event pairs, 110 based on Foata normal form. 12/870 useless extension candidates. Maximal degree in co-relation 4229. Up to 633 conditions per place. [2025-03-15 01:27:07,381 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 49 selfloop transitions, 15 changer transitions 0/134 dead transitions. [2025-03-15 01:27:07,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 134 transitions, 953 flow [2025-03-15 01:27:07,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:27:07,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:27:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-15 01:27:07,383 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-03-15 01:27:07,383 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 8 predicate places. [2025-03-15 01:27:07,383 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 134 transitions, 953 flow [2025-03-15 01:27:07,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.33333333333333) internal successors, (196), 3 states have internal predecessors, (196), 0 states have call successors, (0), 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:07,384 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:07,384 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] [2025-03-15 01:27:07,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:27:07,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:07,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:07,384 INFO L85 PathProgramCache]: Analyzing trace with hash 864787734, now seen corresponding path program 1 times [2025-03-15 01:27:07,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:07,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215508556] [2025-03-15 01:27:07,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:07,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:07,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,446 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:27:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215508556] [2025-03-15 01:27:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215508556] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283576363] [2025-03-15 01:27:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:07,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:07,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:07,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:07,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 134 transitions, 953 flow. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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:07,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:07,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:07,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:07,682 INFO L124 PetriNetUnfolderBase]: 951/2226 cut-off events. [2025-03-15 01:27:07,682 INFO L125 PetriNetUnfolderBase]: For 7090/7459 co-relation queries the response was YES. [2025-03-15 01:27:07,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9088 conditions, 2226 events. 951/2226 cut-off events. For 7090/7459 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 18426 event pairs, 244 based on Foata normal form. 30/1345 useless extension candidates. Maximal degree in co-relation 9049. Up to 998 conditions per place. [2025-03-15 01:27:07,699 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 92 selfloop transitions, 4 changer transitions 0/160 dead transitions. [2025-03-15 01:27:07,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 160 transitions, 1397 flow [2025-03-15 01:27:07,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:07,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-15 01:27:07,700 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8181818181818182 [2025-03-15 01:27:07,701 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 12 predicate places. [2025-03-15 01:27:07,701 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 160 transitions, 1397 flow [2025-03-15 01:27:07,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 4 states have internal predecessors, (227), 0 states have call successors, (0), 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:07,701 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:07,701 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:07,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:27:07,702 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:07,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:07,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1597002897, now seen corresponding path program 1 times [2025-03-15 01:27:07,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:07,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153619740] [2025-03-15 01:27:07,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:07,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:07,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,764 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:07,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153619740] [2025-03-15 01:27:07,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153619740] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:07,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345054876] [2025-03-15 01:27:07,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:07,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:07,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:07,768 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:27:07,769 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:27:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:07,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:27:07,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:07,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:07,884 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:27:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345054876] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:27:07,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-15 01:27:07,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856183599] [2025-03-15 01:27:07,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:27:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:07,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:27:07,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:27:07,886 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:07,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 160 transitions, 1397 flow. Second operand has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 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:07,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:07,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:07,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:08,101 INFO L124 PetriNetUnfolderBase]: 920/2295 cut-off events. [2025-03-15 01:27:08,102 INFO L125 PetriNetUnfolderBase]: For 8736/9999 co-relation queries the response was YES. [2025-03-15 01:27:08,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10261 conditions, 2295 events. 920/2295 cut-off events. For 8736/9999 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19036 event pairs, 186 based on Foata normal form. 49/1502 useless extension candidates. Maximal degree in co-relation 10220. Up to 1045 conditions per place. [2025-03-15 01:27:08,123 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 103 selfloop transitions, 6 changer transitions 0/173 dead transitions. [2025-03-15 01:27:08,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 173 transitions, 1813 flow [2025-03-15 01:27:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:27:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:27:08,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2025-03-15 01:27:08,124 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.801948051948052 [2025-03-15 01:27:08,125 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 14 predicate places. [2025-03-15 01:27:08,125 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 173 transitions, 1813 flow [2025-03-15 01:27:08,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 57.6) internal successors, (288), 5 states have internal predecessors, (288), 0 states have call successors, (0), 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:08,125 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:08,125 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] [2025-03-15 01:27:08,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:27:08,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:08,330 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:08,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash 88120632, now seen corresponding path program 1 times [2025-03-15 01:27:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:08,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671589502] [2025-03-15 01:27:08,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:08,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:08,373 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:27:08,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:08,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671589502] [2025-03-15 01:27:08,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671589502] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:08,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:08,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:08,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386063653] [2025-03-15 01:27:08,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:08,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:08,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:08,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:08,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:08,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:08,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 173 transitions, 1813 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:08,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:08,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:08,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:08,672 INFO L124 PetriNetUnfolderBase]: 1196/2954 cut-off events. [2025-03-15 01:27:08,673 INFO L125 PetriNetUnfolderBase]: For 15692/17010 co-relation queries the response was YES. [2025-03-15 01:27:08,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14369 conditions, 2954 events. 1196/2954 cut-off events. For 15692/17010 co-relation queries the response was YES. Maximal size of possible extension queue 260. Compared 25474 event pairs, 221 based on Foata normal form. 8/1914 useless extension candidates. Maximal degree in co-relation 14324. Up to 1567 conditions per place. [2025-03-15 01:27:08,698 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 89 selfloop transitions, 44 changer transitions 0/203 dead transitions. [2025-03-15 01:27:08,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 203 transitions, 2469 flow [2025-03-15 01:27:08,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:08,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:08,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 341 transitions. [2025-03-15 01:27:08,700 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8857142857142857 [2025-03-15 01:27:08,700 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 18 predicate places. [2025-03-15 01:27:08,700 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 203 transitions, 2469 flow [2025-03-15 01:27:08,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:08,700 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:08,701 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] [2025-03-15 01:27:08,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:27:08,701 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:08,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:08,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1521756979, now seen corresponding path program 1 times [2025-03-15 01:27:08,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:08,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919208647] [2025-03-15 01:27:08,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:08,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:08,731 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:27:08,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:08,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919208647] [2025-03-15 01:27:08,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919208647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:08,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:08,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:08,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763036727] [2025-03-15 01:27:08,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:08,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:08,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:08,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:08,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:08,732 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:08,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 203 transitions, 2469 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:08,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:08,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:08,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:08,967 INFO L124 PetriNetUnfolderBase]: 1125/2943 cut-off events. [2025-03-15 01:27:08,967 INFO L125 PetriNetUnfolderBase]: For 26303/27999 co-relation queries the response was YES. [2025-03-15 01:27:08,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15324 conditions, 2943 events. 1125/2943 cut-off events. For 26303/27999 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 26108 event pairs, 262 based on Foata normal form. 17/1981 useless extension candidates. Maximal degree in co-relation 15275. Up to 1522 conditions per place. [2025-03-15 01:27:09,013 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 118 selfloop transitions, 26 changer transitions 0/214 dead transitions. [2025-03-15 01:27:09,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 214 transitions, 2825 flow [2025-03-15 01:27:09,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:09,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:09,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 342 transitions. [2025-03-15 01:27:09,016 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8883116883116883 [2025-03-15 01:27:09,016 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:27:09,016 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 214 transitions, 2825 flow [2025-03-15 01:27:09,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:09,017 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:09,017 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] [2025-03-15 01:27:09,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:27:09,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:09,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:09,017 INFO L85 PathProgramCache]: Analyzing trace with hash 499182071, now seen corresponding path program 1 times [2025-03-15 01:27:09,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:09,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042137180] [2025-03-15 01:27:09,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:09,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:09,060 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:27:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:09,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042137180] [2025-03-15 01:27:09,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042137180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:09,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:09,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847401078] [2025-03-15 01:27:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:09,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:09,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:09,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:09,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:09,062 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:09,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 214 transitions, 2825 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:09,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:09,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:09,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:09,312 INFO L124 PetriNetUnfolderBase]: 949/2572 cut-off events. [2025-03-15 01:27:09,312 INFO L125 PetriNetUnfolderBase]: For 35134/37087 co-relation queries the response was YES. [2025-03-15 01:27:09,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13991 conditions, 2572 events. 949/2572 cut-off events. For 35134/37087 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 22199 event pairs, 211 based on Foata normal form. 8/1824 useless extension candidates. Maximal degree in co-relation 13938. Up to 1240 conditions per place. [2025-03-15 01:27:09,340 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 110 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-15 01:27:09,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 182 transitions, 2499 flow [2025-03-15 01:27:09,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:27:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:27:09,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2025-03-15 01:27:09,342 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8441558441558441 [2025-03-15 01:27:09,342 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 22 predicate places. [2025-03-15 01:27:09,342 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 182 transitions, 2499 flow [2025-03-15 01:27:09,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:09,343 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:09,343 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] [2025-03-15 01:27:09,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:27:09,343 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:09,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:09,343 INFO L85 PathProgramCache]: Analyzing trace with hash 499182072, now seen corresponding path program 1 times [2025-03-15 01:27:09,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:09,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618973587] [2025-03-15 01:27:09,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:09,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:09,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:09,398 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:27:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:09,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618973587] [2025-03-15 01:27:09,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618973587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:09,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:09,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012839719] [2025-03-15 01:27:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:09,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:09,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:09,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:09,399 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:09,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 182 transitions, 2499 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:09,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:09,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:09,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:09,661 INFO L124 PetriNetUnfolderBase]: 981/2688 cut-off events. [2025-03-15 01:27:09,662 INFO L125 PetriNetUnfolderBase]: For 45020/46968 co-relation queries the response was YES. [2025-03-15 01:27:09,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15665 conditions, 2688 events. 981/2688 cut-off events. For 45020/46968 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 23214 event pairs, 196 based on Foata normal form. 18/1898 useless extension candidates. Maximal degree in co-relation 15608. Up to 1360 conditions per place. [2025-03-15 01:27:09,691 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 105 selfloop transitions, 15 changer transitions 0/190 dead transitions. [2025-03-15 01:27:09,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 190 transitions, 2895 flow [2025-03-15 01:27:09,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:09,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 336 transitions. [2025-03-15 01:27:09,693 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2025-03-15 01:27:09,693 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 26 predicate places. [2025-03-15 01:27:09,693 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 190 transitions, 2895 flow [2025-03-15 01:27:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 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:09,693 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:09,693 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:09,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:27:09,694 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:09,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:09,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2032517975, now seen corresponding path program 1 times [2025-03-15 01:27:09,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:09,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338616178] [2025-03-15 01:27:09,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:09,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:27:09,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:09,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338616178] [2025-03-15 01:27:09,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338616178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:09,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:09,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:09,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273805594] [2025-03-15 01:27:09,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:09,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:09,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:09,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:09,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:09,731 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:09,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 190 transitions, 2895 flow. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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:09,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:09,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:09,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:09,943 INFO L124 PetriNetUnfolderBase]: 974/2466 cut-off events. [2025-03-15 01:27:09,943 INFO L125 PetriNetUnfolderBase]: For 57344/64031 co-relation queries the response was YES. [2025-03-15 01:27:09,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16686 conditions, 2466 events. 974/2466 cut-off events. For 57344/64031 co-relation queries the response was YES. Maximal size of possible extension queue 243. Compared 20963 event pairs, 135 based on Foata normal form. 496/2238 useless extension candidates. Maximal degree in co-relation 16627. Up to 1326 conditions per place. [2025-03-15 01:27:09,966 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 120 selfloop transitions, 8 changer transitions 0/207 dead transitions. [2025-03-15 01:27:09,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 207 transitions, 3583 flow [2025-03-15 01:27:09,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:09,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 301 transitions. [2025-03-15 01:27:09,968 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-03-15 01:27:09,969 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 29 predicate places. [2025-03-15 01:27:09,969 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 207 transitions, 3583 flow [2025-03-15 01:27:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 4 states have internal predecessors, (234), 0 states have call successors, (0), 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:09,970 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:09,970 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:09,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:27:09,970 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1888720087, now seen corresponding path program 1 times [2025-03-15 01:27:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865833954] [2025-03-15 01:27:09,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:10,030 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:10,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865833954] [2025-03-15 01:27:10,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865833954] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:10,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492156441] [2025-03-15 01:27:10,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:10,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:10,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:10,033 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:27:10,036 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:27:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:10,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:27:10,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:10,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:10,115 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:27:10,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492156441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:10,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:27:10,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:27:10,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026619291] [2025-03-15 01:27:10,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:10,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:27:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:10,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:27:10,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:27:10,116 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:10,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 207 transitions, 3583 flow. Second operand has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 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:10,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:10,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:10,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:10,403 INFO L124 PetriNetUnfolderBase]: 889/2559 cut-off events. [2025-03-15 01:27:10,403 INFO L125 PetriNetUnfolderBase]: For 41390/44817 co-relation queries the response was YES. [2025-03-15 01:27:10,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17326 conditions, 2559 events. 889/2559 cut-off events. For 41390/44817 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 22255 event pairs, 88 based on Foata normal form. 146/2109 useless extension candidates. Maximal degree in co-relation 17265. Up to 1263 conditions per place. [2025-03-15 01:27:10,424 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 138 selfloop transitions, 7 changer transitions 0/222 dead transitions. [2025-03-15 01:27:10,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 4285 flow [2025-03-15 01:27:10,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:27:10,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:27:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2025-03-15 01:27:10,426 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2025-03-15 01:27:10,427 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 34 predicate places. [2025-03-15 01:27:10,427 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 222 transitions, 4285 flow [2025-03-15 01:27:10,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.333333333333336) internal successors, (344), 6 states have internal predecessors, (344), 0 states have call successors, (0), 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:10,428 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:10,428 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:10,434 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:27:10,632 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,SelfDestructingSolverStorable12 [2025-03-15 01:27:10,632 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:10,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1579219694, now seen corresponding path program 1 times [2025-03-15 01:27:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450487249] [2025-03-15 01:27:10,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:10,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:10,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:27:10,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:10,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450487249] [2025-03-15 01:27:10,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450487249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:10,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:10,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:10,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271119091] [2025-03-15 01:27:10,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:10,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:10,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:10,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:10,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:10,671 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:10,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 222 transitions, 4285 flow. Second operand has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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:10,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:10,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:10,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:10,886 INFO L124 PetriNetUnfolderBase]: 921/2363 cut-off events. [2025-03-15 01:27:10,886 INFO L125 PetriNetUnfolderBase]: For 46690/51418 co-relation queries the response was YES. [2025-03-15 01:27:10,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18686 conditions, 2363 events. 921/2363 cut-off events. For 46690/51418 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 19637 event pairs, 76 based on Foata normal form. 257/2075 useless extension candidates. Maximal degree in co-relation 18623. Up to 1128 conditions per place. [2025-03-15 01:27:10,911 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 152 selfloop transitions, 8 changer transitions 0/237 dead transitions. [2025-03-15 01:27:10,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 237 transitions, 5047 flow [2025-03-15 01:27:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 298 transitions. [2025-03-15 01:27:10,913 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7740259740259741 [2025-03-15 01:27:10,913 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 37 predicate places. [2025-03-15 01:27:10,913 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 237 transitions, 5047 flow [2025-03-15 01:27:10,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.75) internal successors, (235), 4 states have internal predecessors, (235), 0 states have call successors, (0), 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:10,913 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:10,913 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:27:10,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:27:10,914 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:10,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:10,914 INFO L85 PathProgramCache]: Analyzing trace with hash -3217232, now seen corresponding path program 1 times [2025-03-15 01:27:10,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:10,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550958431] [2025-03-15 01:27:10,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:10,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:10,960 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:27:10,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:10,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550958431] [2025-03-15 01:27:10,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550958431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:10,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:10,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:27:10,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632103080] [2025-03-15 01:27:10,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:10,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:27:10,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:10,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:27:10,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:27:10,962 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:10,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 237 transitions, 5047 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 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:10,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:10,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:10,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:11,174 INFO L124 PetriNetUnfolderBase]: 881/2356 cut-off events. [2025-03-15 01:27:11,174 INFO L125 PetriNetUnfolderBase]: For 57035/61210 co-relation queries the response was YES. [2025-03-15 01:27:11,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19303 conditions, 2356 events. 881/2356 cut-off events. For 57035/61210 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 19212 event pairs, 37 based on Foata normal form. 30/1901 useless extension candidates. Maximal degree in co-relation 19236. Up to 1179 conditions per place. [2025-03-15 01:27:11,198 INFO L140 encePairwiseOnDemand]: 72/77 looper letters, 135 selfloop transitions, 41 changer transitions 0/243 dead transitions. [2025-03-15 01:27:11,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 243 transitions, 5547 flow [2025-03-15 01:27:11,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:27:11,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:27:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 397 transitions. [2025-03-15 01:27:11,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8593073593073594 [2025-03-15 01:27:11,200 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 42 predicate places. [2025-03-15 01:27:11,200 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 243 transitions, 5547 flow [2025-03-15 01:27:11,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 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:11,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:11,200 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 01:27:11,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:27:11,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:11,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:11,201 INFO L85 PathProgramCache]: Analyzing trace with hash 805236833, now seen corresponding path program 1 times [2025-03-15 01:27:11,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:11,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584964959] [2025-03-15 01:27:11,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:11,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:11,241 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:27:11,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:11,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584964959] [2025-03-15 01:27:11,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584964959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:11,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:11,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:27:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167157186] [2025-03-15 01:27:11,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:11,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:27:11,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:11,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:27:11,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:27:11,243 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:11,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 243 transitions, 5547 flow. Second operand has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 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:11,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:11,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:11,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:11,456 INFO L124 PetriNetUnfolderBase]: 860/2304 cut-off events. [2025-03-15 01:27:11,456 INFO L125 PetriNetUnfolderBase]: For 68274/71982 co-relation queries the response was YES. [2025-03-15 01:27:11,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19868 conditions, 2304 events. 860/2304 cut-off events. For 68274/71982 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 18299 event pairs, 51 based on Foata normal form. 30/1879 useless extension candidates. Maximal degree in co-relation 19797. Up to 1176 conditions per place. [2025-03-15 01:27:11,481 INFO L140 encePairwiseOnDemand]: 73/77 looper letters, 156 selfloop transitions, 26 changer transitions 0/249 dead transitions. [2025-03-15 01:27:11,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 249 transitions, 6071 flow [2025-03-15 01:27:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:27:11,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:27:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 402 transitions. [2025-03-15 01:27:11,482 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8701298701298701 [2025-03-15 01:27:11,483 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 47 predicate places. [2025-03-15 01:27:11,483 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 249 transitions, 6071 flow [2025-03-15 01:27:11,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 63.4) internal successors, (317), 5 states have internal predecessors, (317), 0 states have call successors, (0), 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:11,483 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:11,483 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:11,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:27:11,483 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:11,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:11,483 INFO L85 PathProgramCache]: Analyzing trace with hash 218778133, now seen corresponding path program 1 times [2025-03-15 01:27:11,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086941396] [2025-03-15 01:27:11,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:11,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:11,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:11,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:11,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086941396] [2025-03-15 01:27:11,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086941396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:11,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [674486437] [2025-03-15 01:27:11,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:11,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:11,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:11,591 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:11,592 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:11,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:11,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:27:11,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:11,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [674486437] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:11,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 01:27:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330390919] [2025-03-15 01:27:11,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:27:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:27:11,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:27:11,766 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:11,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 249 transitions, 6071 flow. Second operand has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 0 states have call successors, (0), 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:11,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:11,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:11,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:12,224 INFO L124 PetriNetUnfolderBase]: 1377/3784 cut-off events. [2025-03-15 01:27:12,224 INFO L125 PetriNetUnfolderBase]: For 141407/149185 co-relation queries the response was YES. [2025-03-15 01:27:12,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33157 conditions, 3784 events. 1377/3784 cut-off events. For 141407/149185 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 29243 event pairs, 105 based on Foata normal form. 27/3135 useless extension candidates. Maximal degree in co-relation 33082. Up to 2022 conditions per place. [2025-03-15 01:27:12,266 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 186 selfloop transitions, 103 changer transitions 1/357 dead transitions. [2025-03-15 01:27:12,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 357 transitions, 10035 flow [2025-03-15 01:27:12,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:27:12,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:27:12,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 735 transitions. [2025-03-15 01:27:12,268 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-03-15 01:27:12,269 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 57 predicate places. [2025-03-15 01:27:12,269 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 357 transitions, 10035 flow [2025-03-15 01:27:12,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.5) internal successors, (635), 10 states have internal predecessors, (635), 0 states have call successors, (0), 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:12,269 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:12,269 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:12,275 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:12,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:12,470 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:12,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1876450317, now seen corresponding path program 1 times [2025-03-15 01:27:12,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:12,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160414922] [2025-03-15 01:27:12,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:12,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:12,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:12,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160414922] [2025-03-15 01:27:12,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160414922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:12,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814338098] [2025-03-15 01:27:12,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:12,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:12,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:12,570 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:12,571 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:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:12,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 01:27:12,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:12,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:12,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814338098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:12,933 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:12,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-15 01:27:12,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393622470] [2025-03-15 01:27:12,933 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:12,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:27:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:12,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:27:12,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:27:12,935 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:12,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 357 transitions, 10035 flow. Second operand has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 0 states have call successors, (0), 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:12,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:12,936 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:12,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:13,878 INFO L124 PetriNetUnfolderBase]: 2024/5304 cut-off events. [2025-03-15 01:27:13,879 INFO L125 PetriNetUnfolderBase]: For 281866/295627 co-relation queries the response was YES. [2025-03-15 01:27:13,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50248 conditions, 5304 events. 2024/5304 cut-off events. For 281866/295627 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 38314 event pairs, 108 based on Foata normal form. 27/4462 useless extension candidates. Maximal degree in co-relation 50169. Up to 3031 conditions per place. [2025-03-15 01:27:13,929 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 264 selfloop transitions, 171 changer transitions 4/506 dead transitions. [2025-03-15 01:27:13,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 506 transitions, 15877 flow [2025-03-15 01:27:13,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-15 01:27:13,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-15 01:27:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1333 transitions. [2025-03-15 01:27:13,932 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8655844155844156 [2025-03-15 01:27:13,932 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 76 predicate places. [2025-03-15 01:27:13,932 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 506 transitions, 15877 flow [2025-03-15 01:27:13,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 63.333333333333336) internal successors, (1140), 18 states have internal predecessors, (1140), 0 states have call successors, (0), 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:13,932 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:13,933 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 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:13,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 01:27:14,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 01:27:14,137 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:14,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:14,137 INFO L85 PathProgramCache]: Analyzing trace with hash 548101196, now seen corresponding path program 2 times [2025-03-15 01:27:14,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:14,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420686305] [2025-03-15 01:27:14,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:14,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:14,161 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:14,161 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:14,394 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:14,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420686305] [2025-03-15 01:27:14,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420686305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:14,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564066491] [2025-03-15 01:27:14,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:14,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:14,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:14,397 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:27:14,399 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:27:14,457 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:14,457 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:14,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-15 01:27:14,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:14,593 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564066491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:14,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2025-03-15 01:27:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773792758] [2025-03-15 01:27:14,894 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 01:27:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 01:27:14,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=631, Unknown=0, NotChecked=0, Total=870 [2025-03-15 01:27:14,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:14,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 506 transitions, 15877 flow. Second operand has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 0 states have call successors, (0), 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:14,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:14,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:14,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:16,887 INFO L124 PetriNetUnfolderBase]: 3528/9400 cut-off events. [2025-03-15 01:27:16,887 INFO L125 PetriNetUnfolderBase]: For 585211/611603 co-relation queries the response was YES. [2025-03-15 01:27:16,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91691 conditions, 9400 events. 3528/9400 cut-off events. For 585211/611603 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 67845 event pairs, 276 based on Foata normal form. 27/7914 useless extension candidates. Maximal degree in co-relation 91608. Up to 5580 conditions per place. [2025-03-15 01:27:16,987 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 450 selfloop transitions, 301 changer transitions 0/818 dead transitions. [2025-03-15 01:27:16,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 818 transitions, 28403 flow [2025-03-15 01:27:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:27:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:27:16,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 2059 transitions. [2025-03-15 01:27:16,990 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8625890238793464 [2025-03-15 01:27:16,991 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 106 predicate places. [2025-03-15 01:27:16,991 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 818 transitions, 28403 flow [2025-03-15 01:27:16,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 63.166666666666664) internal successors, (1895), 30 states have internal predecessors, (1895), 0 states have call successors, (0), 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:16,991 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:16,992 INFO L221 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 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:16,997 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 01:27:17,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:17,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:17,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:17,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1601333667, now seen corresponding path program 2 times [2025-03-15 01:27:17,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:17,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092087941] [2025-03-15 01:27:17,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:17,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:17,226 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:17,226 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:17,862 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:17,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092087941] [2025-03-15 01:27:17,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092087941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:17,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670379210] [2025-03-15 01:27:17,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:27:17,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:17,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:17,865 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:27:17,866 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:27:17,942 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 01:27:17,942 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:17,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-15 01:27:17,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:18,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:27:19,086 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 0 proven. 597 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:19,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670379210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:27:19,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:27:19,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29, 29] total 57 [2025-03-15 01:27:19,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274837643] [2025-03-15 01:27:19,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:27:19,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-15 01:27:19,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:19,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-15 01:27:19,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=2437, Unknown=0, NotChecked=0, Total=3306 [2025-03-15 01:27:19,091 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 77 [2025-03-15 01:27:19,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 818 transitions, 28403 flow. Second operand has 58 states, 58 states have (on average 63.10344827586207) internal successors, (3660), 58 states have internal predecessors, (3660), 0 states have call successors, (0), 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:19,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:19,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 77 [2025-03-15 01:27:19,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:24,313 INFO L124 PetriNetUnfolderBase]: 6397/16505 cut-off events. [2025-03-15 01:27:24,314 INFO L125 PetriNetUnfolderBase]: For 1254706/1307146 co-relation queries the response was YES. [2025-03-15 01:27:24,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171614 conditions, 16505 events. 6397/16505 cut-off events. For 1254706/1307146 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 118589 event pairs, 474 based on Foata normal form. 33/13812 useless extension candidates. Maximal degree in co-relation 171527. Up to 10213 conditions per place. [2025-03-15 01:27:24,503 INFO L140 encePairwiseOnDemand]: 71/77 looper letters, 825 selfloop transitions, 572 changer transitions 2/1466 dead transitions. [2025-03-15 01:27:24,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 1466 transitions, 55393 flow [2025-03-15 01:27:24,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-03-15 01:27:24,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-03-15 01:27:24,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 3988 transitions. [2025-03-15 01:27:24,509 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8632034632034632 [2025-03-15 01:27:24,510 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 165 predicate places. [2025-03-15 01:27:24,510 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 1466 transitions, 55393 flow [2025-03-15 01:27:24,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 63.10344827586207) internal successors, (3660), 58 states have internal predecessors, (3660), 0 states have call successors, (0), 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,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:24,512 INFO L221 CegarLoopForPetriNet]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 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:24,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-15 01:27:24,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:24,716 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 16 more)] === [2025-03-15 01:27:24,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:24,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1501136954, now seen corresponding path program 3 times [2025-03-15 01:27:24,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:24,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543588858] [2025-03-15 01:27:24,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:24,800 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-15 01:27:24,801 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:26,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2792 backedges. 0 proven. 2792 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:26,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543588858] [2025-03-15 01:27:26,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543588858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:27:26,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196638300] [2025-03-15 01:27:26,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:27:26,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:27:26,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:27:26,808 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:27:26,809 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:27:26,915 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-15 01:27:26,915 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:27:26,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-03-15 01:27:26,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:27:28,514 INFO L134 CoverageAnalysis]: Checked inductivity of 2792 backedges. 2786 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-15 01:27:28,514 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:27:28,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196638300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:28,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:27:28,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [55] total 107 [2025-03-15 01:27:28,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999833049] [2025-03-15 01:27:28,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:28,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-15 01:27:28,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:28,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-15 01:27:28,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1538, Invalid=9804, Unknown=0, NotChecked=0, Total=11342 [2025-03-15 01:27:28,519 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 77 [2025-03-15 01:27:28,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 1466 transitions, 55393 flow. Second operand has 53 states, 53 states have (on average 59.0) internal successors, (3127), 53 states have internal predecessors, (3127), 0 states have call successors, (0), 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:28,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:28,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 77 [2025-03-15 01:27:28,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:21,785 INFO L124 PetriNetUnfolderBase]: 46823/116445 cut-off events. [2025-03-15 01:28:21,785 INFO L125 PetriNetUnfolderBase]: For 7619578/7929286 co-relation queries the response was YES. [2025-03-15 01:28:23,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1238162 conditions, 116445 events. 46823/116445 cut-off events. For 7619578/7929286 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 1284116 event pairs, 2745 based on Foata normal form. 20692/117965 useless extension candidates. Maximal degree in co-relation 1238073. Up to 83508 conditions per place. [2025-03-15 01:28:23,385 INFO L140 encePairwiseOnDemand]: 70/77 looper letters, 0 selfloop transitions, 0 changer transitions 7736/7736 dead transitions. [2025-03-15 01:28:23,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 7736 transitions, 330507 flow [2025-03-15 01:28:23,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-15 01:28:23,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-15 01:28:23,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 3692 transitions. [2025-03-15 01:28:23,388 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7610801896516183 [2025-03-15 01:28:23,389 INFO L298 CegarLoopForPetriNet]: 80 programPoint places, 212 predicate places. [2025-03-15 01:28:23,389 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 7736 transitions, 330507 flow [2025-03-15 01:28:23,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 59.0) internal successors, (3127), 53 states have internal predecessors, (3127), 0 states have call successors, (0), 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:28:23,394 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/triangular-longest-2.i_petrified1_AllErrorsAtOnce [2025-03-15 01:28:23,418 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 01:28:23,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 01:28:23,426 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:28:23,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:28:23,620 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:28:23,624 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:28:23,624 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:28:23,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:28:23 BasicIcfg [2025-03-15 01:28:23,627 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:28:23,628 INFO L158 Benchmark]: Toolchain (without parser) took 78296.66ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 43.6MB in the beginning and 732.0MB in the end (delta: -688.4MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 01:28:23,628 INFO L158 Benchmark]: CDTParser took 1.16ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:28:23,628 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.55ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 24.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 01:28:23,628 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.00ms. Allocated memory is still 71.3MB. Free memory was 24.4MB in the beginning and 22.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:28:23,628 INFO L158 Benchmark]: Boogie Preprocessor took 24.11ms. Allocated memory is still 71.3MB. Free memory was 22.8MB in the beginning and 21.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:28:23,628 INFO L158 Benchmark]: RCFGBuilder took 263.61ms. Allocated memory is still 71.3MB. Free memory was 21.8MB in the beginning and 34.4MB in the end (delta: -12.6MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. [2025-03-15 01:28:23,629 INFO L158 Benchmark]: TraceAbstraction took 77643.52ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 33.1MB in the beginning and 732.0MB in the end (delta: -698.9MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 01:28:23,629 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 35.2MB in the end (delta: 42.6kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 329.55ms. Allocated memory is still 71.3MB. Free memory was 43.5MB in the beginning and 24.4MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.00ms. Allocated memory is still 71.3MB. Free memory was 24.4MB in the beginning and 22.8MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.11ms. Allocated memory is still 71.3MB. Free memory was 22.8MB in the beginning and 21.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 263.61ms. Allocated memory is still 71.3MB. Free memory was 21.8MB in the beginning and 34.4MB in the end (delta: -12.6MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. * TraceAbstraction took 77643.52ms. Allocated memory was 71.3MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 33.1MB in the beginning and 732.0MB in the end (delta: -698.9MB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 698]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 696]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 706]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 704]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 110 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 77.5s, OverallIterations: 21, TraceHistogramMax: 27, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 67.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1969 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1969 mSDsluCounter, 194 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 118 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2518 IncrementalHoareTripleChecker+Invalid, 2597 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 76 mSDtfsCounter, 2518 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1721 GetRequests, 1307 SyntacticMatches, 0 SemanticMatches, 414 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8777 ImplicationChecksByTransitivity, 5.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330507occurred in iteration=21, InterpolantAutomatonStates: 259, 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.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 2258 NumberOfCodeBlocks, 2258 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 2676 ConstructedInterpolants, 0 QuantifiedInterpolants, 7262 SizeOfPredicates, 105 NumberOfNonLiveVariables, 1765 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 2810/7758 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 - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:28:23,640 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...