/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/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:17:47,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:17:47,392 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 02:17:47,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:17:47,413 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:17:47,413 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:17:47,413 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:17:47,414 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:17:47,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:17:47,415 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:17:47,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:17:47,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:17:47,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:17:47,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:17:47,416 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 02:17:47,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:17:47,667 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:17:47,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:17:47,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:17:47,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:17:47,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 02:17:48,837 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8a7496/afdc9d3838c84509a91b17c262f287b6/FLAGd13b5e046 [2025-03-15 02:17:49,058 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:17:49,059 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 02:17:49,073 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8a7496/afdc9d3838c84509a91b17c262f287b6/FLAGd13b5e046 [2025-03-15 02:17:49,429 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75b8a7496/afdc9d3838c84509a91b17c262f287b6 [2025-03-15 02:17:49,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:17:49,431 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:17:49,432 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:17:49,432 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:17:49,436 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:17:49,436 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,437 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4792eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49, skipping insertion in model container [2025-03-15 02:17:49,437 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,466 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:17:49,674 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:17:49,689 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:17:49,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:17:49,758 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:17:49,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49 WrapperNode [2025-03-15 02:17:49,760 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:17:49,761 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:17:49,761 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:17:49,761 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:17:49,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,776 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,797 INFO L138 Inliner]: procedures = 165, calls = 47, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 196 [2025-03-15 02:17:49,797 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:17:49,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:17:49,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:17:49,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:17:49,804 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,812 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,812 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,830 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:17:49,831 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:17:49,831 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:17:49,831 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:17:49,832 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (1/1) ... [2025-03-15 02:17:49,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:17:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:17:49,883 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 02:17:49,889 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 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 02:17:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 02:17:49,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:17:49,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:17:49,907 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 02:17:50,008 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:17:50,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:17:50,330 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:17:50,330 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:17:50,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:17:50,368 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:17:50,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:17:50 BoogieIcfgContainer [2025-03-15 02:17:50,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:17:50,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:17:50,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:17:50,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:17:50,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:17:49" (1/3) ... [2025-03-15 02:17:50,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269fb2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:17:50, skipping insertion in model container [2025-03-15 02:17:50,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:17:49" (2/3) ... [2025-03-15 02:17:50,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@269fb2a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:17:50, skipping insertion in model container [2025-03-15 02:17:50,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:17:50" (3/3) ... [2025-03-15 02:17:50,380 INFO L128 eAbstractionObserver]: Analyzing ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i [2025-03-15 02:17:50,394 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:17:50,395 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i that has 2 procedures, 227 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-03-15 02:17:50,395 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:17:50,482 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 02:17:50,519 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:17:50,529 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;@10f2514c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:17:50,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-15 02:17:50,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:17:50,568 INFO L124 PetriNetUnfolderBase]: 0/81 cut-off events. [2025-03-15 02:17:50,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:17:50,572 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:50,573 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:50,573 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 61609461, now seen corresponding path program 1 times [2025-03-15 02:17:50,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:50,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718667425] [2025-03-15 02:17:50,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:50,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:50,862 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 02:17:50,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:50,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718667425] [2025-03-15 02:17:50,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718667425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:50,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:50,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:17:50,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230044827] [2025-03-15 02:17:50,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:50,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:17:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:50,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:17:50,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:17:50,892 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-15 02:17:50,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 242 transitions, 488 flow. Second operand has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 02:17:50,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:50,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-15 02:17:50,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:51,264 INFO L124 PetriNetUnfolderBase]: 176/1384 cut-off events. [2025-03-15 02:17:51,264 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 02:17:51,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1728 conditions, 1384 events. 176/1384 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8726 event pairs, 54 based on Foata normal form. 150/1332 useless extension candidates. Maximal degree in co-relation 1675. Up to 176 conditions per place. [2025-03-15 02:17:51,284 INFO L140 encePairwiseOnDemand]: 225/242 looper letters, 41 selfloop transitions, 4 changer transitions 1/233 dead transitions. [2025-03-15 02:17:51,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 233 transitions, 559 flow [2025-03-15 02:17:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:17:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:17:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 842 transitions. [2025-03-15 02:17:51,301 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8698347107438017 [2025-03-15 02:17:51,304 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, -7 predicate places. [2025-03-15 02:17:51,304 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 233 transitions, 559 flow [2025-03-15 02:17:51,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.0) internal successors, (776), 4 states have internal predecessors, (776), 0 states have call successors, (0), 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 02:17:51,304 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:51,304 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:51,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:17:51,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:51,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:51,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1909893829, now seen corresponding path program 1 times [2025-03-15 02:17:51,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:51,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127871325] [2025-03-15 02:17:51,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:51,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:51,428 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 02:17:51,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:51,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127871325] [2025-03-15 02:17:51,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127871325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:51,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:51,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:17:51,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114709102] [2025-03-15 02:17:51,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:51,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:17:51,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:17:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:17:51,433 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-15 02:17:51,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 233 transitions, 559 flow. Second operand has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 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 02:17:51,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:51,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-15 02:17:51,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:51,645 INFO L124 PetriNetUnfolderBase]: 154/776 cut-off events. [2025-03-15 02:17:51,646 INFO L125 PetriNetUnfolderBase]: For 143/533 co-relation queries the response was YES. [2025-03-15 02:17:51,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 776 events. 154/776 cut-off events. For 143/533 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4793 event pairs, 54 based on Foata normal form. 14/710 useless extension candidates. Maximal degree in co-relation 1379. Up to 163 conditions per place. [2025-03-15 02:17:51,654 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 40 selfloop transitions, 4 changer transitions 1/232 dead transitions. [2025-03-15 02:17:51,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 232 transitions, 643 flow [2025-03-15 02:17:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:17:51,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:17:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 813 transitions. [2025-03-15 02:17:51,657 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8398760330578512 [2025-03-15 02:17:51,658 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, -5 predicate places. [2025-03-15 02:17:51,658 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 232 transitions, 643 flow [2025-03-15 02:17:51,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.25) internal successors, (777), 4 states have internal predecessors, (777), 0 states have call successors, (0), 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 02:17:51,658 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:51,659 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:51,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:17:51,659 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:51,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:51,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1972318466, now seen corresponding path program 1 times [2025-03-15 02:17:51,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:51,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064922765] [2025-03-15 02:17:51,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:51,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:51,796 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 02:17:51,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:51,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064922765] [2025-03-15 02:17:51,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064922765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:51,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:51,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:17:51,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793196443] [2025-03-15 02:17:51,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:51,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:17:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:51,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:17:51,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:17:51,799 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 242 [2025-03-15 02:17:51,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 232 transitions, 643 flow. Second operand has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 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 02:17:51,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:51,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 242 [2025-03-15 02:17:51,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:52,068 INFO L124 PetriNetUnfolderBase]: 187/1282 cut-off events. [2025-03-15 02:17:52,068 INFO L125 PetriNetUnfolderBase]: For 445/1046 co-relation queries the response was YES. [2025-03-15 02:17:52,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1282 events. 187/1282 cut-off events. For 445/1046 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8122 event pairs, 66 based on Foata normal form. 14/1129 useless extension candidates. Maximal degree in co-relation 2303. Up to 187 conditions per place. [2025-03-15 02:17:52,076 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 47 selfloop transitions, 6 changer transitions 1/237 dead transitions. [2025-03-15 02:17:52,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 237 transitions, 783 flow [2025-03-15 02:17:52,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:17:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:17:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 994 transitions. [2025-03-15 02:17:52,081 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8214876033057851 [2025-03-15 02:17:52,081 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, -1 predicate places. [2025-03-15 02:17:52,082 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 237 transitions, 783 flow [2025-03-15 02:17:52,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 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 02:17:52,083 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:52,083 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:52,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:17:52,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:52,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:52,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1611248707, now seen corresponding path program 1 times [2025-03-15 02:17:52,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:52,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889470387] [2025-03-15 02:17:52,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:52,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:52,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 02:17:52,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:52,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889470387] [2025-03-15 02:17:52,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889470387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:52,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:52,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:17:52,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120844681] [2025-03-15 02:17:52,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:52,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:17:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:52,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:17:52,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:17:52,245 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 242 [2025-03-15 02:17:52,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 237 transitions, 783 flow. Second operand has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 0 states have call successors, (0), 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 02:17:52,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:52,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 242 [2025-03-15 02:17:52,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:52,548 INFO L124 PetriNetUnfolderBase]: 197/1568 cut-off events. [2025-03-15 02:17:52,548 INFO L125 PetriNetUnfolderBase]: For 996/1581 co-relation queries the response was YES. [2025-03-15 02:17:52,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2993 conditions, 1568 events. 197/1568 cut-off events. For 996/1581 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10370 event pairs, 77 based on Foata normal form. 10/1371 useless extension candidates. Maximal degree in co-relation 2934. Up to 179 conditions per place. [2025-03-15 02:17:52,559 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 65 selfloop transitions, 5 changer transitions 1/252 dead transitions. [2025-03-15 02:17:52,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 252 transitions, 1049 flow [2025-03-15 02:17:52,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:17:52,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:17:52,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 983 transitions. [2025-03-15 02:17:52,562 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.812396694214876 [2025-03-15 02:17:52,564 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 0 predicate places. [2025-03-15 02:17:52,564 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 252 transitions, 1049 flow [2025-03-15 02:17:52,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.2) internal successors, (946), 5 states have internal predecessors, (946), 0 states have call successors, (0), 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 02:17:52,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:52,564 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:52,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:17:52,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:52,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:52,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1407054055, now seen corresponding path program 1 times [2025-03-15 02:17:52,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:52,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37885231] [2025-03-15 02:17:52,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:52,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:52,701 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 02:17:52,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:52,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37885231] [2025-03-15 02:17:52,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37885231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:52,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:52,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:17:52,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540176671] [2025-03-15 02:17:52,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:52,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:17:52,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:52,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:17:52,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:17:52,704 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 242 [2025-03-15 02:17:52,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 252 transitions, 1049 flow. Second operand has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 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 02:17:52,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:52,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 242 [2025-03-15 02:17:52,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:52,949 INFO L124 PetriNetUnfolderBase]: 195/820 cut-off events. [2025-03-15 02:17:52,949 INFO L125 PetriNetUnfolderBase]: For 1686/3352 co-relation queries the response was YES. [2025-03-15 02:17:52,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2676 conditions, 820 events. 195/820 cut-off events. For 1686/3352 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 5376 event pairs, 59 based on Foata normal form. 30/786 useless extension candidates. Maximal degree in co-relation 2610. Up to 187 conditions per place. [2025-03-15 02:17:52,954 INFO L140 encePairwiseOnDemand]: 234/242 looper letters, 75 selfloop transitions, 7 changer transitions 4/264 dead transitions. [2025-03-15 02:17:52,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 264 transitions, 1333 flow [2025-03-15 02:17:52,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:17:52,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:17:52,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1167 transitions. [2025-03-15 02:17:52,956 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8037190082644629 [2025-03-15 02:17:52,957 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 4 predicate places. [2025-03-15 02:17:52,957 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 264 transitions, 1333 flow [2025-03-15 02:17:52,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 186.83333333333334) internal successors, (1121), 6 states have internal predecessors, (1121), 0 states have call successors, (0), 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 02:17:52,958 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:52,958 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:52,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:17:52,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:52,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:52,958 INFO L85 PathProgramCache]: Analyzing trace with hash -669002334, now seen corresponding path program 1 times [2025-03-15 02:17:52,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:52,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938411569] [2025-03-15 02:17:52,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:52,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:53,115 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 02:17:53,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:53,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938411569] [2025-03-15 02:17:53,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938411569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:53,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:53,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:17:53,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613112382] [2025-03-15 02:17:53,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:53,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:17:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:17:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:17:53,119 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 242 [2025-03-15 02:17:53,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 264 transitions, 1333 flow. Second operand has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 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 02:17:53,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:53,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 242 [2025-03-15 02:17:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:53,497 INFO L124 PetriNetUnfolderBase]: 207/1508 cut-off events. [2025-03-15 02:17:53,497 INFO L125 PetriNetUnfolderBase]: For 2826/4437 co-relation queries the response was YES. [2025-03-15 02:17:53,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3697 conditions, 1508 events. 207/1508 cut-off events. For 2826/4437 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9960 event pairs, 72 based on Foata normal form. 21/1340 useless extension candidates. Maximal degree in co-relation 3621. Up to 187 conditions per place. [2025-03-15 02:17:53,504 INFO L140 encePairwiseOnDemand]: 231/242 looper letters, 61 selfloop transitions, 10 changer transitions 25/263 dead transitions. [2025-03-15 02:17:53,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 263 transitions, 1503 flow [2025-03-15 02:17:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:17:53,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:17:53,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1666 transitions. [2025-03-15 02:17:53,507 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7649219467401286 [2025-03-15 02:17:53,508 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 11 predicate places. [2025-03-15 02:17:53,508 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 263 transitions, 1503 flow [2025-03-15 02:17:53,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.0) internal successors, (1440), 8 states have internal predecessors, (1440), 0 states have call successors, (0), 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 02:17:53,509 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:53,509 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:53,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:17:53,509 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:53,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:53,510 INFO L85 PathProgramCache]: Analyzing trace with hash -37063018, now seen corresponding path program 1 times [2025-03-15 02:17:53,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:53,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582877309] [2025-03-15 02:17:53,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:53,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:53,578 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 02:17:53,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:53,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582877309] [2025-03-15 02:17:53,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582877309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:53,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:53,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:17:53,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964858577] [2025-03-15 02:17:53,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:53,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:17:53,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:53,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:17:53,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:17:53,580 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-15 02:17:53,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 263 transitions, 1503 flow. Second operand has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 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 02:17:53,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:53,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-15 02:17:53,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:53,813 INFO L124 PetriNetUnfolderBase]: 366/1936 cut-off events. [2025-03-15 02:17:53,813 INFO L125 PetriNetUnfolderBase]: For 7616/8863 co-relation queries the response was YES. [2025-03-15 02:17:53,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5732 conditions, 1936 events. 366/1936 cut-off events. For 7616/8863 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13316 event pairs, 91 based on Foata normal form. 0/1710 useless extension candidates. Maximal degree in co-relation 5654. Up to 384 conditions per place. [2025-03-15 02:17:53,824 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 77 selfloop transitions, 4 changer transitions 25/277 dead transitions. [2025-03-15 02:17:53,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 277 transitions, 1921 flow [2025-03-15 02:17:53,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:17:53,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:17:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 821 transitions. [2025-03-15 02:17:53,827 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8481404958677686 [2025-03-15 02:17:53,827 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 12 predicate places. [2025-03-15 02:17:53,827 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 277 transitions, 1921 flow [2025-03-15 02:17:53,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.5) internal successors, (778), 4 states have internal predecessors, (778), 0 states have call successors, (0), 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 02:17:53,828 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:53,828 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:53,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:17:53,828 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:53,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:53,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1148952853, now seen corresponding path program 1 times [2025-03-15 02:17:53,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:53,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577505229] [2025-03-15 02:17:53,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:53,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:53,874 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 02:17:53,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:53,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577505229] [2025-03-15 02:17:53,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577505229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:53,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:53,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:17:53,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556301174] [2025-03-15 02:17:53,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:53,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:17:53,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:53,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:17:53,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:17:53,876 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 242 [2025-03-15 02:17:53,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 277 transitions, 1921 flow. Second operand has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 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 02:17:53,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:53,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 242 [2025-03-15 02:17:53,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:54,101 INFO L124 PetriNetUnfolderBase]: 346/1765 cut-off events. [2025-03-15 02:17:54,101 INFO L125 PetriNetUnfolderBase]: For 10171/11890 co-relation queries the response was YES. [2025-03-15 02:17:54,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6041 conditions, 1765 events. 346/1765 cut-off events. For 10171/11890 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11845 event pairs, 69 based on Foata normal form. 2/1594 useless extension candidates. Maximal degree in co-relation 5961. Up to 317 conditions per place. [2025-03-15 02:17:54,112 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 75 selfloop transitions, 4 changer transitions 25/275 dead transitions. [2025-03-15 02:17:54,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 275 transitions, 2107 flow [2025-03-15 02:17:54,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:17:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:17:54,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 819 transitions. [2025-03-15 02:17:54,114 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8460743801652892 [2025-03-15 02:17:54,115 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 13 predicate places. [2025-03-15 02:17:54,115 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 275 transitions, 2107 flow [2025-03-15 02:17:54,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 194.75) internal successors, (779), 4 states have internal predecessors, (779), 0 states have call successors, (0), 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 02:17:54,115 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:54,116 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:54,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:17:54,116 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:54,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:54,116 INFO L85 PathProgramCache]: Analyzing trace with hash -959331579, now seen corresponding path program 1 times [2025-03-15 02:17:54,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:54,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999120710] [2025-03-15 02:17:54,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:54,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:54,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:54,267 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 02:17:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999120710] [2025-03-15 02:17:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999120710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:54,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:54,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:17:54,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051598159] [2025-03-15 02:17:54,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:54,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:17:54,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:54,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:17:54,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:17:54,269 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 242 [2025-03-15 02:17:54,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 275 transitions, 2107 flow. Second operand has 8 states, 8 states have (on average 180.625) internal successors, (1445), 8 states have internal predecessors, (1445), 0 states have call successors, (0), 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 02:17:54,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:54,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 242 [2025-03-15 02:17:54,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:54,971 INFO L124 PetriNetUnfolderBase]: 834/3465 cut-off events. [2025-03-15 02:17:54,971 INFO L125 PetriNetUnfolderBase]: For 27626/30183 co-relation queries the response was YES. [2025-03-15 02:17:54,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14266 conditions, 3465 events. 834/3465 cut-off events. For 27626/30183 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 28533 event pairs, 98 based on Foata normal form. 17/3175 useless extension candidates. Maximal degree in co-relation 14183. Up to 739 conditions per place. [2025-03-15 02:17:54,997 INFO L140 encePairwiseOnDemand]: 229/242 looper letters, 200 selfloop transitions, 22 changer transitions 62/442 dead transitions. [2025-03-15 02:17:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 442 transitions, 4601 flow [2025-03-15 02:17:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:17:54,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:17:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2494 transitions. [2025-03-15 02:17:55,002 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7927527018436109 [2025-03-15 02:17:55,003 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 25 predicate places. [2025-03-15 02:17:55,003 INFO L471 AbstractCegarLoop]: Abstraction has has 255 places, 442 transitions, 4601 flow [2025-03-15 02:17:55,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 180.625) internal successors, (1445), 8 states have internal predecessors, (1445), 0 states have call successors, (0), 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 02:17:55,004 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:55,004 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:55,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:17:55,004 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:55,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:55,005 INFO L85 PathProgramCache]: Analyzing trace with hash 325492857, now seen corresponding path program 1 times [2025-03-15 02:17:55,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:55,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293253806] [2025-03-15 02:17:55,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:55,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:55,076 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 02:17:55,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:55,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293253806] [2025-03-15 02:17:55,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293253806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:55,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:55,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:17:55,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742787495] [2025-03-15 02:17:55,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:55,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:17:55,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:55,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:17:55,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:17:55,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 242 [2025-03-15 02:17:55,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 442 transitions, 4601 flow. Second operand has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 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 02:17:55,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:55,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 242 [2025-03-15 02:17:55,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:55,541 INFO L124 PetriNetUnfolderBase]: 824/3163 cut-off events. [2025-03-15 02:17:55,541 INFO L125 PetriNetUnfolderBase]: For 34514/39341 co-relation queries the response was YES. [2025-03-15 02:17:55,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15329 conditions, 3163 events. 824/3163 cut-off events. For 34514/39341 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 25193 event pairs, 66 based on Foata normal form. 34/2955 useless extension candidates. Maximal degree in co-relation 15244. Up to 777 conditions per place. [2025-03-15 02:17:55,564 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 186 selfloop transitions, 16 changer transitions 56/451 dead transitions. [2025-03-15 02:17:55,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 451 transitions, 5439 flow [2025-03-15 02:17:55,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:17:55,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:17:55,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1001 transitions. [2025-03-15 02:17:55,568 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8272727272727273 [2025-03-15 02:17:55,568 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 29 predicate places. [2025-03-15 02:17:55,568 INFO L471 AbstractCegarLoop]: Abstraction has has 259 places, 451 transitions, 5439 flow [2025-03-15 02:17:55,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.0) internal successors, (955), 5 states have internal predecessors, (955), 0 states have call successors, (0), 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 02:17:55,569 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:55,569 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:55,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:17:55,569 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:55,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:55,571 INFO L85 PathProgramCache]: Analyzing trace with hash 367780033, now seen corresponding path program 1 times [2025-03-15 02:17:55,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:55,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620302124] [2025-03-15 02:17:55,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:55,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:55,728 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 02:17:55,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:55,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620302124] [2025-03-15 02:17:55,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620302124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:55,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:55,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:17:55,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985626552] [2025-03-15 02:17:55,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:55,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:17:55,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:55,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:17:55,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:17:55,730 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 242 [2025-03-15 02:17:55,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 259 places, 451 transitions, 5439 flow. Second operand has 7 states, 7 states have (on average 185.14285714285714) internal successors, (1296), 7 states have internal predecessors, (1296), 0 states have call successors, (0), 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 02:17:55,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:55,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 242 [2025-03-15 02:17:55,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:56,439 INFO L124 PetriNetUnfolderBase]: 823/3369 cut-off events. [2025-03-15 02:17:56,440 INFO L125 PetriNetUnfolderBase]: For 38988/42501 co-relation queries the response was YES. [2025-03-15 02:17:56,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17152 conditions, 3369 events. 823/3369 cut-off events. For 38988/42501 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 27452 event pairs, 71 based on Foata normal form. 43/3168 useless extension candidates. Maximal degree in co-relation 17064. Up to 769 conditions per place. [2025-03-15 02:17:56,455 INFO L140 encePairwiseOnDemand]: 233/242 looper letters, 92 selfloop transitions, 2 changer transitions 195/450 dead transitions. [2025-03-15 02:17:56,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 450 transitions, 5969 flow [2025-03-15 02:17:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:17:56,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:17:56,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2137 transitions. [2025-03-15 02:17:56,459 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8027798647633358 [2025-03-15 02:17:56,459 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 39 predicate places. [2025-03-15 02:17:56,459 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 450 transitions, 5969 flow [2025-03-15 02:17:56,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 185.14285714285714) internal successors, (1296), 7 states have internal predecessors, (1296), 0 states have call successors, (0), 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 02:17:56,460 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:56,460 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:17:56,460 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:56,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:56,461 INFO L85 PathProgramCache]: Analyzing trace with hash 178614274, now seen corresponding path program 1 times [2025-03-15 02:17:56,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:56,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377660274] [2025-03-15 02:17:56,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:56,590 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 02:17:56,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:56,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377660274] [2025-03-15 02:17:56,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377660274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:56,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:56,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:17:56,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548086005] [2025-03-15 02:17:56,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:56,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:17:56,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:56,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:17:56,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:17:56,592 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 242 [2025-03-15 02:17:56,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 450 transitions, 5969 flow. Second operand has 9 states, 9 states have (on average 174.33333333333334) internal successors, (1569), 9 states have internal predecessors, (1569), 0 states have call successors, (0), 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 02:17:56,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:56,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 242 [2025-03-15 02:17:56,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:57,357 INFO L124 PetriNetUnfolderBase]: 976/3679 cut-off events. [2025-03-15 02:17:57,357 INFO L125 PetriNetUnfolderBase]: For 47068/51894 co-relation queries the response was YES. [2025-03-15 02:17:57,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19834 conditions, 3679 events. 976/3679 cut-off events. For 47068/51894 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 29417 event pairs, 17 based on Foata normal form. 49/3504 useless extension candidates. Maximal degree in co-relation 19738. Up to 774 conditions per place. [2025-03-15 02:17:57,372 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 143 selfloop transitions, 20 changer transitions 255/570 dead transitions. [2025-03-15 02:17:57,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 570 transitions, 8647 flow [2025-03-15 02:17:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:17:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:17:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2543 transitions. [2025-03-15 02:17:57,377 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.750590318772137 [2025-03-15 02:17:57,377 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 51 predicate places. [2025-03-15 02:17:57,377 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 570 transitions, 8647 flow [2025-03-15 02:17:57,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 174.33333333333334) internal successors, (1569), 9 states have internal predecessors, (1569), 0 states have call successors, (0), 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 02:17:57,378 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:57,378 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:57,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:17:57,378 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:57,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1242075932, now seen corresponding path program 1 times [2025-03-15 02:17:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503420816] [2025-03-15 02:17:57,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:57,543 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 02:17:57,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:57,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503420816] [2025-03-15 02:17:57,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503420816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:57,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:57,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:17:57,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099046941] [2025-03-15 02:17:57,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:57,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:17:57,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:57,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:17:57,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:17:57,545 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 242 [2025-03-15 02:17:57,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 570 transitions, 8647 flow. Second operand has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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 02:17:57,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:57,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 242 [2025-03-15 02:17:57,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:57,987 INFO L124 PetriNetUnfolderBase]: 756/2872 cut-off events. [2025-03-15 02:17:57,987 INFO L125 PetriNetUnfolderBase]: For 38238/40477 co-relation queries the response was YES. [2025-03-15 02:17:57,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16043 conditions, 2872 events. 756/2872 cut-off events. For 38238/40477 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 20862 event pairs, 19 based on Foata normal form. 35/2737 useless extension candidates. Maximal degree in co-relation 15933. Up to 679 conditions per place. [2025-03-15 02:17:58,003 INFO L140 encePairwiseOnDemand]: 232/242 looper letters, 58 selfloop transitions, 26 changer transitions 262/537 dead transitions. [2025-03-15 02:17:58,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 537 transitions, 8301 flow [2025-03-15 02:17:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:17:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:17:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1051 transitions. [2025-03-15 02:17:58,007 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.868595041322314 [2025-03-15 02:17:58,007 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 55 predicate places. [2025-03-15 02:17:58,007 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 537 transitions, 8301 flow [2025-03-15 02:17:58,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 205.16666666666666) internal successors, (1231), 6 states have internal predecessors, (1231), 0 states have call successors, (0), 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 02:17:58,008 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:58,008 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:17:58,008 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1049439795, now seen corresponding path program 1 times [2025-03-15 02:17:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:58,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695974460] [2025-03-15 02:17:58,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:58,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:58,351 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 02:17:58,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:58,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695974460] [2025-03-15 02:17:58,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695974460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:58,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:58,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 02:17:58,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811331280] [2025-03-15 02:17:58,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:58,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:17:58,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:58,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:17:58,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:17:58,354 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 242 [2025-03-15 02:17:58,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 537 transitions, 8301 flow. Second operand has 8 states, 8 states have (on average 199.25) internal successors, (1594), 8 states have internal predecessors, (1594), 0 states have call successors, (0), 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 02:17:58,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:58,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 242 [2025-03-15 02:17:58,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:58,717 INFO L124 PetriNetUnfolderBase]: 637/2504 cut-off events. [2025-03-15 02:17:58,718 INFO L125 PetriNetUnfolderBase]: For 39820/42044 co-relation queries the response was YES. [2025-03-15 02:17:58,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14302 conditions, 2504 events. 637/2504 cut-off events. For 39820/42044 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17629 event pairs, 14 based on Foata normal form. 6/2365 useless extension candidates. Maximal degree in co-relation 14172. Up to 547 conditions per place. [2025-03-15 02:17:58,727 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 61 selfloop transitions, 15 changer transitions 272/528 dead transitions. [2025-03-15 02:17:58,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 528 transitions, 8483 flow [2025-03-15 02:17:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:17:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:17:58,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1217 transitions. [2025-03-15 02:17:58,729 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8381542699724518 [2025-03-15 02:17:58,729 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 60 predicate places. [2025-03-15 02:17:58,729 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 528 transitions, 8483 flow [2025-03-15 02:17:58,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 199.25) internal successors, (1594), 8 states have internal predecessors, (1594), 0 states have call successors, (0), 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 02:17:58,730 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:17:58,730 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:58,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:17:58,730 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:17:58,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:17:58,731 INFO L85 PathProgramCache]: Analyzing trace with hash -128771053, now seen corresponding path program 1 times [2025-03-15 02:17:58,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:17:58,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793700145] [2025-03-15 02:17:58,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:17:58,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:17:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:17:58,841 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 02:17:58,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:17:58,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793700145] [2025-03-15 02:17:58,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793700145] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:17:58,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:17:58,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:17:58,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364514111] [2025-03-15 02:17:58,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:17:58,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:17:58,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:17:58,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:17:58,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:17:58,842 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 242 [2025-03-15 02:17:58,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 528 transitions, 8483 flow. Second operand has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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 02:17:58,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:17:58,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 242 [2025-03-15 02:17:58,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:17:59,317 INFO L124 PetriNetUnfolderBase]: 802/2659 cut-off events. [2025-03-15 02:17:59,318 INFO L125 PetriNetUnfolderBase]: For 59016/66012 co-relation queries the response was YES. [2025-03-15 02:17:59,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18098 conditions, 2659 events. 802/2659 cut-off events. For 59016/66012 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 18976 event pairs, 10 based on Foata normal form. 50/2555 useless extension candidates. Maximal degree in co-relation 17966. Up to 852 conditions per place. [2025-03-15 02:17:59,330 INFO L140 encePairwiseOnDemand]: 235/242 looper letters, 0 selfloop transitions, 0 changer transitions 574/574 dead transitions. [2025-03-15 02:17:59,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 574 transitions, 10603 flow [2025-03-15 02:17:59,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:17:59,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:17:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1319 transitions. [2025-03-15 02:17:59,332 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7786304604486423 [2025-03-15 02:17:59,333 INFO L298 CegarLoopForPetriNet]: 230 programPoint places, 65 predicate places. [2025-03-15 02:17:59,333 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 574 transitions, 10603 flow [2025-03-15 02:17:59,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.83333333333334) internal successors, (1091), 6 states have internal predecessors, (1091), 0 states have call successors, (0), 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 02:17:59,339 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/36-apron_22-traces-write-centered-vs-meet-mutex_true_no-overflow.i_petrified1_AllErrorsAtOnce [2025-03-15 02:17:59,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-15 02:17:59,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-15 02:17:59,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-15 02:17:59,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:17:59,381 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:17:59,385 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:17:59,385 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:17:59,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:17:59 BasicIcfg [2025-03-15 02:17:59,390 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:17:59,391 INFO L158 Benchmark]: Toolchain (without parser) took 9959.48ms. Allocated memory was 71.3MB in the beginning and 562.0MB in the end (delta: 490.7MB). Free memory was 43.3MB in the beginning and 110.1MB in the end (delta: -66.7MB). Peak memory consumption was 416.8MB. Max. memory is 8.0GB. [2025-03-15 02:17:59,391 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:17:59,391 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.91ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 22.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-03-15 02:17:59,391 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.49ms. Allocated memory is still 71.3MB. Free memory was 22.6MB in the beginning and 20.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:17:59,392 INFO L158 Benchmark]: Boogie Preprocessor took 33.02ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 19.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:17:59,393 INFO L158 Benchmark]: RCFGBuilder took 537.17ms. Allocated memory is still 71.3MB. Free memory was 19.0MB in the beginning and 22.1MB in the end (delta: -3.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. [2025-03-15 02:17:59,393 INFO L158 Benchmark]: TraceAbstraction took 9020.15ms. Allocated memory was 71.3MB in the beginning and 562.0MB in the end (delta: 490.7MB). Free memory was 21.1MB in the beginning and 110.1MB in the end (delta: -88.9MB). Peak memory consumption was 397.1MB. Max. memory is 8.0GB. [2025-03-15 02:17:59,394 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 327.91ms. Allocated memory is still 71.3MB. Free memory was 43.1MB in the beginning and 22.6MB in the end (delta: 20.5MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.49ms. Allocated memory is still 71.3MB. Free memory was 22.6MB in the beginning and 20.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 33.02ms. Allocated memory is still 71.3MB. Free memory was 20.4MB in the beginning and 19.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 537.17ms. Allocated memory is still 71.3MB. Free memory was 19.0MB in the beginning and 22.1MB in the end (delta: -3.2MB). Peak memory consumption was 7.2MB. Max. memory is 8.0GB. * TraceAbstraction took 9020.15ms. Allocated memory was 71.3MB in the beginning and 562.0MB in the end (delta: 490.7MB). Free memory was 21.1MB in the beginning and 110.1MB in the end (delta: -88.9MB). Peak memory consumption was 397.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 752]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 753]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 754]: 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 3 procedures, 339 locations, 19 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: 8.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1373 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1373 mSDsluCounter, 498 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 358 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2346 IncrementalHoareTripleChecker+Invalid, 2396 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 140 mSDtfsCounter, 2346 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10603occurred in iteration=15, InterpolantAutomatonStates: 102, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1429 NumberOfCodeBlocks, 1429 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1414 ConstructedInterpolants, 0 QuantifiedInterpolants, 3910 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 02:17:59,408 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...