/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/04-mutex_10-ptrmunge_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:53:57,365 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:53:57,475 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:53:57,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:53:57,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:53:57,503 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:53:57,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:53:57,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:53:57,503 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:53:57,503 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:53:57,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:53:57,505 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:53:57,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:53:57,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:53:57,505 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:53:57,740 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:53:57,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:53:57,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:53:57,749 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:53:57,749 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:53:57,751 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2025-03-15 01:53:58,939 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88937d7d4/4d72a7b8abde49fdad9b95fa22131745/FLAG822c2666e [2025-03-15 01:53:59,140 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:53:59,140 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_10-ptrmunge_nr.i [2025-03-15 01:53:59,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88937d7d4/4d72a7b8abde49fdad9b95fa22131745/FLAG822c2666e [2025-03-15 01:53:59,161 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/88937d7d4/4d72a7b8abde49fdad9b95fa22131745 [2025-03-15 01:53:59,163 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:53:59,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:53:59,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:53:59,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:53:59,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:53:59,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,169 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@118faed9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59, skipping insertion in model container [2025-03-15 01:53:59,169 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:53:59,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:53:59,525 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:53:59,563 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:53:59,625 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:53:59,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59 WrapperNode [2025-03-15 01:53:59,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:53:59,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:53:59,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:53:59,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:53:59,631 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:53:59" (1/1) ... [2025-03-15 01:53:59,644 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:53:59" (1/1) ... [2025-03-15 01:53:59,667 INFO L138 Inliner]: procedures = 263, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-03-15 01:53:59,667 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:53:59,668 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:53:59,668 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:53:59,668 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:53:59,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,676 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,688 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,689 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,690 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,690 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,694 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:53:59,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:53:59,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:53:59,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:53:59,699 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (1/1) ... [2025-03-15 01:53:59,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:53:59,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:53:59,726 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:53:59,731 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:53:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:53:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:53:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:53:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:53:59,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:53:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:53:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:53:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:53:59,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:53:59,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:53:59,745 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:53:59,829 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:53:59,830 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:53:59,933 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:53:59,933 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:53:59,949 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:53:59,950 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:53:59,950 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:53:59 BoogieIcfgContainer [2025-03-15 01:53:59,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:53:59,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:53:59,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:53:59,955 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:53:59,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:53:59" (1/3) ... [2025-03-15 01:53:59,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732981c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:53:59, skipping insertion in model container [2025-03-15 01:53:59,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:53:59" (2/3) ... [2025-03-15 01:53:59,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732981c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:53:59, skipping insertion in model container [2025-03-15 01:53:59,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:53:59" (3/3) ... [2025-03-15 01:53:59,956 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_10-ptrmunge_nr.i [2025-03-15 01:53:59,966 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:53:59,968 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_10-ptrmunge_nr.i that has 2 procedures, 75 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-15 01:53:59,968 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:00,026 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:54:00,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:00,069 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;@6264534c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:00,069 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 01:54:00,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:00,097 INFO L124 PetriNetUnfolderBase]: 0/45 cut-off events. [2025-03-15 01:54:00,099 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:00,099 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:00,099 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] [2025-03-15 01:54:00,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:00,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:00,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1907023845, now seen corresponding path program 1 times [2025-03-15 01:54:00,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432433940] [2025-03-15 01:54:00,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:00,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:00,535 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:00,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432433940] [2025-03-15 01:54:00,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432433940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:00,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:00,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:00,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843204654] [2025-03-15 01:54:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:00,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:00,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:00,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:00,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:00,562 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-03-15 01:54:00,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 155 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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:00,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:00,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-03-15 01:54:00,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:00,771 INFO L124 PetriNetUnfolderBase]: 54/241 cut-off events. [2025-03-15 01:54:00,771 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:54:00,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 241 events. 54/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 983 event pairs, 9 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 337. Up to 77 conditions per place. [2025-03-15 01:54:00,776 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 41 selfloop transitions, 9 changer transitions 15/101 dead transitions. [2025-03-15 01:54:00,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 330 flow [2025-03-15 01:54:00,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:00,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:00,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-03-15 01:54:00,793 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6795366795366795 [2025-03-15 01:54:00,795 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 5 predicate places. [2025-03-15 01:54:00,795 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 101 transitions, 330 flow [2025-03-15 01:54:00,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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:00,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:00,796 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] [2025-03-15 01:54:00,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:00,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:00,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:00,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1493854216, now seen corresponding path program 1 times [2025-03-15 01:54:00,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:00,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987726082] [2025-03-15 01:54:00,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:00,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:00,967 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:00,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:00,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987726082] [2025-03-15 01:54:00,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987726082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:00,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:00,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:00,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994363742] [2025-03-15 01:54:00,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:00,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:00,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:00,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:00,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:00,969 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2025-03-15 01:54:00,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 101 transitions, 330 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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:00,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:00,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2025-03-15 01:54:00,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:01,201 INFO L124 PetriNetUnfolderBase]: 98/382 cut-off events. [2025-03-15 01:54:01,201 INFO L125 PetriNetUnfolderBase]: For 64/82 co-relation queries the response was YES. [2025-03-15 01:54:01,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 827 conditions, 382 events. 98/382 cut-off events. For 64/82 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1847 event pairs, 19 based on Foata normal form. 4/365 useless extension candidates. Maximal degree in co-relation 756. Up to 130 conditions per place. [2025-03-15 01:54:01,203 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 45 selfloop transitions, 13 changer transitions 27/125 dead transitions. [2025-03-15 01:54:01,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 125 transitions, 564 flow [2025-03-15 01:54:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:01,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 352 transitions. [2025-03-15 01:54:01,207 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6795366795366795 [2025-03-15 01:54:01,208 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-03-15 01:54:01,208 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 125 transitions, 564 flow [2025-03-15 01:54:01,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 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:01,208 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:01,208 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] [2025-03-15 01:54:01,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:54:01,208 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:01,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:01,209 INFO L85 PathProgramCache]: Analyzing trace with hash 1374385700, now seen corresponding path program 1 times [2025-03-15 01:54:01,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:01,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917040853] [2025-03-15 01:54:01,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:01,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:01,500 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:01,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:01,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917040853] [2025-03-15 01:54:01,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917040853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:01,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949642688] [2025-03-15 01:54:01,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:01,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:01,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:01,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:01,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:01,502 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:01,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 125 transitions, 564 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:01,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:01,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:01,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:01,976 INFO L124 PetriNetUnfolderBase]: 222/657 cut-off events. [2025-03-15 01:54:01,976 INFO L125 PetriNetUnfolderBase]: For 313/335 co-relation queries the response was YES. [2025-03-15 01:54:01,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 657 events. 222/657 cut-off events. For 313/335 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3566 event pairs, 15 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 1807. Up to 221 conditions per place. [2025-03-15 01:54:01,987 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 94 selfloop transitions, 17 changer transitions 90/233 dead transitions. [2025-03-15 01:54:01,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 233 transitions, 1486 flow [2025-03-15 01:54:01,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:54:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:54:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 640 transitions. [2025-03-15 01:54:01,989 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2025-03-15 01:54:01,989 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 25 predicate places. [2025-03-15 01:54:01,989 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 233 transitions, 1486 flow [2025-03-15 01:54:01,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:01,990 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:01,990 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] [2025-03-15 01:54:01,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:01,990 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:01,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1283617448, now seen corresponding path program 1 times [2025-03-15 01:54:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942837262] [2025-03-15 01:54:01,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:02,222 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:02,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:02,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942837262] [2025-03-15 01:54:02,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942837262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:02,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:02,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:02,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200817349] [2025-03-15 01:54:02,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:02,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:02,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:02,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:02,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:02,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:02,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 233 transitions, 1486 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:02,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:02,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:02,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:02,667 INFO L124 PetriNetUnfolderBase]: 333/905 cut-off events. [2025-03-15 01:54:02,667 INFO L125 PetriNetUnfolderBase]: For 774/797 co-relation queries the response was YES. [2025-03-15 01:54:02,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3256 conditions, 905 events. 333/905 cut-off events. For 774/797 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5265 event pairs, 8 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 3151. Up to 290 conditions per place. [2025-03-15 01:54:02,673 INFO L140 encePairwiseOnDemand]: 60/74 looper letters, 120 selfloop transitions, 23 changer transitions 153/341 dead transitions. [2025-03-15 01:54:02,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 341 transitions, 2712 flow [2025-03-15 01:54:02,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:54:02,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:54:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 640 transitions. [2025-03-15 01:54:02,676 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2025-03-15 01:54:02,676 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 39 predicate places. [2025-03-15 01:54:02,676 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 341 transitions, 2712 flow [2025-03-15 01:54:02,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:02,677 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:02,677 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] [2025-03-15 01:54:02,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:54:02,677 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:02,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:02,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1621031016, now seen corresponding path program 2 times [2025-03-15 01:54:02,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:02,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685263978] [2025-03-15 01:54:02,679 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:02,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:02,691 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:02,691 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:02,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685263978] [2025-03-15 01:54:02,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685263978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:02,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:02,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:02,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818289676] [2025-03-15 01:54:02,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:02,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:02,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:02,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:02,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:02,851 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:02,852 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 341 transitions, 2712 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:02,852 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:02,852 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:02,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:03,483 INFO L124 PetriNetUnfolderBase]: 485/1279 cut-off events. [2025-03-15 01:54:03,483 INFO L125 PetriNetUnfolderBase]: For 1821/1885 co-relation queries the response was YES. [2025-03-15 01:54:03,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5580 conditions, 1279 events. 485/1279 cut-off events. For 1821/1885 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8141 event pairs, 14 based on Foata normal form. 6/1255 useless extension candidates. Maximal degree in co-relation 5458. Up to 442 conditions per place. [2025-03-15 01:54:03,489 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 163 selfloop transitions, 37 changer transitions 230/475 dead transitions. [2025-03-15 01:54:03,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 475 transitions, 4664 flow [2025-03-15 01:54:03,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 01:54:03,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 01:54:03,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1054 transitions. [2025-03-15 01:54:03,492 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5697297297297297 [2025-03-15 01:54:03,492 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 63 predicate places. [2025-03-15 01:54:03,492 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 475 transitions, 4664 flow [2025-03-15 01:54:03,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:03,493 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:03,493 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] [2025-03-15 01:54:03,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:03,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:03,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:03,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1443641940, now seen corresponding path program 2 times [2025-03-15 01:54:03,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:03,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164111175] [2025-03-15 01:54:03,494 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:03,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:03,503 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:03,503 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:03,668 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:03,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:03,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164111175] [2025-03-15 01:54:03,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164111175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:03,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:03,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:03,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548472630] [2025-03-15 01:54:03,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:03,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:03,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:03,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:03,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:03,674 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:03,674 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 475 transitions, 4664 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:03,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:03,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:03,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:04,249 INFO L124 PetriNetUnfolderBase]: 517/1349 cut-off events. [2025-03-15 01:54:04,249 INFO L125 PetriNetUnfolderBase]: For 2739/2860 co-relation queries the response was YES. [2025-03-15 01:54:04,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6896 conditions, 1349 events. 517/1349 cut-off events. For 2739/2860 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 8800 event pairs, 20 based on Foata normal form. 25/1342 useless extension candidates. Maximal degree in co-relation 6757. Up to 492 conditions per place. [2025-03-15 01:54:04,256 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 158 selfloop transitions, 39 changer transitions 291/544 dead transitions. [2025-03-15 01:54:04,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 544 transitions, 6180 flow [2025-03-15 01:54:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 01:54:04,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 01:54:04,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 929 transitions. [2025-03-15 01:54:04,259 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5706388206388207 [2025-03-15 01:54:04,261 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 84 predicate places. [2025-03-15 01:54:04,261 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 544 transitions, 6180 flow [2025-03-15 01:54:04,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:04,262 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:04,262 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] [2025-03-15 01:54:04,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:54:04,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1381714756, now seen corresponding path program 3 times [2025-03-15 01:54:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097476582] [2025-03-15 01:54:04,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:54:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:04,272 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:54:04,273 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:04,401 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:04,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:04,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097476582] [2025-03-15 01:54:04,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097476582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:04,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:04,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:04,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336761900] [2025-03-15 01:54:04,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:04,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:04,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:04,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:04,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:04,404 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:04,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 544 transitions, 6180 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:04,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:04,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:04,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:05,139 INFO L124 PetriNetUnfolderBase]: 572/1494 cut-off events. [2025-03-15 01:54:05,139 INFO L125 PetriNetUnfolderBase]: For 4304/4427 co-relation queries the response was YES. [2025-03-15 01:54:05,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8797 conditions, 1494 events. 572/1494 cut-off events. For 4304/4427 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10188 event pairs, 26 based on Foata normal form. 28/1486 useless extension candidates. Maximal degree in co-relation 8641. Up to 594 conditions per place. [2025-03-15 01:54:05,147 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 163 selfloop transitions, 40 changer transitions 373/627 dead transitions. [2025-03-15 01:54:05,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 627 transitions, 8156 flow [2025-03-15 01:54:05,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-15 01:54:05,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-15 01:54:05,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1208 transitions. [2025-03-15 01:54:05,150 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5629077353215284 [2025-03-15 01:54:05,150 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 112 predicate places. [2025-03-15 01:54:05,151 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 627 transitions, 8156 flow [2025-03-15 01:54:05,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:05,151 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:05,151 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] [2025-03-15 01:54:05,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:05,151 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:05,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1059131156, now seen corresponding path program 3 times [2025-03-15 01:54:05,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:05,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106912856] [2025-03-15 01:54:05,152 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:54:05,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:05,159 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:54:05,159 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:05,319 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:05,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:05,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106912856] [2025-03-15 01:54:05,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106912856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:05,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:05,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:05,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661338844] [2025-03-15 01:54:05,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:05,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:05,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:05,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:05,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:05,321 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:05,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 627 transitions, 8156 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:05,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:05,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:05,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:05,859 INFO L124 PetriNetUnfolderBase]: 569/1506 cut-off events. [2025-03-15 01:54:05,859 INFO L125 PetriNetUnfolderBase]: For 5636/5773 co-relation queries the response was YES. [2025-03-15 01:54:05,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9903 conditions, 1506 events. 569/1506 cut-off events. For 5636/5773 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 10413 event pairs, 24 based on Foata normal form. 18/1494 useless extension candidates. Maximal degree in co-relation 9730. Up to 644 conditions per place. [2025-03-15 01:54:05,867 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 151 selfloop transitions, 23 changer transitions 411/642 dead transitions. [2025-03-15 01:54:05,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 642 transitions, 9418 flow [2025-03-15 01:54:05,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:54:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:54:05,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 763 transitions. [2025-03-15 01:54:05,869 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5728228228228228 [2025-03-15 01:54:05,870 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 129 predicate places. [2025-03-15 01:54:05,870 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 642 transitions, 9418 flow [2025-03-15 01:54:05,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:05,870 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:05,870 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] [2025-03-15 01:54:05,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:54:05,870 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:05,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:05,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1617393568, now seen corresponding path program 4 times [2025-03-15 01:54:05,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:05,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890332977] [2025-03-15 01:54:05,871 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:54:05,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:05,888 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:54:05,888 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:06,042 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:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890332977] [2025-03-15 01:54:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890332977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574939506] [2025-03-15 01:54:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:06,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:06,044 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:06,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 642 transitions, 9418 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:06,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:06,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:06,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:06,604 INFO L124 PetriNetUnfolderBase]: 567/1501 cut-off events. [2025-03-15 01:54:06,604 INFO L125 PetriNetUnfolderBase]: For 7185/7333 co-relation queries the response was YES. [2025-03-15 01:54:06,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10962 conditions, 1501 events. 567/1501 cut-off events. For 7185/7333 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10321 event pairs, 22 based on Foata normal form. 25/1504 useless extension candidates. Maximal degree in co-relation 10772. Up to 642 conditions per place. [2025-03-15 01:54:06,612 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 129 selfloop transitions, 31 changer transitions 444/646 dead transitions. [2025-03-15 01:54:06,612 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 646 transitions, 10602 flow [2025-03-15 01:54:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:54:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:54:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 796 transitions. [2025-03-15 01:54:06,614 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.566145092460882 [2025-03-15 01:54:06,616 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 147 predicate places. [2025-03-15 01:54:06,616 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 646 transitions, 10602 flow [2025-03-15 01:54:06,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:06,616 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:06,616 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] [2025-03-15 01:54:06,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:54:06,617 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:06,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1006419768, now seen corresponding path program 5 times [2025-03-15 01:54:06,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:06,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563802514] [2025-03-15 01:54:06,617 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:54:06,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:06,626 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:06,626 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:06,761 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:06,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:06,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563802514] [2025-03-15 01:54:06,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563802514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:06,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:06,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:06,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600042287] [2025-03-15 01:54:06,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:06,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:06,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:06,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:06,763 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:06,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 646 transitions, 10602 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:06,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:06,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:06,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:07,443 INFO L124 PetriNetUnfolderBase]: 634/1655 cut-off events. [2025-03-15 01:54:07,443 INFO L125 PetriNetUnfolderBase]: For 10027/10255 co-relation queries the response was YES. [2025-03-15 01:54:07,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13413 conditions, 1655 events. 634/1655 cut-off events. For 10027/10255 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 11599 event pairs, 24 based on Foata normal form. 12/1641 useless extension candidates. Maximal degree in co-relation 13206. Up to 725 conditions per place. [2025-03-15 01:54:07,455 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 142 selfloop transitions, 34 changer transitions 499/717 dead transitions. [2025-03-15 01:54:07,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 717 transitions, 13060 flow [2025-03-15 01:54:07,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-15 01:54:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-15 01:54:07,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 1054 transitions. [2025-03-15 01:54:07,457 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5697297297297297 [2025-03-15 01:54:07,457 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 171 predicate places. [2025-03-15 01:54:07,458 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 717 transitions, 13060 flow [2025-03-15 01:54:07,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:07,458 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:07,458 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] [2025-03-15 01:54:07,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:54:07,458 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:07,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:07,459 INFO L85 PathProgramCache]: Analyzing trace with hash 829010132, now seen corresponding path program 4 times [2025-03-15 01:54:07,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:07,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401038266] [2025-03-15 01:54:07,459 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:54:07,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:07,471 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:54:07,471 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:07,587 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:07,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:07,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401038266] [2025-03-15 01:54:07,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401038266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:07,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:07,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:07,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212888371] [2025-03-15 01:54:07,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:07,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:07,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:07,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:07,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:07,588 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:07,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 717 transitions, 13060 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:07,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:07,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:07,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:08,262 INFO L124 PetriNetUnfolderBase]: 666/1747 cut-off events. [2025-03-15 01:54:08,263 INFO L125 PetriNetUnfolderBase]: For 12645/12952 co-relation queries the response was YES. [2025-03-15 01:54:08,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15337 conditions, 1747 events. 666/1747 cut-off events. For 12645/12952 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12501 event pairs, 30 based on Foata normal form. 35/1754 useless extension candidates. Maximal degree in co-relation 15113. Up to 792 conditions per place. [2025-03-15 01:54:08,271 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 137 selfloop transitions, 29 changer transitions 556/774 dead transitions. [2025-03-15 01:54:08,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 774 transitions, 15318 flow [2025-03-15 01:54:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-15 01:54:08,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-15 01:54:08,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 929 transitions. [2025-03-15 01:54:08,273 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5706388206388207 [2025-03-15 01:54:08,274 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 192 predicate places. [2025-03-15 01:54:08,274 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 774 transitions, 15318 flow [2025-03-15 01:54:08,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:08,274 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:08,274 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] [2025-03-15 01:54:08,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:54:08,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:08,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:08,274 INFO L85 PathProgramCache]: Analyzing trace with hash -233104138, now seen corresponding path program 5 times [2025-03-15 01:54:08,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:08,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061678653] [2025-03-15 01:54:08,275 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:54:08,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:08,281 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:08,281 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:08,402 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:08,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:08,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061678653] [2025-03-15 01:54:08,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061678653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:08,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:08,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:08,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394913765] [2025-03-15 01:54:08,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:08,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:08,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:08,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:08,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:08,403 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:08,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 774 transitions, 15318 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:08,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:08,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:08,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:09,254 INFO L124 PetriNetUnfolderBase]: 700/1874 cut-off events. [2025-03-15 01:54:09,255 INFO L125 PetriNetUnfolderBase]: For 15540/15802 co-relation queries the response was YES. [2025-03-15 01:54:09,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17573 conditions, 1874 events. 700/1874 cut-off events. For 15540/15802 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13820 event pairs, 32 based on Foata normal form. 35/1879 useless extension candidates. Maximal degree in co-relation 17332. Up to 875 conditions per place. [2025-03-15 01:54:09,263 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 135 selfloop transitions, 30 changer transitions 624/836 dead transitions. [2025-03-15 01:54:09,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 836 transitions, 17910 flow [2025-03-15 01:54:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-03-15 01:54:09,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-03-15 01:54:09,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1208 transitions. [2025-03-15 01:54:09,265 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5629077353215284 [2025-03-15 01:54:09,266 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 220 predicate places. [2025-03-15 01:54:09,266 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 836 transitions, 17910 flow [2025-03-15 01:54:09,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:09,266 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:09,266 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] [2025-03-15 01:54:09,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:54:09,266 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:09,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:09,267 INFO L85 PathProgramCache]: Analyzing trace with hash 354961184, now seen corresponding path program 6 times [2025-03-15 01:54:09,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:09,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055471706] [2025-03-15 01:54:09,267 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:54:09,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:09,273 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:54:09,273 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:09,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:09,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055471706] [2025-03-15 01:54:09,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055471706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:09,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:09,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:09,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4587925] [2025-03-15 01:54:09,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:09,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:09,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:09,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:09,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:09,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:09,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 836 transitions, 17910 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:09,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:09,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:09,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:09,953 INFO L124 PetriNetUnfolderBase]: 693/1867 cut-off events. [2025-03-15 01:54:09,953 INFO L125 PetriNetUnfolderBase]: For 18547/18852 co-relation queries the response was YES. [2025-03-15 01:54:09,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18859 conditions, 1867 events. 693/1867 cut-off events. For 18547/18852 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 13854 event pairs, 30 based on Foata normal form. 22/1865 useless extension candidates. Maximal degree in co-relation 18601. Up to 874 conditions per place. [2025-03-15 01:54:09,968 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 122 selfloop transitions, 20 changer transitions 658/847 dead transitions. [2025-03-15 01:54:09,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 847 transitions, 19602 flow [2025-03-15 01:54:09,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 01:54:09,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 01:54:09,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 763 transitions. [2025-03-15 01:54:09,970 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5728228228228228 [2025-03-15 01:54:09,970 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 237 predicate places. [2025-03-15 01:54:09,970 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 847 transitions, 19602 flow [2025-03-15 01:54:09,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:09,970 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:09,970 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] [2025-03-15 01:54:09,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:54:09,970 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:09,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:09,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1721842204, now seen corresponding path program 6 times [2025-03-15 01:54:09,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:09,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899758158] [2025-03-15 01:54:09,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:54:09,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:09,980 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:54:09,980 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:10,097 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:10,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:10,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899758158] [2025-03-15 01:54:10,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899758158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:10,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:10,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:10,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169923180] [2025-03-15 01:54:10,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:10,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:10,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:10,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:10,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:10,098 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:10,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 847 transitions, 19602 flow. Second operand has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:10,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:10,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:10,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:10,737 INFO L124 PetriNetUnfolderBase]: 688/1855 cut-off events. [2025-03-15 01:54:10,738 INFO L125 PetriNetUnfolderBase]: For 21248/21560 co-relation queries the response was YES. [2025-03-15 01:54:10,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20084 conditions, 1855 events. 688/1855 cut-off events. For 21248/21560 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 13687 event pairs, 28 based on Foata normal form. 34/1873 useless extension candidates. Maximal degree in co-relation 19809. Up to 862 conditions per place. [2025-03-15 01:54:10,748 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 101 selfloop transitions, 21 changer transitions 691/851 dead transitions. [2025-03-15 01:54:10,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 851 transitions, 21196 flow [2025-03-15 01:54:10,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-15 01:54:10,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-15 01:54:10,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 796 transitions. [2025-03-15 01:54:10,750 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.566145092460882 [2025-03-15 01:54:10,750 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 255 predicate places. [2025-03-15 01:54:10,750 INFO L471 AbstractCegarLoop]: Abstraction has has 333 places, 851 transitions, 21196 flow [2025-03-15 01:54:10,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.45454545454545) internal successors, (412), 11 states have internal predecessors, (412), 0 states have call successors, (0), 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:10,751 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:10,751 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:10,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:54:10,751 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:10,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:10,751 INFO L85 PathProgramCache]: Analyzing trace with hash 589256832, now seen corresponding path program 1 times [2025-03-15 01:54:10,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:10,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881347223] [2025-03-15 01:54:10,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:10,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:10,856 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:10,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:10,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881347223] [2025-03-15 01:54:10,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881347223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:10,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:10,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:10,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272366268] [2025-03-15 01:54:10,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:10,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:10,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:10,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:10,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:10,858 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:10,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 851 transitions, 21196 flow. Second operand has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 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:10,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:10,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:10,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:11,583 INFO L124 PetriNetUnfolderBase]: 705/1923 cut-off events. [2025-03-15 01:54:11,583 INFO L125 PetriNetUnfolderBase]: For 25556/25918 co-relation queries the response was YES. [2025-03-15 01:54:11,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22131 conditions, 1923 events. 705/1923 cut-off events. For 25556/25918 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 14470 event pairs, 28 based on Foata normal form. 39/1948 useless extension candidates. Maximal degree in co-relation 21839. Up to 910 conditions per place. [2025-03-15 01:54:11,594 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 71 selfloop transitions, 22 changer transitions 762/889 dead transitions. [2025-03-15 01:54:11,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 889 transitions, 23700 flow [2025-03-15 01:54:11,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 01:54:11,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-15 01:54:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1091 transitions. [2025-03-15 01:54:11,596 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.567047817047817 [2025-03-15 01:54:11,596 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 280 predicate places. [2025-03-15 01:54:11,596 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 889 transitions, 23700 flow [2025-03-15 01:54:11,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 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:11,596 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:11,596 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] [2025-03-15 01:54:11,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:54:11,596 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:11,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:11,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1280264124, now seen corresponding path program 1 times [2025-03-15 01:54:11,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:11,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829492987] [2025-03-15 01:54:11,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:11,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:11,709 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:11,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:11,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829492987] [2025-03-15 01:54:11,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829492987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:11,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:11,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:11,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525791302] [2025-03-15 01:54:11,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:11,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:11,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:11,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:11,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:11,710 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:11,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 889 transitions, 23700 flow. Second operand has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 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:11,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:11,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:11,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:12,416 INFO L124 PetriNetUnfolderBase]: 727/1984 cut-off events. [2025-03-15 01:54:12,416 INFO L125 PetriNetUnfolderBase]: For 29719/30111 co-relation queries the response was YES. [2025-03-15 01:54:12,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24289 conditions, 1984 events. 727/1984 cut-off events. For 29719/30111 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 15127 event pairs, 28 based on Foata normal form. 40/2012 useless extension candidates. Maximal degree in co-relation 23980. Up to 952 conditions per place. [2025-03-15 01:54:12,425 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 48 selfloop transitions, 15 changer transitions 833/927 dead transitions. [2025-03-15 01:54:12,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 927 transitions, 26324 flow [2025-03-15 01:54:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 01:54:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-15 01:54:12,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1091 transitions. [2025-03-15 01:54:12,426 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.567047817047817 [2025-03-15 01:54:12,427 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 305 predicate places. [2025-03-15 01:54:12,427 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 927 transitions, 26324 flow [2025-03-15 01:54:12,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 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:12,427 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:12,427 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] [2025-03-15 01:54:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:54:12,427 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:12,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash -903354279, now seen corresponding path program 1 times [2025-03-15 01:54:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265725626] [2025-03-15 01:54:12,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:12,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:12,525 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:12,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:12,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265725626] [2025-03-15 01:54:12,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265725626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:12,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:12,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:12,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611367836] [2025-03-15 01:54:12,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:12,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:12,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:12,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:12,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:12,527 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:12,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 927 transitions, 26324 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 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:12,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:12,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:12,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,325 INFO L124 PetriNetUnfolderBase]: 750/2046 cut-off events. [2025-03-15 01:54:13,325 INFO L125 PetriNetUnfolderBase]: For 34430/34802 co-relation queries the response was YES. [2025-03-15 01:54:13,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26462 conditions, 2046 events. 750/2046 cut-off events. For 34430/34802 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 15715 event pairs, 28 based on Foata normal form. 40/2076 useless extension candidates. Maximal degree in co-relation 26136. Up to 995 conditions per place. [2025-03-15 01:54:13,336 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 30 selfloop transitions, 9 changer transitions 889/953 dead transitions. [2025-03-15 01:54:13,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 411 places, 953 transitions, 28728 flow [2025-03-15 01:54:13,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:54:13,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:54:13,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2025-03-15 01:54:13,338 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5544899738448126 [2025-03-15 01:54:13,338 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 333 predicate places. [2025-03-15 01:54:13,338 INFO L471 AbstractCegarLoop]: Abstraction has has 411 places, 953 transitions, 28728 flow [2025-03-15 01:54:13,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 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:13,339 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,339 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] [2025-03-15 01:54:13,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:54:13,339 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:13,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,339 INFO L85 PathProgramCache]: Analyzing trace with hash 812540624, now seen corresponding path program 1 times [2025-03-15 01:54:13,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648685670] [2025-03-15 01:54:13,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,461 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:13,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648685670] [2025-03-15 01:54:13,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648685670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-15 01:54:13,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377643436] [2025-03-15 01:54:13,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 01:54:13,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 01:54:13,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-15 01:54:13,462 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-15 01:54:13,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 953 transitions, 28728 flow. Second operand has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 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:13,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-15 01:54:13,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,247 INFO L124 PetriNetUnfolderBase]: 769/2093 cut-off events. [2025-03-15 01:54:14,247 INFO L125 PetriNetUnfolderBase]: For 39958/40378 co-relation queries the response was YES. [2025-03-15 01:54:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28661 conditions, 2093 events. 769/2093 cut-off events. For 39958/40378 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 16224 event pairs, 28 based on Foata normal form. 52/2137 useless extension candidates. Maximal degree in co-relation 28318. Up to 1033 conditions per place. [2025-03-15 01:54:14,257 INFO L140 encePairwiseOnDemand]: 59/74 looper letters, 0 selfloop transitions, 0 changer transitions 979/979 dead transitions. [2025-03-15 01:54:14,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 979 transitions, 31216 flow [2025-03-15 01:54:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-15 01:54:14,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-03-15 01:54:14,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2025-03-15 01:54:14,260 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5544899738448126 [2025-03-15 01:54:14,260 INFO L298 CegarLoopForPetriNet]: 78 programPoint places, 361 predicate places. [2025-03-15 01:54:14,260 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 979 transitions, 31216 flow [2025-03-15 01:54:14,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.72727272727273) internal successors, (415), 11 states have internal predecessors, (415), 0 states have call successors, (0), 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:14,264 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_10-ptrmunge_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-15 01:54:14,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-15 01:54:14,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:54:14,311 INFO L422 BasicCegarLoop]: Path program histogram: [6, 6, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:14,314 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:54:14,314 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:54:14,318 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:54:14 BasicIcfg [2025-03-15 01:54:14,319 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:54:14,319 INFO L158 Benchmark]: Toolchain (without parser) took 15155.05ms. Allocated memory was 71.3MB in the beginning and 352.3MB in the end (delta: 281.0MB). Free memory was 41.8MB in the beginning and 193.4MB in the end (delta: -151.7MB). Peak memory consumption was 257.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:14,319 INFO L158 Benchmark]: CDTParser took 1.23ms. Allocated memory is still 71.3MB. Free memory is still 32.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:14,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.26ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. [2025-03-15 01:54:14,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.44ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:14,321 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 71.3MB. Free memory was 37.2MB in the beginning and 36.3MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:14,321 INFO L158 Benchmark]: RCFGBuilder took 255.28ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 22.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:54:14,321 INFO L158 Benchmark]: TraceAbstraction took 14366.93ms. Allocated memory was 71.3MB in the beginning and 352.3MB in the end (delta: 281.0MB). Free memory was 21.6MB in the beginning and 193.4MB in the end (delta: -171.8MB). Peak memory consumption was 240.3MB. Max. memory is 8.0GB. [2025-03-15 01:54:14,322 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23ms. Allocated memory is still 71.3MB. Free memory is still 32.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 461.26ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 39.5MB in the end (delta: 2.2MB). Peak memory consumption was 25.3MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 40.44ms. Allocated memory is still 71.3MB. Free memory was 39.5MB in the beginning and 37.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 71.3MB. Free memory was 37.2MB in the beginning and 36.3MB in the end (delta: 943.6kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 255.28ms. Allocated memory is still 71.3MB. Free memory was 36.3MB in the beginning and 22.8MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 14366.93ms. Allocated memory was 71.3MB in the beginning and 352.3MB in the end (delta: 281.0MB). Free memory was 21.6MB in the beginning and 193.4MB in the end (delta: -171.8MB). Peak memory consumption was 240.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 97 locations, 7 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: 14.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3567 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3567 mSDsluCounter, 2231 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1787 mSDsCounter, 114 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6771 IncrementalHoareTripleChecker+Invalid, 6885 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 114 mSolverCounterUnsat, 444 mSDtfsCounter, 6771 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 490 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 472 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2608 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31216occurred in iteration=18, InterpolantAutomatonStates: 384, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 895 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 877 ConstructedInterpolants, 0 QuantifiedInterpolants, 8730 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:54:14,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...