/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/06-symbeq_02-funloop_norace.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:54:52,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:54:52,161 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:54:52,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:54:52,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:54:52,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:54:52,190 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:54:52,190 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:54:52,190 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:54:52,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:54:52,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:54:52,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:52,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:54:52,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:54:52,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:54:52,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:54:52,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:54:52,438 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:54:52,439 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:54:52,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-15 01:54:53,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ed295ac/85ff99b9ad0d4a589399a02bd060214d/FLAG871a32030 [2025-03-15 01:54:53,864 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:54:53,864 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_02-funloop_norace.i [2025-03-15 01:54:53,880 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ed295ac/85ff99b9ad0d4a589399a02bd060214d/FLAG871a32030 [2025-03-15 01:54:53,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8ed295ac/85ff99b9ad0d4a589399a02bd060214d [2025-03-15 01:54:53,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:54:53,899 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:54:53,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:53,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:54:53,904 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:54:53,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:53" (1/1) ... [2025-03-15 01:54:53,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dad524c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:53, skipping insertion in model container [2025-03-15 01:54:53,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:53" (1/1) ... [2025-03-15 01:54:53,941 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:54:54,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:54,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:54:54,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:54,331 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:54:54,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54 WrapperNode [2025-03-15 01:54:54,332 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:54,333 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:54,333 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:54:54,333 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:54:54,337 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,380 INFO L138 Inliner]: procedures = 263, calls = 70, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2025-03-15 01:54:54,381 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:54,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:54:54,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:54:54,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:54:54,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,401 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,402 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,408 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:54:54,411 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:54:54,411 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:54:54,412 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:54:54,412 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (1/1) ... [2025-03-15 01:54:54,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:54,438 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:54:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:54:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:54:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:54:54,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:54:54,458 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:54:54,549 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:54:54,550 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:54:54,752 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:54:54,752 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:54:54,779 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:54:54,779 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:54:54,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:54 BoogieIcfgContainer [2025-03-15 01:54:54,780 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:54:54,781 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:54:54,781 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:54:54,785 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:54:54,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:54:53" (1/3) ... [2025-03-15 01:54:54,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a55be25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:54, skipping insertion in model container [2025-03-15 01:54:54,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:54" (2/3) ... [2025-03-15 01:54:54,785 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a55be25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:54, skipping insertion in model container [2025-03-15 01:54:54,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:54" (3/3) ... [2025-03-15 01:54:54,786 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_02-funloop_norace.i [2025-03-15 01:54:54,799 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:54:54,800 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_02-funloop_norace.i that has 2 procedures, 149 locations, 1 initial locations, 3 loop locations, and 10 error locations. [2025-03-15 01:54:54,800 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:54,856 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:54:54,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:54,895 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;@11a82f7d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:54,895 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-15 01:54:54,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:54,931 INFO L124 PetriNetUnfolderBase]: 0/73 cut-off events. [2025-03-15 01:54:54,935 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:54,935 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:54,936 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 01:54:54,936 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:54,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:54,940 INFO L85 PathProgramCache]: Analyzing trace with hash 136233386, now seen corresponding path program 1 times [2025-03-15 01:54:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528179724] [2025-03-15 01:54:54,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:55,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:55,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:55,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528179724] [2025-03-15 01:54:55,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528179724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:55,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:55,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905273476] [2025-03-15 01:54:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:55,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:55,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:55,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:55,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:55,295 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:55,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 151 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:55,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:55,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:55,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:55,400 INFO L124 PetriNetUnfolderBase]: 11/227 cut-off events. [2025-03-15 01:54:55,401 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:54:55,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 227 events. 11/227 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 388 event pairs, 6 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 155. Up to 34 conditions per place. [2025-03-15 01:54:55,410 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 22 selfloop transitions, 4 changer transitions 0/157 dead transitions. [2025-03-15 01:54:55,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 157 transitions, 369 flow [2025-03-15 01:54:55,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:55,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 689 transitions. [2025-03-15 01:54:55,424 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9125827814569536 [2025-03-15 01:54:55,426 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 3 predicate places. [2025-03-15 01:54:55,426 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 157 transitions, 369 flow [2025-03-15 01:54:55,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:55,427 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:55,428 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:55,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:55,428 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:55,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 51114890, now seen corresponding path program 1 times [2025-03-15 01:54:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:55,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740052727] [2025-03-15 01:54:55,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:55,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740052727] [2025-03-15 01:54:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740052727] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935354969] [2025-03-15 01:54:55,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:55,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:55,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:55,560 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:54:55,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 01:54:55,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:55,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 01:54:55,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:55,706 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:55,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:54:55,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935354969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:55,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:54:55,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 01:54:55,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193106314] [2025-03-15 01:54:55,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:55,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:55,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:55,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:55,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:54:55,711 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:55,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 157 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:55,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:55,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:55,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:55,817 INFO L124 PetriNetUnfolderBase]: 11/226 cut-off events. [2025-03-15 01:54:55,817 INFO L125 PetriNetUnfolderBase]: For 16/22 co-relation queries the response was YES. [2025-03-15 01:54:55,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 226 events. 11/226 cut-off events. For 16/22 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 388 event pairs, 6 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 174. Up to 33 conditions per place. [2025-03-15 01:54:55,819 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 18 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2025-03-15 01:54:55,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 156 transitions, 415 flow [2025-03-15 01:54:55,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:55,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 950 transitions. [2025-03-15 01:54:55,825 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8987701040681173 [2025-03-15 01:54:55,826 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 8 predicate places. [2025-03-15 01:54:55,826 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 156 transitions, 415 flow [2025-03-15 01:54:55,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.16666666666666) internal successors, (805), 6 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:55,826 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:55,826 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:55,838 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 01:54:56,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:56,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:56,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:56,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1584561870, now seen corresponding path program 1 times [2025-03-15 01:54:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:56,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073606105] [2025-03-15 01:54:56,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:56,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-15 01:54:56,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:56,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073606105] [2025-03-15 01:54:56,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073606105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:56,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:56,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:56,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087222071] [2025-03-15 01:54:56,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:56,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:56,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:56,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:56,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:56,102 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:56,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 156 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:56,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:56,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:56,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:56,167 INFO L124 PetriNetUnfolderBase]: 11/225 cut-off events. [2025-03-15 01:54:56,168 INFO L125 PetriNetUnfolderBase]: For 45/57 co-relation queries the response was YES. [2025-03-15 01:54:56,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346 conditions, 225 events. 11/225 cut-off events. For 45/57 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 387 event pairs, 6 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 193. Up to 32 conditions per place. [2025-03-15 01:54:56,171 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 16 selfloop transitions, 8 changer transitions 0/155 dead transitions. [2025-03-15 01:54:56,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 155 transitions, 457 flow [2025-03-15 01:54:56,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:56,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 679 transitions. [2025-03-15 01:54:56,175 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8993377483443709 [2025-03-15 01:54:56,175 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 11 predicate places. [2025-03-15 01:54:56,175 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 155 transitions, 457 flow [2025-03-15 01:54:56,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.5) internal successors, (542), 4 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:56,176 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:56,176 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] [2025-03-15 01:54:56,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:56,176 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:56,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -2082163043, now seen corresponding path program 1 times [2025-03-15 01:54:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203162806] [2025-03-15 01:54:56,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:56,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:56,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:56,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203162806] [2025-03-15 01:54:56,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203162806] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:56,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947349813] [2025-03-15 01:54:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:56,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:56,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:56,284 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:54:56,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 01:54:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:56,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-15 01:54:56,353 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:56,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:56,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:56,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947349813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:56,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:56,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-15 01:54:56,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232176406] [2025-03-15 01:54:56,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:56,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:54:56,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:56,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:54:56,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:54:56,437 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:56,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 155 transitions, 457 flow. Second operand has 10 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:56,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:56,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:56,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:56,531 INFO L124 PetriNetUnfolderBase]: 11/233 cut-off events. [2025-03-15 01:54:56,531 INFO L125 PetriNetUnfolderBase]: For 88/106 co-relation queries the response was YES. [2025-03-15 01:54:56,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 233 events. 11/233 cut-off events. For 88/106 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 377 event pairs, 6 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 212. Up to 40 conditions per place. [2025-03-15 01:54:56,532 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 23 selfloop transitions, 9 changer transitions 0/163 dead transitions. [2025-03-15 01:54:56,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 163 transitions, 585 flow [2025-03-15 01:54:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:56,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:56,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1222 transitions. [2025-03-15 01:54:56,542 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8991905813097866 [2025-03-15 01:54:56,543 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 19 predicate places. [2025-03-15 01:54:56,543 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 163 transitions, 585 flow [2025-03-15 01:54:56,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.9) internal successors, (1349), 10 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:56,544 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:56,544 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:56,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 01:54:56,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-15 01:54:56,749 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:56,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:56,750 INFO L85 PathProgramCache]: Analyzing trace with hash 339612317, now seen corresponding path program 2 times [2025-03-15 01:54:56,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:56,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350753810] [2025-03-15 01:54:56,751 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:56,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:56,771 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:56,771 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:57,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-15 01:54:57,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:57,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350753810] [2025-03-15 01:54:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350753810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:57,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258618118] [2025-03-15 01:54:57,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:57,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:57,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:57,077 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 151 [2025-03-15 01:54:57,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 163 transitions, 585 flow. Second operand has 9 states, 9 states have (on average 67.22222222222223) internal successors, (605), 9 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:57,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:57,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 151 [2025-03-15 01:54:57,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:57,590 INFO L124 PetriNetUnfolderBase]: 211/910 cut-off events. [2025-03-15 01:54:57,590 INFO L125 PetriNetUnfolderBase]: For 805/805 co-relation queries the response was YES. [2025-03-15 01:54:57,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 910 events. 211/910 cut-off events. For 805/805 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5505 event pairs, 42 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 1589. Up to 278 conditions per place. [2025-03-15 01:54:57,595 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 133 selfloop transitions, 17 changer transitions 0/219 dead transitions. [2025-03-15 01:54:57,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 219 transitions, 1101 flow [2025-03-15 01:54:57,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 01:54:57,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 01:54:57,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 861 transitions. [2025-03-15 01:54:57,598 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.47516556291390727 [2025-03-15 01:54:57,600 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 30 predicate places. [2025-03-15 01:54:57,600 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 219 transitions, 1101 flow [2025-03-15 01:54:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 67.22222222222223) internal successors, (605), 9 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:57,601 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:57,601 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:57,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:57,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:57,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1990433711, now seen corresponding path program 1 times [2025-03-15 01:54:57,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:57,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176828329] [2025-03-15 01:54:57,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:57,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:57,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:57,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:57,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176828329] [2025-03-15 01:54:57,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176828329] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:54:57,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620389049] [2025-03-15 01:54:57,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:57,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:57,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:57,744 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:54:57,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 01:54:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:57,810 INFO L256 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 01:54:57,812 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:54:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:57,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:54:57,942 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:57,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1620389049] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:54:57,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:54:57,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-15 01:54:57,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208978892] [2025-03-15 01:54:57,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:54:57,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-15 01:54:57,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:57,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-15 01:54:57,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:54:57,945 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:57,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 219 transitions, 1101 flow. Second operand has 18 states, 18 states have (on average 135.16666666666666) internal successors, (2433), 18 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:57,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:57,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:57,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:58,219 INFO L124 PetriNetUnfolderBase]: 211/930 cut-off events. [2025-03-15 01:54:58,219 INFO L125 PetriNetUnfolderBase]: For 1216/1216 co-relation queries the response was YES. [2025-03-15 01:54:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2152 conditions, 930 events. 211/930 cut-off events. For 1216/1216 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5454 event pairs, 39 based on Foata normal form. 0/813 useless extension candidates. Maximal degree in co-relation 1671. Up to 278 conditions per place. [2025-03-15 01:54:58,223 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 52 selfloop transitions, 21 changer transitions 0/247 dead transitions. [2025-03-15 01:54:58,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 247 transitions, 1535 flow [2025-03-15 01:54:58,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-15 01:54:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-15 01:54:58,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2836 transitions. [2025-03-15 01:54:58,228 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8943550930305897 [2025-03-15 01:54:58,228 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 50 predicate places. [2025-03-15 01:54:58,228 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 247 transitions, 1535 flow [2025-03-15 01:54:58,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 135.16666666666666) internal successors, (2433), 18 states have internal predecessors, (2433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:58,229 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:58,229 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:58,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 01:54:58,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:54:58,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:58,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:58,432 INFO L85 PathProgramCache]: Analyzing trace with hash -2006756433, now seen corresponding path program 2 times [2025-03-15 01:54:58,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:58,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076360143] [2025-03-15 01:54:58,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:58,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:58,450 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:58,450 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-15 01:54:58,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:58,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076360143] [2025-03-15 01:54:58,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076360143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:58,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:58,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:54:58,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648964199] [2025-03-15 01:54:58,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:58,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:54:58,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:58,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:54:58,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:54:58,681 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 151 [2025-03-15 01:54:58,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 247 transitions, 1535 flow. Second operand has 9 states, 9 states have (on average 69.11111111111111) internal successors, (622), 9 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:58,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:58,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 151 [2025-03-15 01:54:58,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:59,193 INFO L124 PetriNetUnfolderBase]: 393/1468 cut-off events. [2025-03-15 01:54:59,193 INFO L125 PetriNetUnfolderBase]: For 3102/3190 co-relation queries the response was YES. [2025-03-15 01:54:59,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4131 conditions, 1468 events. 393/1468 cut-off events. For 3102/3190 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 9500 event pairs, 70 based on Foata normal form. 16/1284 useless extension candidates. Maximal degree in co-relation 3580. Up to 543 conditions per place. [2025-03-15 01:54:59,201 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 161 selfloop transitions, 32 changer transitions 0/300 dead transitions. [2025-03-15 01:54:59,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 300 transitions, 2217 flow [2025-03-15 01:54:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 01:54:59,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 01:54:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 884 transitions. [2025-03-15 01:54:59,203 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4878587196467991 [2025-03-15 01:54:59,204 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 61 predicate places. [2025-03-15 01:54:59,204 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 300 transitions, 2217 flow [2025-03-15 01:54:59,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 69.11111111111111) internal successors, (622), 9 states have internal predecessors, (622), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:59,204 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:59,205 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:59,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:59,205 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:59,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:59,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1142045047, now seen corresponding path program 1 times [2025-03-15 01:54:59,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:59,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924919953] [2025-03-15 01:54:59,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:59,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:59,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:59,284 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-15 01:54:59,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:59,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924919953] [2025-03-15 01:54:59,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924919953] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:59,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:59,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:59,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289302979] [2025-03-15 01:54:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:59,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:59,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:59,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:59,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:59,286 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:54:59,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 300 transitions, 2217 flow. Second operand has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:59,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:59,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:54:59,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:59,549 INFO L124 PetriNetUnfolderBase]: 610/2192 cut-off events. [2025-03-15 01:54:59,550 INFO L125 PetriNetUnfolderBase]: For 6731/6894 co-relation queries the response was YES. [2025-03-15 01:54:59,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6852 conditions, 2192 events. 610/2192 cut-off events. For 6731/6894 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 15035 event pairs, 157 based on Foata normal form. 1/1906 useless extension candidates. Maximal degree in co-relation 6297. Up to 1001 conditions per place. [2025-03-15 01:54:59,561 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 71 selfloop transitions, 5 changer transitions 0/322 dead transitions. [2025-03-15 01:54:59,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 322 transitions, 2613 flow [2025-03-15 01:54:59,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:59,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:59,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 697 transitions. [2025-03-15 01:54:59,562 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9231788079470199 [2025-03-15 01:54:59,563 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 65 predicate places. [2025-03-15 01:54:59,563 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 322 transitions, 2613 flow [2025-03-15 01:54:59,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.5) internal successors, (538), 4 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:59,563 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:59,563 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:59,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:54:59,563 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:54:59,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2108593707, now seen corresponding path program 1 times [2025-03-15 01:54:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299918791] [2025-03-15 01:54:59,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:59,653 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-15 01:54:59,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:59,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299918791] [2025-03-15 01:54:59,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299918791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:59,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:59,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:59,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239727367] [2025-03-15 01:54:59,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:59,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:59,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:59,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:59,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:59,655 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 151 [2025-03-15 01:54:59,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 322 transitions, 2613 flow. Second operand has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:59,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:59,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 151 [2025-03-15 01:54:59,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:00,038 INFO L124 PetriNetUnfolderBase]: 942/3131 cut-off events. [2025-03-15 01:55:00,039 INFO L125 PetriNetUnfolderBase]: For 17212/17690 co-relation queries the response was YES. [2025-03-15 01:55:00,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11022 conditions, 3131 events. 942/3131 cut-off events. For 17212/17690 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 22562 event pairs, 389 based on Foata normal form. 0/2707 useless extension candidates. Maximal degree in co-relation 10465. Up to 1464 conditions per place. [2025-03-15 01:55:00,058 INFO L140 encePairwiseOnDemand]: 144/151 looper letters, 95 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-03-15 01:55:00,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 356 transitions, 3299 flow [2025-03-15 01:55:00,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:55:00,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:55:00,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 705 transitions. [2025-03-15 01:55:00,060 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9337748344370861 [2025-03-15 01:55:00,060 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 69 predicate places. [2025-03-15 01:55:00,061 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 356 transitions, 3299 flow [2025-03-15 01:55:00,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.25) internal successors, (545), 4 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:00,061 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:00,061 INFO L221 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:00,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:55:00,061 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:00,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:00,062 INFO L85 PathProgramCache]: Analyzing trace with hash 486191474, now seen corresponding path program 1 times [2025-03-15 01:55:00,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:00,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89548024] [2025-03-15 01:55:00,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:55:00,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:00,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:55:00,300 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:55:00,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89548024] [2025-03-15 01:55:00,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89548024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:55:00,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190872859] [2025-03-15 01:55:00,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:55:00,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:55:00,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:55:00,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:55:00,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 01:55:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:55:00,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-15 01:55:00,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:55:00,456 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:55:00,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 01:55:00,626 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:55:00,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190872859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 01:55:00,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 01:55:00,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-15 01:55:00,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426440761] [2025-03-15 01:55:00,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 01:55:00,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-15 01:55:00,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:00,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-15 01:55:00,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-15 01:55:00,629 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 151 [2025-03-15 01:55:00,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 356 transitions, 3299 flow. Second operand has 23 states, 23 states have (on average 135.43478260869566) internal successors, (3115), 23 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:00,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:00,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 151 [2025-03-15 01:55:00,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:01,272 INFO L124 PetriNetUnfolderBase]: 942/3149 cut-off events. [2025-03-15 01:55:01,272 INFO L125 PetriNetUnfolderBase]: For 21580/22058 co-relation queries the response was YES. [2025-03-15 01:55:01,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11679 conditions, 3149 events. 942/3149 cut-off events. For 21580/22058 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 22526 event pairs, 389 based on Foata normal form. 0/2724 useless extension candidates. Maximal degree in co-relation 10913. Up to 1464 conditions per place. [2025-03-15 01:55:01,293 INFO L140 encePairwiseOnDemand]: 145/151 looper letters, 113 selfloop transitions, 30 changer transitions 0/377 dead transitions. [2025-03-15 01:55:01,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 377 transitions, 3849 flow [2025-03-15 01:55:01,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-15 01:55:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-15 01:55:01,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4044 transitions. [2025-03-15 01:55:01,301 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8927152317880794 [2025-03-15 01:55:01,302 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 98 predicate places. [2025-03-15 01:55:01,302 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 377 transitions, 3849 flow [2025-03-15 01:55:01,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 135.43478260869566) internal successors, (3115), 23 states have internal predecessors, (3115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:01,303 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:01,303 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:01,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 01:55:01,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:55:01,504 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:01,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:01,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1505162004, now seen corresponding path program 2 times [2025-03-15 01:55:01,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:01,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819039617] [2025-03-15 01:55:01,505 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:55:01,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:01,524 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:55:01,524 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:02,018 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:02,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:02,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819039617] [2025-03-15 01:55:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819039617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:02,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:02,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886727808] [2025-03-15 01:55:02,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:02,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:02,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:02,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:02,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:02,020 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:02,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 377 transitions, 3849 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:02,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:02,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:02,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:04,137 INFO L124 PetriNetUnfolderBase]: 1624/4920 cut-off events. [2025-03-15 01:55:04,138 INFO L125 PetriNetUnfolderBase]: For 27916/28537 co-relation queries the response was YES. [2025-03-15 01:55:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19457 conditions, 4920 events. 1624/4920 cut-off events. For 27916/28537 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 37275 event pairs, 467 based on Foata normal form. 19/4388 useless extension candidates. Maximal degree in co-relation 18618. Up to 2331 conditions per place. [2025-03-15 01:55:04,172 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 394 selfloop transitions, 172 changer transitions 0/694 dead transitions. [2025-03-15 01:55:04,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 694 transitions, 7429 flow [2025-03-15 01:55:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-15 01:55:04,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-15 01:55:04,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 2968 transitions. [2025-03-15 01:55:04,179 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.42729628563201844 [2025-03-15 01:55:04,179 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 143 predicate places. [2025-03-15 01:55:04,179 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 694 transitions, 7429 flow [2025-03-15 01:55:04,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:04,179 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:04,180 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:04,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:55:04,180 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:04,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1618109524, now seen corresponding path program 3 times [2025-03-15 01:55:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114799662] [2025-03-15 01:55:04,181 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:55:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:04,202 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:55:04,203 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:04,428 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:04,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:04,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114799662] [2025-03-15 01:55:04,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114799662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:04,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:04,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:04,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070854517] [2025-03-15 01:55:04,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:04,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:04,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:04,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:04,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:04,431 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:04,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 694 transitions, 7429 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:04,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:04,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:04,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:05,679 INFO L124 PetriNetUnfolderBase]: 2261/6415 cut-off events. [2025-03-15 01:55:05,679 INFO L125 PetriNetUnfolderBase]: For 43372/44155 co-relation queries the response was YES. [2025-03-15 01:55:05,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28961 conditions, 6415 events. 2261/6415 cut-off events. For 43372/44155 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 49981 event pairs, 439 based on Foata normal form. 24/5800 useless extension candidates. Maximal degree in co-relation 28047. Up to 2850 conditions per place. [2025-03-15 01:55:05,726 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 709 selfloop transitions, 66 changer transitions 0/997 dead transitions. [2025-03-15 01:55:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 997 transitions, 12419 flow [2025-03-15 01:55:05,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:05,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 701 transitions. [2025-03-15 01:55:05,728 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5158204562178073 [2025-03-15 01:55:05,728 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 151 predicate places. [2025-03-15 01:55:05,728 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 997 transitions, 12419 flow [2025-03-15 01:55:05,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:05,729 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:05,729 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:05,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:55:05,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:05,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:05,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1065826302, now seen corresponding path program 4 times [2025-03-15 01:55:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110519574] [2025-03-15 01:55:05,730 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:55:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:05,754 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:55:05,754 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:06,146 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:06,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:06,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110519574] [2025-03-15 01:55:06,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110519574] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832482621] [2025-03-15 01:55:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:06,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:06,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:06,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:06,148 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:06,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 997 transitions, 12419 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:06,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:06,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:06,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:06,879 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([286] L924-->L924-3: Formula: (and (= |v_#pthreadsMutex_23| (store |v_#pthreadsMutex_24| |v_ULTIMATE.start_cache_entry_addref_~entry#1.base_14| (store (select |v_#pthreadsMutex_24| |v_ULTIMATE.start_cache_entry_addref_~entry#1.base_14|) (+ 4 |v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_14|) 0))) (= |v_ULTIMATE.start_cache_entry_addref_#t~ret33#1_7| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_24|, ULTIMATE.start_cache_entry_addref_~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_14|, ULTIMATE.start_cache_entry_addref_~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_~entry#1.base_14|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_23|, ULTIMATE.start_cache_entry_addref_~entry#1.offset=|v_ULTIMATE.start_cache_entry_addref_~entry#1.offset_14|, ULTIMATE.start_cache_entry_addref_#t~ret33#1=|v_ULTIMATE.start_cache_entry_addref_#t~ret33#1_7|, ULTIMATE.start_cache_entry_addref_~entry#1.base=|v_ULTIMATE.start_cache_entry_addref_~entry#1.base_14|} AuxVars[] AssignedVars[#pthreadsMutex, ULTIMATE.start_cache_entry_addref_#t~ret33#1][831], [1730#true, 406#true, 1011#true, 161#true, 1720#(= |ULTIMATE.start_main_~i~2#1| 0), 2685#(= |~#cache~0.offset| 0), 155#true, 990#(= |~#cache~0.offset| 0), 2804#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |~#cache~0.base|) (= |ULTIMATE.start_main_~i~2#1| 0) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 1697#(= |~#cache~0.offset| 0), 412#true, t_funThread1of1ForFork0InUse, 127#L924-3true, 2775#(= |t_funThread1of1ForFork0_~i~0#1| 0), 1726#(= |t_funThread1of1ForFork0_~i~0#1| 0), 121#L924true]) [2025-03-15 01:55:06,879 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is cut-off event [2025-03-15 01:55:06,879 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 01:55:06,879 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 01:55:06,879 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is cut-off event [2025-03-15 01:55:06,897 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([353] L924-->L924-3: Formula: (and (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base_11| (store (select |v_#pthreadsMutex_32| |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base_11|) (+ |v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_11| 4) 0))) (= 0 |v_t_funThread1of1ForFork0_cache_entry_addref_#t~ret33#1_3|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_11|, t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base_11|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base=|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base_11|, t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset=|v_t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset_11|, t_funThread1of1ForFork0_cache_entry_addref_#t~ret33#1=|v_t_funThread1of1ForFork0_cache_entry_addref_#t~ret33#1_3|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread1of1ForFork0_cache_entry_addref_#t~ret33#1][398], [1730#true, 406#true, 1011#true, 132#L924-3true, 161#true, 1720#(= |ULTIMATE.start_main_~i~2#1| 0), 102#L924true, 2685#(= |~#cache~0.offset| 0), 155#true, 990#(= |~#cache~0.offset| 0), 2804#(and (= |~#cache~0.base| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.base|) (= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.base| |~#cache~0.base|) (= |ULTIMATE.start_main_~i~2#1| 0) (= |t_funThread1of1ForFork0_~i~0#1| 0) (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_#in~entry#1.offset|) (= |~#cache~0.offset| |t_funThread1of1ForFork0_cache_entry_addref_~entry#1.offset|)), 1697#(= |~#cache~0.offset| 0), 412#true, t_funThread1of1ForFork0InUse, 2775#(= |t_funThread1of1ForFork0_~i~0#1| 0), 1726#(= |t_funThread1of1ForFork0_~i~0#1| 0)]) [2025-03-15 01:55:06,898 INFO L294 olderBase$Statistics]: this new event has 178 ancestors and is not cut-off event [2025-03-15 01:55:06,898 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-15 01:55:06,898 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-15 01:55:06,898 INFO L297 olderBase$Statistics]: existing Event has 178 ancestors and is not cut-off event [2025-03-15 01:55:07,619 INFO L124 PetriNetUnfolderBase]: 2315/6843 cut-off events. [2025-03-15 01:55:07,620 INFO L125 PetriNetUnfolderBase]: For 51203/51803 co-relation queries the response was YES. [2025-03-15 01:55:07,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34214 conditions, 6843 events. 2315/6843 cut-off events. For 51203/51803 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 54002 event pairs, 486 based on Foata normal form. 34/6217 useless extension candidates. Maximal degree in co-relation 33225. Up to 3039 conditions per place. [2025-03-15 01:55:07,691 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 816 selfloop transitions, 97 changer transitions 0/1135 dead transitions. [2025-03-15 01:55:07,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 1135 transitions, 15741 flow [2025-03-15 01:55:07,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:07,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:07,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 698 transitions. [2025-03-15 01:55:07,697 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5136129506990434 [2025-03-15 01:55:07,697 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 159 predicate places. [2025-03-15 01:55:07,697 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 1135 transitions, 15741 flow [2025-03-15 01:55:07,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:07,698 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:07,698 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:55:07,698 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:07,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:07,698 INFO L85 PathProgramCache]: Analyzing trace with hash -665821483, now seen corresponding path program 1 times [2025-03-15 01:55:07,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:07,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596824990] [2025-03-15 01:55:07,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:55:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:55:08,085 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:08,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:08,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596824990] [2025-03-15 01:55:08,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596824990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:08,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:08,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:08,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92050417] [2025-03-15 01:55:08,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:08,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:08,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:08,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:08,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:08,086 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:08,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 1135 transitions, 15741 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:08,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:08,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:08,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:09,607 INFO L124 PetriNetUnfolderBase]: 2087/6087 cut-off events. [2025-03-15 01:55:09,607 INFO L125 PetriNetUnfolderBase]: For 61324/62244 co-relation queries the response was YES. [2025-03-15 01:55:09,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34771 conditions, 6087 events. 2087/6087 cut-off events. For 61324/62244 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 46631 event pairs, 499 based on Foata normal form. 18/5475 useless extension candidates. Maximal degree in co-relation 33707. Up to 3093 conditions per place. [2025-03-15 01:55:09,659 INFO L140 encePairwiseOnDemand]: 138/151 looper letters, 674 selfloop transitions, 173 changer transitions 0/1002 dead transitions. [2025-03-15 01:55:09,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 1002 transitions, 16037 flow [2025-03-15 01:55:09,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:09,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 688 transitions. [2025-03-15 01:55:09,660 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5062545989698307 [2025-03-15 01:55:09,661 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 136 predicate places. [2025-03-15 01:55:09,661 INFO L471 AbstractCegarLoop]: Abstraction has has 288 places, 1002 transitions, 16037 flow [2025-03-15 01:55:09,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:09,661 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:09,661 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:09,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:55:09,661 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:09,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:09,662 INFO L85 PathProgramCache]: Analyzing trace with hash 912989456, now seen corresponding path program 5 times [2025-03-15 01:55:09,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:09,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838185976] [2025-03-15 01:55:09,662 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:55:09,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:09,695 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:55:09,695 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838185976] [2025-03-15 01:55:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838185976] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:10,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:10,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:10,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145430464] [2025-03-15 01:55:10,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:10,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:10,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:10,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:10,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:10,198 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 151 [2025-03-15 01:55:10,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1002 transitions, 16037 flow. Second operand has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:10,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:10,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 151 [2025-03-15 01:55:10,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:13,156 INFO L124 PetriNetUnfolderBase]: 3782/9427 cut-off events. [2025-03-15 01:55:13,156 INFO L125 PetriNetUnfolderBase]: For 81432/81996 co-relation queries the response was YES. [2025-03-15 01:55:13,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56058 conditions, 9427 events. 3782/9427 cut-off events. For 81432/81996 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 72488 event pairs, 1046 based on Foata normal form. 7/8510 useless extension candidates. Maximal degree in co-relation 54921. Up to 5033 conditions per place. [2025-03-15 01:55:13,223 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1156 selfloop transitions, 189 changer transitions 0/1485 dead transitions. [2025-03-15 01:55:13,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 1485 transitions, 25037 flow [2025-03-15 01:55:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-15 01:55:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2025-03-15 01:55:13,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2036 transitions. [2025-03-15 01:55:13,225 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.40858920329119003 [2025-03-15 01:55:13,225 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 168 predicate places. [2025-03-15 01:55:13,225 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 1485 transitions, 25037 flow [2025-03-15 01:55:13,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:13,226 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:13,226 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:13,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:55:13,226 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:13,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:13,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1373714262, now seen corresponding path program 6 times [2025-03-15 01:55:13,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:13,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041012735] [2025-03-15 01:55:13,226 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:55:13,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:13,238 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:55:13,238 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:13,554 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041012735] [2025-03-15 01:55:13,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041012735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:13,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:13,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:13,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175041891] [2025-03-15 01:55:13,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:13,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:13,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:13,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:13,555 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:13,556 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 1485 transitions, 25037 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:13,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:13,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:13,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:17,079 INFO L124 PetriNetUnfolderBase]: 4670/11595 cut-off events. [2025-03-15 01:55:17,079 INFO L125 PetriNetUnfolderBase]: For 113674/114612 co-relation queries the response was YES. [2025-03-15 01:55:17,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74746 conditions, 11595 events. 4670/11595 cut-off events. For 113674/114612 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 93341 event pairs, 1079 based on Foata normal form. 14/10528 useless extension candidates. Maximal degree in co-relation 73536. Up to 6177 conditions per place. [2025-03-15 01:55:17,153 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1271 selfloop transitions, 434 changer transitions 0/1958 dead transitions. [2025-03-15 01:55:17,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 1958 transitions, 36059 flow [2025-03-15 01:55:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-15 01:55:17,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-15 01:55:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2689 transitions. [2025-03-15 01:55:17,156 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4343401712162817 [2025-03-15 01:55:17,156 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 207 predicate places. [2025-03-15 01:55:17,156 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 1958 transitions, 36059 flow [2025-03-15 01:55:17,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:17,157 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:17,157 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:17,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:55:17,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:17,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:17,157 INFO L85 PathProgramCache]: Analyzing trace with hash 503582211, now seen corresponding path program 2 times [2025-03-15 01:55:17,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:17,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931984993] [2025-03-15 01:55:17,158 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:55:17,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:17,168 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:55:17,168 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:17,315 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:17,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:17,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931984993] [2025-03-15 01:55:17,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931984993] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:17,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:17,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:17,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326463200] [2025-03-15 01:55:17,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:17,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:17,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:17,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:17,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:17,317 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:17,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 1958 transitions, 36059 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:17,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:17,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:17,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:19,872 INFO L124 PetriNetUnfolderBase]: 3677/9078 cut-off events. [2025-03-15 01:55:19,873 INFO L125 PetriNetUnfolderBase]: For 113519/114259 co-relation queries the response was YES. [2025-03-15 01:55:19,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64695 conditions, 9078 events. 3677/9078 cut-off events. For 113519/114259 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 68818 event pairs, 1120 based on Foata normal form. 23/8199 useless extension candidates. Maximal degree in co-relation 63410. Up to 5505 conditions per place. [2025-03-15 01:55:19,936 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 984 selfloop transitions, 167 changer transitions 0/1411 dead transitions. [2025-03-15 01:55:19,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 331 places, 1411 transitions, 29135 flow [2025-03-15 01:55:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 697 transitions. [2025-03-15 01:55:19,937 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5128771155261221 [2025-03-15 01:55:19,937 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 179 predicate places. [2025-03-15 01:55:19,937 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 1411 transitions, 29135 flow [2025-03-15 01:55:19,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:19,938 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:19,938 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:19,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:55:19,938 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:19,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1430552436, now seen corresponding path program 7 times [2025-03-15 01:55:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079033497] [2025-03-15 01:55:19,939 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:55:19,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:55:20,453 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:20,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:20,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079033497] [2025-03-15 01:55:20,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079033497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:20,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:20,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:20,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273428598] [2025-03-15 01:55:20,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:20,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:20,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:20,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:20,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:20,455 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:20,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 1411 transitions, 29135 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:20,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:20,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:20,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:24,111 INFO L124 PetriNetUnfolderBase]: 4206/10417 cut-off events. [2025-03-15 01:55:24,111 INFO L125 PetriNetUnfolderBase]: For 144489/145532 co-relation queries the response was YES. [2025-03-15 01:55:24,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79324 conditions, 10417 events. 4206/10417 cut-off events. For 144489/145532 co-relation queries the response was YES. Maximal size of possible extension queue 207. Compared 81737 event pairs, 1173 based on Foata normal form. 2/9420 useless extension candidates. Maximal degree in co-relation 77966. Up to 6482 conditions per place. [2025-03-15 01:55:24,193 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1141 selfloop transitions, 290 changer transitions 0/1650 dead transitions. [2025-03-15 01:55:24,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 1650 transitions, 36765 flow [2025-03-15 01:55:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-15 01:55:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2025-03-15 01:55:24,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 2683 transitions. [2025-03-15 01:55:24,195 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43337102245194636 [2025-03-15 01:55:24,196 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 219 predicate places. [2025-03-15 01:55:24,196 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 1650 transitions, 36765 flow [2025-03-15 01:55:24,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:24,196 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:24,196 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:24,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:55:24,197 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:24,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:24,197 INFO L85 PathProgramCache]: Analyzing trace with hash 630731775, now seen corresponding path program 3 times [2025-03-15 01:55:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:24,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678367074] [2025-03-15 01:55:24,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:55:24,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:24,212 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:55:24,212 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:24,342 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:24,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:24,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678367074] [2025-03-15 01:55:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678367074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:24,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287297977] [2025-03-15 01:55:24,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:24,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:24,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:24,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:24,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:24,343 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:24,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 1650 transitions, 36765 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:24,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:24,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:24,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:26,666 INFO L124 PetriNetUnfolderBase]: 3677/9086 cut-off events. [2025-03-15 01:55:26,666 INFO L125 PetriNetUnfolderBase]: For 151646/152630 co-relation queries the response was YES. [2025-03-15 01:55:26,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74816 conditions, 9086 events. 3677/9086 cut-off events. For 151646/152630 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 68954 event pairs, 1111 based on Foata normal form. 12/8196 useless extension candidates. Maximal degree in co-relation 73383. Up to 5509 conditions per place. [2025-03-15 01:55:26,847 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 985 selfloop transitions, 169 changer transitions 0/1414 dead transitions. [2025-03-15 01:55:26,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 1414 transitions, 33909 flow [2025-03-15 01:55:26,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:26,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:26,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 693 transitions. [2025-03-15 01:55:26,849 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5099337748344371 [2025-03-15 01:55:26,849 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 201 predicate places. [2025-03-15 01:55:26,849 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 1414 transitions, 33909 flow [2025-03-15 01:55:26,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:26,849 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:26,849 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:26,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:55:26,849 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:26,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:26,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1363863702, now seen corresponding path program 8 times [2025-03-15 01:55:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814200208] [2025-03-15 01:55:26,850 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:55:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:26,860 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:55:26,860 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:26,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:26,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814200208] [2025-03-15 01:55:26,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814200208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:26,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:26,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:26,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420883360] [2025-03-15 01:55:26,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:26,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:26,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:26,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:26,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:26,977 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:26,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 1414 transitions, 33909 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:26,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:26,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:26,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:29,309 INFO L124 PetriNetUnfolderBase]: 3466/8622 cut-off events. [2025-03-15 01:55:29,310 INFO L125 PetriNetUnfolderBase]: For 165584/166670 co-relation queries the response was YES. [2025-03-15 01:55:29,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75572 conditions, 8622 events. 3466/8622 cut-off events. For 165584/166670 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 64670 event pairs, 1032 based on Foata normal form. 18/7762 useless extension candidates. Maximal degree in co-relation 74064. Up to 5165 conditions per place. [2025-03-15 01:55:29,376 INFO L140 encePairwiseOnDemand]: 135/151 looper letters, 917 selfloop transitions, 166 changer transitions 0/1326 dead transitions. [2025-03-15 01:55:29,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 1326 transitions, 33721 flow [2025-03-15 01:55:29,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:29,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:29,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 690 transitions. [2025-03-15 01:55:29,378 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5077262693156733 [2025-03-15 01:55:29,378 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 209 predicate places. [2025-03-15 01:55:29,378 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 1326 transitions, 33721 flow [2025-03-15 01:55:29,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:29,378 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:29,378 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:29,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:55:29,378 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:29,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:29,379 INFO L85 PathProgramCache]: Analyzing trace with hash -916995884, now seen corresponding path program 9 times [2025-03-15 01:55:29,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:29,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854350842] [2025-03-15 01:55:29,379 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:55:29,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:29,389 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:55:29,389 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:29,663 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:29,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:29,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854350842] [2025-03-15 01:55:29,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854350842] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:29,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:29,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:29,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809033105] [2025-03-15 01:55:29,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:29,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:29,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:29,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:29,665 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:29,665 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:29,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 1326 transitions, 33721 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:29,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:29,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:29,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:33,081 INFO L124 PetriNetUnfolderBase]: 4102/10181 cut-off events. [2025-03-15 01:55:33,081 INFO L125 PetriNetUnfolderBase]: For 213479/214839 co-relation queries the response was YES. [2025-03-15 01:55:33,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94284 conditions, 10181 events. 4102/10181 cut-off events. For 213479/214839 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 79320 event pairs, 1131 based on Foata normal form. 2/9208 useless extension candidates. Maximal degree in co-relation 92703. Up to 6193 conditions per place. [2025-03-15 01:55:33,167 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1222 selfloop transitions, 221 changer transitions 0/1662 dead transitions. [2025-03-15 01:55:33,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 1662 transitions, 45167 flow [2025-03-15 01:55:33,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 01:55:33,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 01:55:33,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2492 transitions. [2025-03-15 01:55:33,169 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43429766469153014 [2025-03-15 01:55:33,170 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 246 predicate places. [2025-03-15 01:55:33,170 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 1662 transitions, 45167 flow [2025-03-15 01:55:33,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:33,170 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:33,170 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:33,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:55:33,170 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:33,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:33,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1144288327, now seen corresponding path program 4 times [2025-03-15 01:55:33,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:33,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902748066] [2025-03-15 01:55:33,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:55:33,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:33,183 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:55:33,183 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:33,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902748066] [2025-03-15 01:55:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902748066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821752762] [2025-03-15 01:55:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:33,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:33,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:33,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:33,353 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:33,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 1662 transitions, 45167 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:33,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:33,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:33,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:36,397 INFO L124 PetriNetUnfolderBase]: 3866/9528 cut-off events. [2025-03-15 01:55:36,397 INFO L125 PetriNetUnfolderBase]: For 235678/236948 co-relation queries the response was YES. [2025-03-15 01:55:36,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94542 conditions, 9528 events. 3866/9528 cut-off events. For 235678/236948 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 73144 event pairs, 1152 based on Foata normal form. 12/8621 useless extension candidates. Maximal degree in co-relation 92886. Up to 5787 conditions per place. [2025-03-15 01:55:36,502 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 1150 selfloop transitions, 129 changer transitions 0/1547 dead transitions. [2025-03-15 01:55:36,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1547 transitions, 45059 flow [2025-03-15 01:55:36,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:36,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 702 transitions. [2025-03-15 01:55:36,503 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5165562913907285 [2025-03-15 01:55:36,504 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 230 predicate places. [2025-03-15 01:55:36,504 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 1547 transitions, 45059 flow [2025-03-15 01:55:36,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:36,504 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:36,504 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:36,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:55:36,504 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:36,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:36,505 INFO L85 PathProgramCache]: Analyzing trace with hash -789846320, now seen corresponding path program 10 times [2025-03-15 01:55:36,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:36,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833432536] [2025-03-15 01:55:36,505 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:55:36,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:36,516 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:55:36,516 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:36,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:36,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833432536] [2025-03-15 01:55:36,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833432536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:36,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:36,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:36,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837615584] [2025-03-15 01:55:36,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:36,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:36,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:36,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:36,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:36,724 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:36,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 1547 transitions, 45059 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:36,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:36,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:36,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:39,731 INFO L124 PetriNetUnfolderBase]: 4097/10026 cut-off events. [2025-03-15 01:55:39,731 INFO L125 PetriNetUnfolderBase]: For 286486/287879 co-relation queries the response was YES. [2025-03-15 01:55:39,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104756 conditions, 10026 events. 4097/10026 cut-off events. For 286486/287879 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 77818 event pairs, 1179 based on Foata normal form. 10/9093 useless extension candidates. Maximal degree in co-relation 103025. Up to 6163 conditions per place. [2025-03-15 01:55:39,819 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 1256 selfloop transitions, 134 changer transitions 0/1658 dead transitions. [2025-03-15 01:55:39,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 1658 transitions, 51737 flow [2025-03-15 01:55:39,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:55:39,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:55:39,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2025-03-15 01:55:39,820 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5194996320824136 [2025-03-15 01:55:39,820 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 238 predicate places. [2025-03-15 01:55:39,820 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 1658 transitions, 51737 flow [2025-03-15 01:55:39,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:39,820 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:39,820 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:39,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:55:39,821 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:39,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:39,821 INFO L85 PathProgramCache]: Analyzing trace with hash -723157586, now seen corresponding path program 11 times [2025-03-15 01:55:39,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:39,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230535395] [2025-03-15 01:55:39,821 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:55:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:39,839 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:55:39,839 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-15 01:55:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230535395] [2025-03-15 01:55:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230535395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:55:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524446283] [2025-03-15 01:55:40,338 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:55:40,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:55:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:55:40,341 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:55:40,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 01:55:40,446 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:55:40,447 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:40,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 01:55:40,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:55:40,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 01:55:40,701 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:40,701 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:55:40,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524446283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:40,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:55:40,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 22 [2025-03-15 01:55:40,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690455413] [2025-03-15 01:55:40,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:40,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:55:40,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:40,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:55:40,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=407, Unknown=0, NotChecked=0, Total=462 [2025-03-15 01:55:40,703 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:40,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1658 transitions, 51737 flow. Second operand has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:40,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:40,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:40,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:44,143 INFO L124 PetriNetUnfolderBase]: 4082/10031 cut-off events. [2025-03-15 01:55:44,143 INFO L125 PetriNetUnfolderBase]: For 316401/317834 co-relation queries the response was YES. [2025-03-15 01:55:44,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109639 conditions, 10031 events. 4082/10031 cut-off events. For 316401/317834 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 77834 event pairs, 1266 based on Foata normal form. 18/9063 useless extension candidates. Maximal degree in co-relation 107833. Up to 6186 conditions per place. [2025-03-15 01:55:44,231 INFO L140 encePairwiseOnDemand]: 134/151 looper letters, 1177 selfloop transitions, 163 changer transitions 0/1608 dead transitions. [2025-03-15 01:55:44,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 1608 transitions, 52481 flow [2025-03-15 01:55:44,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:55:44,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:55:44,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 954 transitions. [2025-03-15 01:55:44,232 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4859908303616913 [2025-03-15 01:55:44,232 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 250 predicate places. [2025-03-15 01:55:44,233 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 1608 transitions, 52481 flow [2025-03-15 01:55:44,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:44,233 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:44,233 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:44,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 01:55:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-15 01:55:44,434 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1197908204, now seen corresponding path program 12 times [2025-03-15 01:55:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396240231] [2025-03-15 01:55:44,435 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:55:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:44,446 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:55:44,446 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:44,712 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:44,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:44,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396240231] [2025-03-15 01:55:44,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396240231] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:44,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:44,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:44,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949629873] [2025-03-15 01:55:44,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:44,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:44,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:44,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:44,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:44,715 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:44,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 1608 transitions, 52481 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:44,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:44,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:44,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:49,721 INFO L124 PetriNetUnfolderBase]: 4586/11359 cut-off events. [2025-03-15 01:55:49,721 INFO L125 PetriNetUnfolderBase]: For 380702/382427 co-relation queries the response was YES. [2025-03-15 01:55:49,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129121 conditions, 11359 events. 4586/11359 cut-off events. For 380702/382427 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 91708 event pairs, 1304 based on Foata normal form. 2/10277 useless extension candidates. Maximal degree in co-relation 127242. Up to 7104 conditions per place. [2025-03-15 01:55:49,827 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1370 selfloop transitions, 264 changer transitions 0/1853 dead transitions. [2025-03-15 01:55:49,827 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1853 transitions, 63397 flow [2025-03-15 01:55:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 01:55:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 01:55:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3038 transitions. [2025-03-15 01:55:49,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.42806819783006905 [2025-03-15 01:55:49,830 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 296 predicate places. [2025-03-15 01:55:49,830 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 1853 transitions, 63397 flow [2025-03-15 01:55:49,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:49,831 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:49,831 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:49,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:55:49,831 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1371737852, now seen corresponding path program 13 times [2025-03-15 01:55:49,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:49,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606647634] [2025-03-15 01:55:49,832 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:55:49,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:49,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:55:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:50,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:50,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606647634] [2025-03-15 01:55:50,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606647634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:50,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:50,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:55:50,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690288415] [2025-03-15 01:55:50,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:50,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:55:50,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:50,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:55:50,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:55:50,159 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:55:50,160 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 1853 transitions, 63397 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:50,160 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:50,160 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:55:50,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:55:55,554 INFO L124 PetriNetUnfolderBase]: 4995/12408 cut-off events. [2025-03-15 01:55:55,554 INFO L125 PetriNetUnfolderBase]: For 450078/452051 co-relation queries the response was YES. [2025-03-15 01:55:55,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147611 conditions, 12408 events. 4995/12408 cut-off events. For 450078/452051 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 102728 event pairs, 1305 based on Foata normal form. 2/11254 useless extension candidates. Maximal degree in co-relation 145659. Up to 7830 conditions per place. [2025-03-15 01:55:55,680 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1573 selfloop transitions, 318 changer transitions 0/2110 dead transitions. [2025-03-15 01:55:55,681 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 492 places, 2110 transitions, 75795 flow [2025-03-15 01:55:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-15 01:55:55,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-15 01:55:55,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2939 transitions. [2025-03-15 01:55:55,683 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43252391464311996 [2025-03-15 01:55:55,683 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 340 predicate places. [2025-03-15 01:55:55,683 INFO L471 AbstractCegarLoop]: Abstraction has has 492 places, 2110 transitions, 75795 flow [2025-03-15 01:55:55,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:55,683 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:55:55,684 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:55:55,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:55:55,684 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:55:55,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:55:55,684 INFO L85 PathProgramCache]: Analyzing trace with hash 247249620, now seen corresponding path program 14 times [2025-03-15 01:55:55,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:55:55,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6581624] [2025-03-15 01:55:55,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:55:55,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:55:55,693 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:55:55,694 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:55:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:55:55,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:55:55,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6581624] [2025-03-15 01:55:55,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6581624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:55:55,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:55:55,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:55:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714567488] [2025-03-15 01:55:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:55:55,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:55:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:55:55,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:55:55,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:55:55,816 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:55:55,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 492 places, 2110 transitions, 75795 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:55:55,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:55:55,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:55:55,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:01,038 INFO L124 PetriNetUnfolderBase]: 4995/12421 cut-off events. [2025-03-15 01:56:01,038 INFO L125 PetriNetUnfolderBase]: For 500504/502523 co-relation queries the response was YES. [2025-03-15 01:56:01,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 153882 conditions, 12421 events. 4995/12421 cut-off events. For 500504/502523 co-relation queries the response was YES. Maximal size of possible extension queue 251. Compared 102774 event pairs, 1335 based on Foata normal form. 10/11275 useless extension candidates. Maximal degree in co-relation 151855. Up to 7834 conditions per place. [2025-03-15 01:56:01,183 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 1494 selfloop transitions, 236 changer transitions 0/2113 dead transitions. [2025-03-15 01:56:01,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2113 transitions, 79385 flow [2025-03-15 01:56:01,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:56:01,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:56:01,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 692 transitions. [2025-03-15 01:56:01,184 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5091979396615158 [2025-03-15 01:56:01,185 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 348 predicate places. [2025-03-15 01:56:01,185 INFO L471 AbstractCegarLoop]: Abstraction has has 500 places, 2113 transitions, 79385 flow [2025-03-15 01:56:01,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:01,185 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:01,185 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:01,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 01:56:01,185 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:01,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:01,186 INFO L85 PathProgramCache]: Analyzing trace with hash 881890964, now seen corresponding path program 15 times [2025-03-15 01:56:01,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:01,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933197414] [2025-03-15 01:56:01,186 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:56:01,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:01,198 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:56:01,198 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:01,304 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:01,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:01,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933197414] [2025-03-15 01:56:01,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933197414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:56:01,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120911313] [2025-03-15 01:56:01,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:01,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:56:01,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:01,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:56:01,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:56:01,305 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:56:01,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 500 places, 2113 transitions, 79385 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:01,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:01,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:56:01,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:06,451 INFO L124 PetriNetUnfolderBase]: 4902/12225 cut-off events. [2025-03-15 01:56:06,451 INFO L125 PetriNetUnfolderBase]: For 545090/547032 co-relation queries the response was YES. [2025-03-15 01:56:06,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157664 conditions, 12225 events. 4902/12225 cut-off events. For 545090/547032 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 100894 event pairs, 1287 based on Foata normal form. 20/11096 useless extension candidates. Maximal degree in co-relation 155562. Up to 7728 conditions per place. [2025-03-15 01:56:06,593 INFO L140 encePairwiseOnDemand]: 135/151 looper letters, 1511 selfloop transitions, 182 changer transitions 0/2062 dead transitions. [2025-03-15 01:56:06,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 2062 transitions, 80881 flow [2025-03-15 01:56:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:56:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:56:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 694 transitions. [2025-03-15 01:56:06,595 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5106696100073583 [2025-03-15 01:56:06,595 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 354 predicate places. [2025-03-15 01:56:06,595 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 2062 transitions, 80881 flow [2025-03-15 01:56:06,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:06,595 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:06,595 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:06,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 01:56:06,596 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:06,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:06,596 INFO L85 PathProgramCache]: Analyzing trace with hash 863376007, now seen corresponding path program 5 times [2025-03-15 01:56:06,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:06,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525784962] [2025-03-15 01:56:06,596 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:56:06,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:06,613 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:56:06,613 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:06,929 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-15 01:56:06,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525784962] [2025-03-15 01:56:06,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525784962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:56:06,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163431192] [2025-03-15 01:56:06,930 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:56:06,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:56:06,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:56:06,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:56:06,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 01:56:07,031 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:56:07,031 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:07,033 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 01:56:07,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:56:07,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 01:56:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:07,224 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:56:07,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163431192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:07,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:56:07,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 01:56:07,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110743011] [2025-03-15 01:56:07,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:07,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:56:07,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:07,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:56:07,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:56:07,226 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:56:07,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 2062 transitions, 80881 flow. Second operand has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:07,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:07,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:56:07,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:12,094 INFO L124 PetriNetUnfolderBase]: 4507/11214 cut-off events. [2025-03-15 01:56:12,094 INFO L125 PetriNetUnfolderBase]: For 555700/557650 co-relation queries the response was YES. [2025-03-15 01:56:12,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 151375 conditions, 11214 events. 4507/11214 cut-off events. For 555700/557650 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 90213 event pairs, 1286 based on Foata normal form. 12/10147 useless extension candidates. Maximal degree in co-relation 149198. Up to 7021 conditions per place. [2025-03-15 01:56:12,224 INFO L140 encePairwiseOnDemand]: 135/151 looper letters, 1344 selfloop transitions, 187 changer transitions 0/1853 dead transitions. [2025-03-15 01:56:12,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1853 transitions, 75887 flow [2025-03-15 01:56:12,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:56:12,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:56:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 753 transitions. [2025-03-15 01:56:12,226 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4986754966887417 [2025-03-15 01:56:12,226 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 341 predicate places. [2025-03-15 01:56:12,226 INFO L471 AbstractCegarLoop]: Abstraction has has 493 places, 1853 transitions, 75887 flow [2025-03-15 01:56:12,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:12,227 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:12,227 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:12,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 01:56:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-15 01:56:12,427 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1499361243, now seen corresponding path program 6 times [2025-03-15 01:56:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 01:56:12,428 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:56:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:12,438 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:56:12,438 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:12,685 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:12,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:12,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425770293] [2025-03-15 01:56:12,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425770293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:12,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:12,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 01:56:12,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151876616] [2025-03-15 01:56:12,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:12,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:56:12,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:12,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:56:12,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:56:12,687 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 01:56:12,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 493 places, 1853 transitions, 75887 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:12,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:12,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 01:56:12,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:19,741 INFO L124 PetriNetUnfolderBase]: 5758/13749 cut-off events. [2025-03-15 01:56:19,742 INFO L125 PetriNetUnfolderBase]: For 694910/695715 co-relation queries the response was YES. [2025-03-15 01:56:19,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192966 conditions, 13749 events. 5758/13749 cut-off events. For 694910/695715 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 113007 event pairs, 1101 based on Foata normal form. 0/12539 useless extension candidates. Maximal degree in co-relation 190714. Up to 8579 conditions per place. [2025-03-15 01:56:19,910 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 1937 selfloop transitions, 534 changer transitions 0/2679 dead transitions. [2025-03-15 01:56:19,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 2679 transitions, 110923 flow [2025-03-15 01:56:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-15 01:56:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-15 01:56:19,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2422 transitions. [2025-03-15 01:56:19,913 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4009933774834437 [2025-03-15 01:56:19,914 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 380 predicate places. [2025-03-15 01:56:19,915 INFO L471 AbstractCegarLoop]: Abstraction has has 532 places, 2679 transitions, 110923 flow [2025-03-15 01:56:19,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:19,915 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:19,915 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:19,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:56:19,915 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:19,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1100670130, now seen corresponding path program 16 times [2025-03-15 01:56:19,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:19,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360330611] [2025-03-15 01:56:19,916 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:56:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:19,931 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:56:19,932 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:20,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:20,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360330611] [2025-03-15 01:56:20,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360330611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:20,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:20,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:56:20,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168794842] [2025-03-15 01:56:20,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:20,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:56:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:20,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:56:20,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:56:20,111 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:56:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 532 places, 2679 transitions, 110923 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:20,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:20,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:56:20,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:27,181 INFO L124 PetriNetUnfolderBase]: 6089/14449 cut-off events. [2025-03-15 01:56:27,181 INFO L125 PetriNetUnfolderBase]: For 824086/824951 co-relation queries the response was YES. [2025-03-15 01:56:27,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210806 conditions, 14449 events. 6089/14449 cut-off events. For 824086/824951 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 120261 event pairs, 1253 based on Foata normal form. 8/13206 useless extension candidates. Maximal degree in co-relation 208479. Up to 9274 conditions per place. [2025-03-15 01:56:27,351 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 2128 selfloop transitions, 141 changer transitions 0/2845 dead transitions. [2025-03-15 01:56:27,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 2845 transitions, 123831 flow [2025-03-15 01:56:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:56:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:56:27,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 714 transitions. [2025-03-15 01:56:27,352 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5253863134657837 [2025-03-15 01:56:27,352 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 388 predicate places. [2025-03-15 01:56:27,352 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 2845 transitions, 123831 flow [2025-03-15 01:56:27,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:27,353 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:27,353 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:27,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 01:56:27,353 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:27,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:27,354 INFO L85 PathProgramCache]: Analyzing trace with hash 792124092, now seen corresponding path program 17 times [2025-03-15 01:56:27,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:27,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284243952] [2025-03-15 01:56:27,354 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:56:27,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:27,367 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:56:27,367 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:27,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:27,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284243952] [2025-03-15 01:56:27,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284243952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:27,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:27,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:56:27,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878430174] [2025-03-15 01:56:27,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:27,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:56:27,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:27,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:56:27,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:56:27,688 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 151 [2025-03-15 01:56:27,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 2845 transitions, 123831 flow. Second operand has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:27,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:27,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 151 [2025-03-15 01:56:27,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:38,864 INFO L124 PetriNetUnfolderBase]: 6929/16439 cut-off events. [2025-03-15 01:56:38,864 INFO L125 PetriNetUnfolderBase]: For 950364/951669 co-relation queries the response was YES. [2025-03-15 01:56:38,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250902 conditions, 16439 events. 6929/16439 cut-off events. For 950364/951669 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 140898 event pairs, 1124 based on Foata normal form. 12/15024 useless extension candidates. Maximal degree in co-relation 248502. Up to 10614 conditions per place. [2025-03-15 01:56:39,120 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 2881 selfloop transitions, 464 changer transitions 0/3485 dead transitions. [2025-03-15 01:56:39,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 3485 transitions, 151809 flow [2025-03-15 01:56:39,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-15 01:56:39,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-15 01:56:39,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2221 transitions. [2025-03-15 01:56:39,122 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.40857247976453276 [2025-03-15 01:56:39,123 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 423 predicate places. [2025-03-15 01:56:39,123 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 3485 transitions, 151809 flow [2025-03-15 01:56:39,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 55.857142857142854) internal successors, (782), 14 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:39,123 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:39,123 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:39,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 01:56:39,123 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:39,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:39,124 INFO L85 PathProgramCache]: Analyzing trace with hash 876313689, now seen corresponding path program 7 times [2025-03-15 01:56:39,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:39,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854234677] [2025-03-15 01:56:39,124 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:56:39,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:56:39,746 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:39,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:39,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854234677] [2025-03-15 01:56:39,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854234677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:39,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:39,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 01:56:39,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562047407] [2025-03-15 01:56:39,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:39,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:56:39,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:39,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:56:39,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:56:39,748 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 01:56:39,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 3485 transitions, 151809 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:39,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:39,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 01:56:39,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:56:54,537 INFO L124 PetriNetUnfolderBase]: 7497/17756 cut-off events. [2025-03-15 01:56:54,537 INFO L125 PetriNetUnfolderBase]: For 1043938/1045219 co-relation queries the response was YES. [2025-03-15 01:56:54,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282551 conditions, 17756 events. 7497/17756 cut-off events. For 1043938/1045219 co-relation queries the response was YES. Maximal size of possible extension queue 402. Compared 154626 event pairs, 1114 based on Foata normal form. 8/16249 useless extension candidates. Maximal degree in co-relation 280076. Up to 11636 conditions per place. [2025-03-15 01:56:54,811 INFO L140 encePairwiseOnDemand]: 129/151 looper letters, 3080 selfloop transitions, 834 changer transitions 0/4126 dead transitions. [2025-03-15 01:56:54,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 4126 transitions, 179839 flow [2025-03-15 01:56:54,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-15 01:56:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-15 01:56:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 3134 transitions. [2025-03-15 01:56:54,814 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3843512386558744 [2025-03-15 01:56:54,814 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 476 predicate places. [2025-03-15 01:56:54,814 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 4126 transitions, 179839 flow [2025-03-15 01:56:54,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:54,815 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:56:54,815 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:56:54,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 01:56:54,815 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:56:54,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:56:54,816 INFO L85 PathProgramCache]: Analyzing trace with hash -700505913, now seen corresponding path program 8 times [2025-03-15 01:56:54,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:56:54,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827315676] [2025-03-15 01:56:54,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:56:54,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:56:54,826 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:56:54,826 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:56:55,096 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:56:55,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:56:55,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827315676] [2025-03-15 01:56:55,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827315676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:56:55,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:56:55,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 01:56:55,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143160739] [2025-03-15 01:56:55,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:56:55,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:56:55,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:56:55,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:56:55,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:56:55,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 01:56:55,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 4126 transitions, 179839 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:56:55,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:56:55,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 01:56:55,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:57:15,424 INFO L124 PetriNetUnfolderBase]: 7845/18585 cut-off events. [2025-03-15 01:57:15,425 INFO L125 PetriNetUnfolderBase]: For 1114854/1116205 co-relation queries the response was YES. [2025-03-15 01:57:15,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308288 conditions, 18585 events. 7845/18585 cut-off events. For 1114854/1116205 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 163252 event pairs, 1128 based on Foata normal form. 8/17013 useless extension candidates. Maximal degree in co-relation 305738. Up to 12296 conditions per place. [2025-03-15 01:57:15,827 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 3238 selfloop transitions, 914 changer transitions 0/4364 dead transitions. [2025-03-15 01:57:15,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 671 places, 4364 transitions, 196649 flow [2025-03-15 01:57:15,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-15 01:57:15,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-15 01:57:15,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2590 transitions. [2025-03-15 01:57:15,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.38982540638169777 [2025-03-15 01:57:15,830 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 519 predicate places. [2025-03-15 01:57:15,830 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 4364 transitions, 196649 flow [2025-03-15 01:57:15,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:15,831 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:57:15,831 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:57:15,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 01:57:15,831 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:57:15,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:57:15,832 INFO L85 PathProgramCache]: Analyzing trace with hash -332364140, now seen corresponding path program 18 times [2025-03-15 01:57:15,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:57:15,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016951003] [2025-03-15 01:57:15,832 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:57:15,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:57:15,842 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:57:15,842 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:57:15,953 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:57:15,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:57:15,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016951003] [2025-03-15 01:57:15,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016951003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:57:15,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:57:15,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:57:15,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788014391] [2025-03-15 01:57:15,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:57:15,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:57:15,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:57:15,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:57:15,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:57:15,955 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:57:15,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 4364 transitions, 196649 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:15,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:57:15,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:57:15,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:57:28,859 INFO L124 PetriNetUnfolderBase]: 6933/16470 cut-off events. [2025-03-15 01:57:28,859 INFO L125 PetriNetUnfolderBase]: For 1103389/1104684 co-relation queries the response was YES. [2025-03-15 01:57:28,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284420 conditions, 16470 events. 6933/16470 cut-off events. For 1103389/1104684 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 141303 event pairs, 1093 based on Foata normal form. 8/15050 useless extension candidates. Maximal degree in co-relation 281795. Up to 10622 conditions per place. [2025-03-15 01:57:29,124 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 2447 selfloop transitions, 239 changer transitions 0/3672 dead transitions. [2025-03-15 01:57:29,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 3672 transitions, 176277 flow [2025-03-15 01:57:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:57:29,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:57:29,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 709 transitions. [2025-03-15 01:57:29,125 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5217071376011774 [2025-03-15 01:57:29,125 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 493 predicate places. [2025-03-15 01:57:29,125 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 3672 transitions, 176277 flow [2025-03-15 01:57:29,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:29,126 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:57:29,126 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:57:29,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 01:57:29,126 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:57:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:57:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -65864569, now seen corresponding path program 9 times [2025-03-15 01:57:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:57:29,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013622473] [2025-03-15 01:57:29,127 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:57:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:57:29,135 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:57:29,136 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:57:29,393 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:57:29,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:57:29,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013622473] [2025-03-15 01:57:29,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013622473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:57:29,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:57:29,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 01:57:29,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633159437] [2025-03-15 01:57:29,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:57:29,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 01:57:29,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:57:29,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 01:57:29,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2025-03-15 01:57:29,394 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 01:57:29,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 3672 transitions, 176277 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:29,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:57:29,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 01:57:29,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:57:45,005 INFO L124 PetriNetUnfolderBase]: 7464/17707 cut-off events. [2025-03-15 01:57:45,005 INFO L125 PetriNetUnfolderBase]: For 1206383/1207875 co-relation queries the response was YES. [2025-03-15 01:57:45,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 317392 conditions, 17707 events. 7464/17707 cut-off events. For 1206383/1207875 co-relation queries the response was YES. Maximal size of possible extension queue 410. Compared 154275 event pairs, 1129 based on Foata normal form. 8/16212 useless extension candidates. Maximal degree in co-relation 314692. Up to 11646 conditions per place. [2025-03-15 01:57:45,268 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 3128 selfloop transitions, 723 changer transitions 0/4063 dead transitions. [2025-03-15 01:57:45,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 4063 transitions, 199917 flow [2025-03-15 01:57:45,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-15 01:57:45,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-15 01:57:45,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 2296 transitions. [2025-03-15 01:57:45,270 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4001394214011851 [2025-03-15 01:57:45,271 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 530 predicate places. [2025-03-15 01:57:45,271 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 4063 transitions, 199917 flow [2025-03-15 01:57:45,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:45,271 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:57:45,271 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:57:45,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 01:57:45,271 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:57:45,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:57:45,272 INFO L85 PathProgramCache]: Analyzing trace with hash 430822750, now seen corresponding path program 19 times [2025-03-15 01:57:45,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:57:45,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668536741] [2025-03-15 01:57:45,272 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:57:45,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:57:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:57:45,555 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:57:45,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:57:45,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668536741] [2025-03-15 01:57:45,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668536741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:57:45,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:57:45,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:57:45,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982289377] [2025-03-15 01:57:45,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:57:45,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:57:45,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:57:45,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:57:45,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:57:45,556 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:57:45,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 4063 transitions, 199917 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:57:45,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:57:45,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:57:45,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:58:01,772 INFO L124 PetriNetUnfolderBase]: 7973/18945 cut-off events. [2025-03-15 01:58:01,773 INFO L125 PetriNetUnfolderBase]: For 1362162/1363843 co-relation queries the response was YES. [2025-03-15 01:58:01,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 349587 conditions, 18945 events. 7973/18945 cut-off events. For 1362162/1363843 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 167911 event pairs, 1131 based on Foata normal form. 14/17389 useless extension candidates. Maximal degree in co-relation 346814. Up to 12540 conditions per place. [2025-03-15 01:58:02,059 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 3222 selfloop transitions, 449 changer transitions 0/4365 dead transitions. [2025-03-15 01:58:02,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 4365 transitions, 223089 flow [2025-03-15 01:58:02,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-15 01:58:02,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2025-03-15 01:58:02,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 2375 transitions. [2025-03-15 01:58:02,062 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43690213392200145 [2025-03-15 01:58:02,062 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 565 predicate places. [2025-03-15 01:58:02,062 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 4365 transitions, 223089 flow [2025-03-15 01:58:02,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:02,062 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:58:02,063 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:58:02,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 01:58:02,063 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:58:02,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:58:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1381582450, now seen corresponding path program 20 times [2025-03-15 01:58:02,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:58:02,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436658226] [2025-03-15 01:58:02,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:58:02,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:58:02,074 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:58:02,074 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:58:02,493 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:58:02,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:58:02,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436658226] [2025-03-15 01:58:02,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436658226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:58:02,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:58:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:58:02,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568531546] [2025-03-15 01:58:02,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:58:02,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:58:02,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:58:02,495 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:58:02,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:58:02,495 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:58:02,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 4365 transitions, 223089 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:02,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:58:02,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:58:02,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:58:22,748 INFO L124 PetriNetUnfolderBase]: 8783/20858 cut-off events. [2025-03-15 01:58:22,748 INFO L125 PetriNetUnfolderBase]: For 1588164/1590023 co-relation queries the response was YES. [2025-03-15 01:58:22,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394746 conditions, 20858 events. 8783/20858 cut-off events. For 1588164/1590023 co-relation queries the response was YES. Maximal size of possible extension queue 479. Compared 188073 event pairs, 1138 based on Foata normal form. 4/19185 useless extension candidates. Maximal degree in co-relation 391900. Up to 13892 conditions per place. [2025-03-15 01:58:23,054 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 3448 selfloop transitions, 662 changer transitions 0/4804 dead transitions. [2025-03-15 01:58:23,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 761 places, 4804 transitions, 255161 flow [2025-03-15 01:58:23,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-15 01:58:23,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-15 01:58:23,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2905 transitions. [2025-03-15 01:58:23,056 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4275202354672553 [2025-03-15 01:58:23,056 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 609 predicate places. [2025-03-15 01:58:23,056 INFO L471 AbstractCegarLoop]: Abstraction has has 761 places, 4804 transitions, 255161 flow [2025-03-15 01:58:23,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:23,057 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:58:23,057 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:58:23,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 01:58:23,057 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:58:23,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:58:23,057 INFO L85 PathProgramCache]: Analyzing trace with hash 564674567, now seen corresponding path program 10 times [2025-03-15 01:58:23,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:58:23,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387337079] [2025-03-15 01:58:23,058 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:58:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:58:23,068 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:58:23,068 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:58:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:58:23,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:58:23,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387337079] [2025-03-15 01:58:23,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387337079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:58:23,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:58:23,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:58:23,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140666199] [2025-03-15 01:58:23,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:58:23,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:58:23,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:58:23,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:58:23,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:58:23,223 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:58:23,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 761 places, 4804 transitions, 255161 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:23,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:58:23,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:58:23,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:58:43,624 INFO L124 PetriNetUnfolderBase]: 8611/20472 cut-off events. [2025-03-15 01:58:43,625 INFO L125 PetriNetUnfolderBase]: For 1679687/1681579 co-relation queries the response was YES. [2025-03-15 01:58:43,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397325 conditions, 20472 events. 8611/20472 cut-off events. For 1679687/1681579 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 183905 event pairs, 1135 based on Foata normal form. 8/18807 useless extension candidates. Maximal degree in co-relation 394404. Up to 13622 conditions per place. [2025-03-15 01:58:43,941 INFO L140 encePairwiseOnDemand]: 137/151 looper letters, 3071 selfloop transitions, 305 changer transitions 0/4716 dead transitions. [2025-03-15 01:58:43,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 769 places, 4716 transitions, 256217 flow [2025-03-15 01:58:43,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:58:43,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:58:43,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 706 transitions. [2025-03-15 01:58:43,942 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5194996320824136 [2025-03-15 01:58:43,944 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 617 predicate places. [2025-03-15 01:58:43,944 INFO L471 AbstractCegarLoop]: Abstraction has has 769 places, 4716 transitions, 256217 flow [2025-03-15 01:58:43,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:43,944 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:58:43,944 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:58:43,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 01:58:43,945 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:58:43,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:58:43,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1508732014, now seen corresponding path program 21 times [2025-03-15 01:58:43,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:58:43,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100312395] [2025-03-15 01:58:43,946 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:58:43,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:58:43,956 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:58:43,956 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:58:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:58:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:58:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100312395] [2025-03-15 01:58:44,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100312395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:58:44,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:58:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 01:58:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835060175] [2025-03-15 01:58:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:58:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 01:58:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:58:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 01:58:44,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-15 01:58:44,177 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 01:58:44,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 769 places, 4716 transitions, 256217 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:58:44,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:58:44,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 01:58:44,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:59:09,605 INFO L124 PetriNetUnfolderBase]: 9448/22398 cut-off events. [2025-03-15 01:59:09,606 INFO L125 PetriNetUnfolderBase]: For 1953706/1956010 co-relation queries the response was YES. [2025-03-15 01:59:09,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446411 conditions, 22398 events. 9448/22398 cut-off events. For 1953706/1956010 co-relation queries the response was YES. Maximal size of possible extension queue 509. Compared 204161 event pairs, 1179 based on Foata normal form. 4/20618 useless extension candidates. Maximal degree in co-relation 443417. Up to 15061 conditions per place. [2025-03-15 01:59:09,996 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 3866 selfloop transitions, 612 changer transitions 0/5172 dead transitions. [2025-03-15 01:59:09,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 808 places, 5172 transitions, 291317 flow [2025-03-15 01:59:09,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-15 01:59:09,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-03-15 01:59:09,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 2622 transitions. [2025-03-15 01:59:09,998 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.43410596026490067 [2025-03-15 01:59:09,998 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 656 predicate places. [2025-03-15 01:59:09,998 INFO L471 AbstractCegarLoop]: Abstraction has has 808 places, 5172 transitions, 291317 flow [2025-03-15 01:59:09,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:59:09,999 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:59:09,999 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:59:09,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 01:59:09,999 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:59:10,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:59:10,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1892823897, now seen corresponding path program 11 times [2025-03-15 01:59:10,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:59:10,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537372675] [2025-03-15 01:59:10,000 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:59:10,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:59:10,016 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:59:10,016 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:59:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-15 01:59:10,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:59:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537372675] [2025-03-15 01:59:10,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537372675] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 01:59:10,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [984161832] [2025-03-15 01:59:10,293 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:59:10,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:59:10,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:59:10,295 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 01:59:10,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 01:59:10,424 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 01:59:10,424 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:59:10,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-15 01:59:10,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 01:59:10,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-15 01:59:10,652 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:59:10,652 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 01:59:10,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [984161832] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:59:10,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 01:59:10,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 18 [2025-03-15 01:59:10,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675938772] [2025-03-15 01:59:10,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:59:10,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:59:10,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:59:10,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:59:10,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2025-03-15 01:59:10,654 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:59:10,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 808 places, 5172 transitions, 291317 flow. Second operand has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:59:10,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:59:10,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:59:10,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:59:38,884 INFO L124 PetriNetUnfolderBase]: 9280/22044 cut-off events. [2025-03-15 01:59:38,884 INFO L125 PetriNetUnfolderBase]: For 2054730/2056944 co-relation queries the response was YES. [2025-03-15 01:59:38,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449422 conditions, 22044 events. 9280/22044 cut-off events. For 2054730/2056944 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 200475 event pairs, 1164 based on Foata normal form. 8/20269 useless extension candidates. Maximal degree in co-relation 446353. Up to 14794 conditions per place. [2025-03-15 01:59:39,277 INFO L140 encePairwiseOnDemand]: 135/151 looper letters, 3414 selfloop transitions, 206 changer transitions 0/5084 dead transitions. [2025-03-15 01:59:39,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 817 places, 5084 transitions, 292509 flow [2025-03-15 01:59:39,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:59:39,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:59:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 766 transitions. [2025-03-15 01:59:39,278 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5072847682119205 [2025-03-15 01:59:39,278 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 665 predicate places. [2025-03-15 01:59:39,278 INFO L471 AbstractCegarLoop]: Abstraction has has 817 places, 5084 transitions, 292509 flow [2025-03-15 01:59:39,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 64.1) internal successors, (641), 10 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:59:39,279 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:59:39,279 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:59:39,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 01:59:39,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 01:59:39,479 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 01:59:39,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:59:39,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1200185976, now seen corresponding path program 22 times [2025-03-15 01:59:39,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:59:39,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290378206] [2025-03-15 01:59:39,480 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:59:39,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:59:39,493 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:59:39,493 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:59:39,797 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 01:59:39,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:59:39,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290378206] [2025-03-15 01:59:39,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290378206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:59:39,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:59:39,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:59:39,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518707411] [2025-03-15 01:59:39,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:59:39,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 01:59:39,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:59:39,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 01:59:39,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 01:59:39,799 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 01:59:39,799 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 817 places, 5084 transitions, 292509 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:59:39,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:59:39,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 01:59:39,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:00:06,513 INFO L124 PetriNetUnfolderBase]: 9067/21564 cut-off events. [2025-03-15 02:00:06,513 INFO L125 PetriNetUnfolderBase]: For 2141757/2144071 co-relation queries the response was YES. [2025-03-15 02:00:06,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 449761 conditions, 21564 events. 9067/21564 cut-off events. For 2141757/2144071 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 195388 event pairs, 1249 based on Foata normal form. 16/19829 useless extension candidates. Maximal degree in co-relation 446617. Up to 14467 conditions per place. [2025-03-15 02:00:06,931 INFO L140 encePairwiseOnDemand]: 135/151 looper letters, 3348 selfloop transitions, 187 changer transitions 0/4999 dead transitions. [2025-03-15 02:00:06,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 825 places, 4999 transitions, 293379 flow [2025-03-15 02:00:06,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:00:06,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:00:06,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 707 transitions. [2025-03-15 02:00:06,932 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5202354672553348 [2025-03-15 02:00:06,932 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 673 predicate places. [2025-03-15 02:00:06,932 INFO L471 AbstractCegarLoop]: Abstraction has has 825 places, 4999 transitions, 293379 flow [2025-03-15 02:00:06,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:00:06,933 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:00:06,933 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:06,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 02:00:06,933 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:00:06,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:00:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1054745172, now seen corresponding path program 23 times [2025-03-15 02:00:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:00:06,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983331265] [2025-03-15 02:00:06,934 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 02:00:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:00:06,948 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 02:00:06,948 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:00:07,559 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-15 02:00:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:00:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983331265] [2025-03-15 02:00:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983331265] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:00:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837978812] [2025-03-15 02:00:07,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 02:00:07,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:00:07,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:00:07,562 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:00:07,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 02:00:07,682 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-15 02:00:07,682 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:00:07,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-15 02:00:07,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:00:07,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-15 02:00:07,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-03-15 02:00:07,986 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:00:07,986 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:00:07,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837978812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:00:07,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:00:07,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 25 [2025-03-15 02:00:07,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379148797] [2025-03-15 02:00:07,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:00:07,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:00:07,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:00:07,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:00:07,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=587, Unknown=0, NotChecked=0, Total=650 [2025-03-15 02:00:07,988 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 151 [2025-03-15 02:00:07,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 825 places, 4999 transitions, 293379 flow. Second operand has 13 states, 13 states have (on average 49.61538461538461) internal successors, (645), 13 states have internal predecessors, (645), 0 states have call successors, (0), 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:00:07,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:00:07,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 151 [2025-03-15 02:00:07,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:00:45,922 INFO L124 PetriNetUnfolderBase]: 10088/23827 cut-off events. [2025-03-15 02:00:45,922 INFO L125 PetriNetUnfolderBase]: For 2457778/2459427 co-relation queries the response was YES. [2025-03-15 02:00:46,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515624 conditions, 23827 events. 10088/23827 cut-off events. For 2457778/2459427 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 218688 event pairs, 1085 based on Foata normal form. 0/21897 useless extension candidates. Maximal degree in co-relation 512405. Up to 15968 conditions per place. [2025-03-15 02:00:46,353 INFO L140 encePairwiseOnDemand]: 128/151 looper letters, 5739 selfloop transitions, 355 changer transitions 0/6227 dead transitions. [2025-03-15 02:00:46,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 861 places, 6227 transitions, 356749 flow [2025-03-15 02:00:46,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-15 02:00:46,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-03-15 02:00:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 2151 transitions. [2025-03-15 02:00:46,355 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.38500089493466977 [2025-03-15 02:00:46,356 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 709 predicate places. [2025-03-15 02:00:46,356 INFO L471 AbstractCegarLoop]: Abstraction has has 861 places, 6227 transitions, 356749 flow [2025-03-15 02:00:46,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 49.61538461538461) internal successors, (645), 13 states have internal predecessors, (645), 0 states have call successors, (0), 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:00:46,356 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:00:46,356 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:46,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-15 02:00:46,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-03-15 02:00:46,557 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:00:46,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:00:46,558 INFO L85 PathProgramCache]: Analyzing trace with hash -147472879, now seen corresponding path program 12 times [2025-03-15 02:00:46,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:00:46,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057681705] [2025-03-15 02:00:46,558 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 02:00:46,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:00:46,568 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 02:00:46,568 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:00:46,983 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:00:46,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:00:46,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057681705] [2025-03-15 02:00:46,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057681705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:00:46,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:00:46,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 02:00:46,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363417918] [2025-03-15 02:00:46,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:00:46,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:00:46,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:00:46,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:00:46,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:00:46,985 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 02:00:46,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 861 places, 6227 transitions, 356749 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:00:46,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:00:46,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 02:00:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:01:43,073 INFO L124 PetriNetUnfolderBase]: 11194/26335 cut-off events. [2025-03-15 02:01:43,074 INFO L125 PetriNetUnfolderBase]: For 2765442/2767393 co-relation queries the response was YES. [2025-03-15 02:01:43,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588143 conditions, 26335 events. 11194/26335 cut-off events. For 2765442/2767393 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 245791 event pairs, 1133 based on Foata normal form. 0/24273 useless extension candidates. Maximal degree in co-relation 584849. Up to 17750 conditions per place. [2025-03-15 02:01:43,605 INFO L140 encePairwiseOnDemand]: 129/151 looper letters, 6215 selfloop transitions, 666 changer transitions 0/7136 dead transitions. [2025-03-15 02:01:43,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 917 places, 7136 transitions, 418845 flow [2025-03-15 02:01:43,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-15 02:01:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2025-03-15 02:01:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 3320 transitions. [2025-03-15 02:01:43,607 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.38573254327872664 [2025-03-15 02:01:43,608 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 765 predicate places. [2025-03-15 02:01:43,608 INFO L471 AbstractCegarLoop]: Abstraction has has 917 places, 7136 transitions, 418845 flow [2025-03-15 02:01:43,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:01:43,608 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:01:43,608 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:43,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 02:01:43,609 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:01:43,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:01:43,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1212051705, now seen corresponding path program 13 times [2025-03-15 02:01:43,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:01:43,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920433305] [2025-03-15 02:01:43,609 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 02:01:43,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:01:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:01:44,072 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:01:44,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:01:44,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920433305] [2025-03-15 02:01:44,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920433305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:01:44,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:01:44,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 02:01:44,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713945152] [2025-03-15 02:01:44,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:01:44,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:01:44,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:01:44,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:01:44,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:01:44,074 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 02:01:44,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 917 places, 7136 transitions, 418845 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:01:44,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:01:44,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 02:01:44,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:02:51,359 INFO L124 PetriNetUnfolderBase]: 11522/27121 cut-off events. [2025-03-15 02:02:51,360 INFO L125 PetriNetUnfolderBase]: For 2907746/2909844 co-relation queries the response was YES. [2025-03-15 02:02:51,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624935 conditions, 27121 events. 11522/27121 cut-off events. For 2907746/2909844 co-relation queries the response was YES. Maximal size of possible extension queue 613. Compared 254690 event pairs, 1146 based on Foata normal form. 0/25015 useless extension candidates. Maximal degree in co-relation 621566. Up to 18374 conditions per place. [2025-03-15 02:02:51,897 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 6410 selfloop transitions, 705 changer transitions 0/7370 dead transitions. [2025-03-15 02:02:51,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 7370 transitions, 445617 flow [2025-03-15 02:02:51,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-15 02:02:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2025-03-15 02:02:51,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 2774 transitions. [2025-03-15 02:02:51,899 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.3908693814287727 [2025-03-15 02:02:51,899 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 811 predicate places. [2025-03-15 02:02:51,899 INFO L471 AbstractCegarLoop]: Abstraction has has 963 places, 7370 transitions, 445617 flow [2025-03-15 02:02:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:02:51,900 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:02:51,900 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:51,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-15 02:02:51,900 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:02:51,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:02:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1321244743, now seen corresponding path program 14 times [2025-03-15 02:02:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:02:51,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111394424] [2025-03-15 02:02:51,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:02:51,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:02:51,912 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:02:51,912 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:02:52,333 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:02:52,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:02:52,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111394424] [2025-03-15 02:02:52,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111394424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:02:52,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:02:52,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-15 02:02:52,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105137099] [2025-03-15 02:02:52,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:02:52,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:02:52,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:02:52,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:02:52,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:02:52,334 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 151 [2025-03-15 02:02:52,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 963 places, 7370 transitions, 445617 flow. Second operand has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:02:52,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:02:52,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 151 [2025-03-15 02:02:52,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:04:09,462 INFO L124 PetriNetUnfolderBase]: 12046/28353 cut-off events. [2025-03-15 02:04:09,463 INFO L125 PetriNetUnfolderBase]: For 3101403/3103760 co-relation queries the response was YES. [2025-03-15 02:04:09,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673664 conditions, 28353 events. 12046/28353 cut-off events. For 3101403/3103760 co-relation queries the response was YES. Maximal size of possible extension queue 644. Compared 268771 event pairs, 1161 based on Foata normal form. 0/26174 useless extension candidates. Maximal degree in co-relation 670220. Up to 19320 conditions per place. [2025-03-15 02:04:10,220 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 6815 selfloop transitions, 710 changer transitions 0/7780 dead transitions. [2025-03-15 02:04:10,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 7780 transitions, 483971 flow [2025-03-15 02:04:10,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-15 02:04:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-15 02:04:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 2709 transitions. [2025-03-15 02:04:10,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.39867549668874175 [2025-03-15 02:04:10,224 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 855 predicate places. [2025-03-15 02:04:10,224 INFO L471 AbstractCegarLoop]: Abstraction has has 1007 places, 7780 transitions, 483971 flow [2025-03-15 02:04:10,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 54.53333333333333) internal successors, (818), 15 states have internal predecessors, (818), 0 states have call successors, (0), 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:04:10,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:04:10,224 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:10,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 02:04:10,224 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:04:10,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:04:10,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1805177496, now seen corresponding path program 24 times [2025-03-15 02:04:10,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:04:10,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422671828] [2025-03-15 02:04:10,225 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 02:04:10,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:04:10,236 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 02:04:10,236 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:04:10,455 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:04:10,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:04:10,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422671828] [2025-03-15 02:04:10,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422671828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:04:10,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:04:10,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:04:10,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012457478] [2025-03-15 02:04:10,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:04:10,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:04:10,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:04:10,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:04:10,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:04:10,457 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 02:04:10,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1007 places, 7780 transitions, 483971 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 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:04:10,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:04:10,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 02:04:10,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:05:28,021 INFO L124 PetriNetUnfolderBase]: 12784/30078 cut-off events. [2025-03-15 02:05:28,021 INFO L125 PetriNetUnfolderBase]: For 3468476/3470864 co-relation queries the response was YES. [2025-03-15 02:05:28,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731546 conditions, 30078 events. 12784/30078 cut-off events. For 3468476/3470864 co-relation queries the response was YES. Maximal size of possible extension queue 682. Compared 288393 event pairs, 1157 based on Foata normal form. 0/27823 useless extension candidates. Maximal degree in co-relation 728029. Up to 20503 conditions per place. [2025-03-15 02:05:28,664 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 5704 selfloop transitions, 1256 changer transitions 0/8383 dead transitions. [2025-03-15 02:05:28,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1050 places, 8383 transitions, 537077 flow [2025-03-15 02:05:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-15 02:05:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-15 02:05:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 2850 transitions. [2025-03-15 02:05:28,666 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4289584587597833 [2025-03-15 02:05:28,666 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 898 predicate places. [2025-03-15 02:05:28,666 INFO L471 AbstractCegarLoop]: Abstraction has has 1050 places, 8383 transitions, 537077 flow [2025-03-15 02:05:28,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 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:05:28,667 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:05:28,667 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:28,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-15 02:05:28,667 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:05:28,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:05:28,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1670871559, now seen corresponding path program 15 times [2025-03-15 02:05:28,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:05:28,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319766536] [2025-03-15 02:05:28,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 02:05:28,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:05:28,679 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 02:05:28,679 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:05:28,777 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:05:28,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:05:28,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319766536] [2025-03-15 02:05:28,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319766536] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:05:28,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:05:28,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:05:28,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105088476] [2025-03-15 02:05:28,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:05:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:05:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:05:28,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:05:28,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:05:28,779 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 02:05:28,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1050 places, 8383 transitions, 537077 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:05:28,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:05:28,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 02:05:28,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:06:48,924 INFO L124 PetriNetUnfolderBase]: 12639/29763 cut-off events. [2025-03-15 02:06:48,924 INFO L125 PetriNetUnfolderBase]: For 3630820/3633222 co-relation queries the response was YES. [2025-03-15 02:06:49,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 736712 conditions, 29763 events. 12639/29763 cut-off events. For 3630820/3633222 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 284738 event pairs, 1145 based on Foata normal form. 8/27517 useless extension candidates. Maximal degree in co-relation 733120. Up to 20298 conditions per place. [2025-03-15 02:06:49,561 INFO L140 encePairwiseOnDemand]: 136/151 looper letters, 4693 selfloop transitions, 393 changer transitions 0/8244 dead transitions. [2025-03-15 02:06:49,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1058 places, 8244 transitions, 538409 flow [2025-03-15 02:06:49,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:06:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:06:49,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 701 transitions. [2025-03-15 02:06:49,563 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5158204562178073 [2025-03-15 02:06:49,563 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 906 predicate places. [2025-03-15 02:06:49,563 INFO L471 AbstractCegarLoop]: Abstraction has has 1058 places, 8244 transitions, 538409 flow [2025-03-15 02:06:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:06:49,564 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:06:49,564 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:49,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-15 02:06:49,564 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:06:49,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:06:49,565 INFO L85 PathProgramCache]: Analyzing trace with hash -2115733892, now seen corresponding path program 25 times [2025-03-15 02:06:49,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:06:49,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305675636] [2025-03-15 02:06:49,565 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 02:06:49,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:06:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:06:49,859 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:06:49,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:06:49,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305675636] [2025-03-15 02:06:49,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305675636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:06:49,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:06:49,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-15 02:06:49,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899816082] [2025-03-15 02:06:49,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:06:49,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:06:49,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:06:49,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:06:49,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:06:49,860 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 151 [2025-03-15 02:06:49,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1058 places, 8244 transitions, 538409 flow. Second operand has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 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:06:49,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:06:49,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 151 [2025-03-15 02:06:49,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:08:24,460 INFO L124 PetriNetUnfolderBase]: 13263/31238 cut-off events. [2025-03-15 02:08:24,460 INFO L125 PetriNetUnfolderBase]: For 4003927/4006433 co-relation queries the response was YES. [2025-03-15 02:08:24,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790742 conditions, 31238 events. 13263/31238 cut-off events. For 4003927/4006433 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 301745 event pairs, 1176 based on Foata normal form. 4/28913 useless extension candidates. Maximal degree in co-relation 787077. Up to 21348 conditions per place. [2025-03-15 02:08:25,197 INFO L140 encePairwiseOnDemand]: 131/151 looper letters, 5995 selfloop transitions, 1254 changer transitions 0/8671 dead transitions. [2025-03-15 02:08:25,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1099 places, 8671 transitions, 582599 flow [2025-03-15 02:08:25,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-15 02:08:25,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-15 02:08:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 2747 transitions. [2025-03-15 02:08:25,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.4331441185745821 [2025-03-15 02:08:25,200 INFO L298 CegarLoopForPetriNet]: 152 programPoint places, 947 predicate places. [2025-03-15 02:08:25,200 INFO L471 AbstractCegarLoop]: Abstraction has has 1099 places, 8671 transitions, 582599 flow [2025-03-15 02:08:25,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 62.642857142857146) internal successors, (877), 14 states have internal predecessors, (877), 0 states have call successors, (0), 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:08:25,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:08:25,200 INFO L221 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-15 02:08:25,201 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-15 02:08:25,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:08:25,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1811091631, now seen corresponding path program 16 times [2025-03-15 02:08:25,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:08:25,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192146541] [2025-03-15 02:08:25,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 02:08:25,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:08:25,214 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 02:08:25,214 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:08:25,376 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-15 02:08:25,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:08:25,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192146541] [2025-03-15 02:08:25,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192146541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:08:25,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:08:25,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 02:08:25,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160121686] [2025-03-15 02:08:25,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:08:25,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 02:08:25,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:08:25,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 02:08:25,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 02:08:25,378 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 151 [2025-03-15 02:08:25,378 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1099 places, 8671 transitions, 582599 flow. Second operand has 9 states, 9 states have (on average 65.0) internal successors, (585), 9 states have internal predecessors, (585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:08:25,378 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:08:25,378 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 151 [2025-03-15 02:08:25,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 02:08:39,625 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 02:08:39,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:08:39,656 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 15 remaining) [2025-03-15 02:08:39,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2025-03-15 02:08:39,657 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-15 02:08:39,663 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-15 02:08:39,664 INFO L422 BasicCegarLoop]: Path program histogram: [25, 16, 2, 2, 1, 1, 1, 1, 1] [2025-03-15 02:08:39,677 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:08:39,677 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:08:39,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:08:39 BasicIcfg [2025-03-15 02:08:39,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:08:39,688 INFO L158 Benchmark]: Toolchain (without parser) took 825788.96ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 42.3MB in the beginning and 426.2MB in the end (delta: -383.9MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-03-15 02:08:39,688 INFO L158 Benchmark]: CDTParser took 0.20ms. 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:08:39,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.17ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 37.4MB in the end (delta: 4.8MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. [2025-03-15 02:08:39,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.99ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 35.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:08:39,689 INFO L158 Benchmark]: Boogie Preprocessor took 29.83ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 33.5MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:08:39,689 INFO L158 Benchmark]: RCFGBuilder took 368.14ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 38.7MB in the end (delta: -5.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. [2025-03-15 02:08:39,689 INFO L158 Benchmark]: TraceAbstraction took 824906.43ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 37.7MB in the beginning and 426.2MB in the end (delta: -388.5MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-03-15 02:08:39,697 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.20ms. Allocated memory is still 71.3MB. Free memory is still 32.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 432.17ms. Allocated memory is still 71.3MB. Free memory was 42.1MB in the beginning and 37.4MB in the end (delta: 4.8MB). Peak memory consumption was 29.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.99ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 35.1MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.83ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 33.5MB in the end (delta: 1.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 368.14ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 38.7MB in the end (delta: -5.5MB). Peak memory consumption was 16.0MB. Max. memory is 8.0GB. * TraceAbstraction took 824906.43ms. Allocated memory was 71.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 37.7MB in the beginning and 426.2MB in the end (delta: -388.5MB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 933]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 938]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 937]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 923]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - TimeoutResultAtElement [Line: 928]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (9states, 56/151 universal loopers) in iteration 50,while PetriNetUnfolder was constructing finite prefix that currently has 163785 conditions, 5715 events (2240/5714 cut-off events. For 933114/933114 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 54467 event pairs, 48 based on Foata normal form. 16/6225 useless extension candidates. Maximal degree in co-relation 160045. Up to 2915 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 182 locations, 15 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: 824.8s, OverallIterations: 50, TraceHistogramMax: 10, PathProgramHistogramMax: 25, EmptinessCheckTime: 0.0s, AutomataDifference: 806.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10411 SdHoareTripleChecker+Valid, 16.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10411 mSDsluCounter, 20765 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 16976 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 38548 IncrementalHoareTripleChecker+Invalid, 38962 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 3789 mSDtfsCounter, 38548 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2923 GetRequests, 1473 SyntacticMatches, 11 SemanticMatches, 1439 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16745 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=582599occurred in iteration=49, InterpolantAutomatonStates: 1175, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 9070 NumberOfCodeBlocks, 7600 NumberOfCodeBlocksAsserted, 165 NumberOfCheckSat, 9361 ConstructedInterpolants, 0 QuantifiedInterpolants, 54930 SizeOfPredicates, 70 NumberOfNonLiveVariables, 2233 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 61 InterpolantComputations, 47 PerfectInterpolantSequences, 14489/15336 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown