/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/pthread-theta/unwind3-nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 03:13:07,787 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 03:13:07,858 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 03:13:07,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 03:13:07,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 03:13:07,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 03:13:07,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 03:13:07,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 03:13:07,891 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 03:13:07,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 03:13:07,892 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 03:13:07,893 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 03:13:07,893 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 03:13:07,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 03:13:07,894 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 03:13:07,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 03:13:07,894 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 03:13:07,894 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 03:13:07,894 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 03:13:07,894 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 03:13:08,212 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 03:13:08,219 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 03:13:08,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 03:13:08,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 03:13:08,222 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 03:13:08,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/unwind3-nondet.i [2025-03-15 03:13:09,536 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2b5148c/acc3d997afca455da075a69c5cc1a5f5/FLAG1109c9e87 [2025-03-15 03:13:09,829 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 03:13:09,829 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/unwind3-nondet.i [2025-03-15 03:13:09,847 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2b5148c/acc3d997afca455da075a69c5cc1a5f5/FLAG1109c9e87 [2025-03-15 03:13:09,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d2b5148c/acc3d997afca455da075a69c5cc1a5f5 [2025-03-15 03:13:09,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 03:13:09,870 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 03:13:09,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 03:13:09,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 03:13:09,875 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 03:13:09,876 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:13:09" (1/1) ... [2025-03-15 03:13:09,877 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@761a2660 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:09, skipping insertion in model container [2025-03-15 03:13:09,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 03:13:09" (1/1) ... [2025-03-15 03:13:09,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 03:13:10,137 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 03:13:10,148 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 03:13:10,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 03:13:10,221 INFO L204 MainTranslator]: Completed translation [2025-03-15 03:13:10,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10 WrapperNode [2025-03-15 03:13:10,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 03:13:10,224 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 03:13:10,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 03:13:10,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 03:13:10,230 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,250 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,273 INFO L138 Inliner]: procedures = 169, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 69 [2025-03-15 03:13:10,274 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 03:13:10,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 03:13:10,275 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 03:13:10,275 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 03:13:10,281 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,281 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,295 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,304 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,305 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 03:13:10,311 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 03:13:10,312 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 03:13:10,312 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 03:13:10,313 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (1/1) ... [2025-03-15 03:13:10,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 03:13:10,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:13:10,353 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 03:13:10,384 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 03:13:10,405 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 03:13:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-03-15 03:13:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-03-15 03:13:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-03-15 03:13:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-03-15 03:13:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 03:13:10,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 03:13:10,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 03:13:10,407 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 03:13:10,550 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 03:13:10,551 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 03:13:10,690 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 03:13:10,690 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 03:13:10,700 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 03:13:10,700 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 03:13:10,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:13:10 BoogieIcfgContainer [2025-03-15 03:13:10,701 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 03:13:10,705 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 03:13:10,705 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 03:13:10,711 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 03:13:10,711 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 03:13:09" (1/3) ... [2025-03-15 03:13:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a91888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:13:10, skipping insertion in model container [2025-03-15 03:13:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 03:13:10" (2/3) ... [2025-03-15 03:13:10,712 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a91888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 03:13:10, skipping insertion in model container [2025-03-15 03:13:10,712 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 03:13:10" (3/3) ... [2025-03-15 03:13:10,713 INFO L128 eAbstractionObserver]: Analyzing ICFG unwind3-nondet.i [2025-03-15 03:13:10,728 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 03:13:10,731 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG unwind3-nondet.i that has 3 procedures, 94 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 03:13:10,731 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 03:13:10,815 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 03:13:10,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 03:13:10,880 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;@28b605a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 03:13:10,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-15 03:13:10,931 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 03:13:10,931 INFO L124 PetriNetUnfolderBase]: 1/48 cut-off events. [2025-03-15 03:13:10,939 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 03:13:10,939 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:10,940 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:10,940 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-15 03:13:10,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:10,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1090455089, now seen corresponding path program 1 times [2025-03-15 03:13:10,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843157313] [2025-03-15 03:13:10,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:11,304 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 03:13:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:11,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843157313] [2025-03-15 03:13:11,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843157313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:11,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:11,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:13:11,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702160598] [2025-03-15 03:13:11,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:11,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:13:11,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:11,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:13:11,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:13:11,335 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 98 [2025-03-15 03:13:11,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 98 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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 03:13:11,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:11,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 98 [2025-03-15 03:13:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:11,747 INFO L124 PetriNetUnfolderBase]: 189/850 cut-off events. [2025-03-15 03:13:11,747 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-15 03:13:11,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 850 events. 189/850 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5524 event pairs, 49 based on Foata normal form. 33/745 useless extension candidates. Maximal degree in co-relation 1078. Up to 171 conditions per place. [2025-03-15 03:13:11,757 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 62 selfloop transitions, 12 changer transitions 5/138 dead transitions. [2025-03-15 03:13:11,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 138 transitions, 448 flow [2025-03-15 03:13:11,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 651 transitions. [2025-03-15 03:13:11,770 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-03-15 03:13:11,773 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 4 predicate places. [2025-03-15 03:13:11,773 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 138 transitions, 448 flow [2025-03-15 03:13:11,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.0) internal successors, (384), 6 states have internal predecessors, (384), 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 03:13:11,773 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:11,773 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] [2025-03-15 03:13:11,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 03:13:11,775 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-15 03:13:11,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:11,776 INFO L85 PathProgramCache]: Analyzing trace with hash 555630861, now seen corresponding path program 1 times [2025-03-15 03:13:11,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:11,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774106966] [2025-03-15 03:13:11,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:11,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:11,972 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 03:13:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:11,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774106966] [2025-03-15 03:13:11,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774106966] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:11,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:11,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:11,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681859227] [2025-03-15 03:13:11,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:11,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:13:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:11,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:13:11,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:13:11,975 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 98 [2025-03-15 03:13:11,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 138 transitions, 448 flow. Second operand has 8 states, 8 states have (on average 68.0) internal successors, (544), 8 states have internal predecessors, (544), 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 03:13:11,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:11,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 98 [2025-03-15 03:13:11,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:12,150 INFO L124 PetriNetUnfolderBase]: 127/675 cut-off events. [2025-03-15 03:13:12,150 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-03-15 03:13:12,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1118 conditions, 675 events. 127/675 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4038 event pairs, 31 based on Foata normal form. 0/601 useless extension candidates. Maximal degree in co-relation 958. Up to 96 conditions per place. [2025-03-15 03:13:12,155 INFO L140 encePairwiseOnDemand]: 87/98 looper letters, 27 selfloop transitions, 10 changer transitions 23/128 dead transitions. [2025-03-15 03:13:12,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 128 transitions, 508 flow [2025-03-15 03:13:12,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:12,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:12,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 639 transitions. [2025-03-15 03:13:12,157 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7244897959183674 [2025-03-15 03:13:12,157 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 9 predicate places. [2025-03-15 03:13:12,157 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 128 transitions, 508 flow [2025-03-15 03:13:12,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 68.0) internal successors, (544), 8 states have internal predecessors, (544), 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 03:13:12,158 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:12,158 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] [2025-03-15 03:13:12,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 03:13:12,158 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-15 03:13:12,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:12,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1732449044, now seen corresponding path program 1 times [2025-03-15 03:13:12,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:12,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719276313] [2025-03-15 03:13:12,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:12,234 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 03:13:12,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719276313] [2025-03-15 03:13:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719276313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761657526] [2025-03-15 03:13:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:12,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:12,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:12,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:12,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:12,236 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 98 [2025-03-15 03:13:12,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 128 transitions, 508 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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 03:13:12,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:12,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 98 [2025-03-15 03:13:12,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:12,347 INFO L124 PetriNetUnfolderBase]: 178/1006 cut-off events. [2025-03-15 03:13:12,347 INFO L125 PetriNetUnfolderBase]: For 120/120 co-relation queries the response was YES. [2025-03-15 03:13:12,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1896 conditions, 1006 events. 178/1006 cut-off events. For 120/120 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7111 event pairs, 52 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1636. Up to 170 conditions per place. [2025-03-15 03:13:12,353 INFO L140 encePairwiseOnDemand]: 92/98 looper letters, 19 selfloop transitions, 4 changer transitions 27/139 dead transitions. [2025-03-15 03:13:12,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 139 transitions, 608 flow [2025-03-15 03:13:12,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:13:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:13:12,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 424 transitions. [2025-03-15 03:13:12,368 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8653061224489796 [2025-03-15 03:13:12,368 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 13 predicate places. [2025-03-15 03:13:12,368 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 139 transitions, 608 flow [2025-03-15 03:13:12,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 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 03:13:12,369 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:12,369 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 03:13:12,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 03:13:12,369 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-15 03:13:12,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:12,370 INFO L85 PathProgramCache]: Analyzing trace with hash -249994821, now seen corresponding path program 1 times [2025-03-15 03:13:12,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:12,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581202865] [2025-03-15 03:13:12,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:12,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:12,419 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 03:13:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581202865] [2025-03-15 03:13:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581202865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:12,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 03:13:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742068168] [2025-03-15 03:13:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:12,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 03:13:12,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:12,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 03:13:12,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 03:13:12,421 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 98 [2025-03-15 03:13:12,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 139 transitions, 608 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 03:13:12,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:12,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 98 [2025-03-15 03:13:12,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:12,546 INFO L124 PetriNetUnfolderBase]: 178/1004 cut-off events. [2025-03-15 03:13:12,546 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-15 03:13:12,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2004 conditions, 1004 events. 178/1004 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7067 event pairs, 52 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1728. Up to 170 conditions per place. [2025-03-15 03:13:12,553 INFO L140 encePairwiseOnDemand]: 93/98 looper letters, 30 selfloop transitions, 5 changer transitions 27/137 dead transitions. [2025-03-15 03:13:12,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 137 transitions, 670 flow [2025-03-15 03:13:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 03:13:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 03:13:12,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2025-03-15 03:13:12,555 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8741496598639455 [2025-03-15 03:13:12,556 INFO L298 CegarLoopForPetriNet]: 100 programPoint places, 13 predicate places. [2025-03-15 03:13:12,556 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 137 transitions, 670 flow [2025-03-15 03:13:12,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 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 03:13:12,556 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:12,556 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:12,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 03:13:12,557 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 13 more)] === [2025-03-15 03:13:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1740504458, now seen corresponding path program 1 times [2025-03-15 03:13:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677076294] [2025-03-15 03:13:12,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:12,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 03:13:12,575 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 03:13:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 03:13:12,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 03:13:12,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 03:13:12,608 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-15 03:13:12,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-15 03:13:12,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-15 03:13:12,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 16 remaining) [2025-03-15 03:13:12,609 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-15 03:13:12,610 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-15 03:13:12,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 03:13:12,611 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-15 03:13:12,613 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 03:13:12,613 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 03:13:12,641 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 03:13:12,646 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 03:13:12,649 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;@28b605a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 03:13:12,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-15 03:13:12,653 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 03:13:12,653 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-15 03:13:12,653 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 03:13:12,653 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:12,653 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:12,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:12,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:12,654 INFO L85 PathProgramCache]: Analyzing trace with hash -865351046, now seen corresponding path program 1 times [2025-03-15 03:13:12,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:12,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324190742] [2025-03-15 03:13:12,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:12,722 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 03:13:12,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:12,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324190742] [2025-03-15 03:13:12,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324190742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:12,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:12,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:13:12,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113644212] [2025-03-15 03:13:12,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:12,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:13:12,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:12,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:13:12,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:13:12,724 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 143 [2025-03-15 03:13:12,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 143 transitions, 306 flow. Second operand has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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 03:13:12,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:12,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 143 [2025-03-15 03:13:12,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:13,365 INFO L124 PetriNetUnfolderBase]: 1249/3938 cut-off events. [2025-03-15 03:13:13,365 INFO L125 PetriNetUnfolderBase]: For 71/71 co-relation queries the response was YES. [2025-03-15 03:13:13,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6077 conditions, 3938 events. 1249/3938 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 34637 event pairs, 296 based on Foata normal form. 139/3417 useless extension candidates. Maximal degree in co-relation 6071. Up to 706 conditions per place. [2025-03-15 03:13:13,391 INFO L140 encePairwiseOnDemand]: 126/143 looper letters, 125 selfloop transitions, 17 changer transitions 3/212 dead transitions. [2025-03-15 03:13:13,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 212 transitions, 750 flow [2025-03-15 03:13:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 03:13:13,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 03:13:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1104 transitions. [2025-03-15 03:13:13,395 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.772027972027972 [2025-03-15 03:13:13,396 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -26 predicate places. [2025-03-15 03:13:13,396 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 212 transitions, 750 flow [2025-03-15 03:13:13,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.0) internal successors, (576), 6 states have internal predecessors, (576), 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 03:13:13,396 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:13,396 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] [2025-03-15 03:13:13,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 03:13:13,397 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:13,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:13,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1056078255, now seen corresponding path program 1 times [2025-03-15 03:13:13,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:13,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910618516] [2025-03-15 03:13:13,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:13,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:13,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:13,568 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 03:13:13,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:13,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910618516] [2025-03-15 03:13:13,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910618516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:13,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:13,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:13,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917373119] [2025-03-15 03:13:13,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:13,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:13:13,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:13,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:13:13,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:13:13,573 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 143 [2025-03-15 03:13:13,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 212 transitions, 750 flow. Second operand has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 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 03:13:13,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:13,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 143 [2025-03-15 03:13:13,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:14,015 INFO L124 PetriNetUnfolderBase]: 873/3044 cut-off events. [2025-03-15 03:13:14,016 INFO L125 PetriNetUnfolderBase]: For 436/450 co-relation queries the response was YES. [2025-03-15 03:13:14,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5699 conditions, 3044 events. 873/3044 cut-off events. For 436/450 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 25950 event pairs, 197 based on Foata normal form. 10/2681 useless extension candidates. Maximal degree in co-relation 5692. Up to 417 conditions per place. [2025-03-15 03:13:14,040 INFO L140 encePairwiseOnDemand]: 130/143 looper letters, 77 selfloop transitions, 13 changer transitions 7/211 dead transitions. [2025-03-15 03:13:14,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 211 transitions, 946 flow [2025-03-15 03:13:14,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:14,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:14,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 956 transitions. [2025-03-15 03:13:14,044 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7428127428127428 [2025-03-15 03:13:14,046 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -20 predicate places. [2025-03-15 03:13:14,046 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 211 transitions, 946 flow [2025-03-15 03:13:14,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.0) internal successors, (800), 8 states have internal predecessors, (800), 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 03:13:14,047 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:14,047 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] [2025-03-15 03:13:14,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 03:13:14,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:14,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:14,048 INFO L85 PathProgramCache]: Analyzing trace with hash -320701681, now seen corresponding path program 1 times [2025-03-15 03:13:14,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:14,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746111455] [2025-03-15 03:13:14,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:14,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:14,114 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 03:13:14,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:14,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746111455] [2025-03-15 03:13:14,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746111455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:14,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:14,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:14,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799362202] [2025-03-15 03:13:14,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:14,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:14,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:14,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:14,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:14,117 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 143 [2025-03-15 03:13:14,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 211 transitions, 946 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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 03:13:14,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:14,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 143 [2025-03-15 03:13:14,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:14,628 INFO L124 PetriNetUnfolderBase]: 1191/4315 cut-off events. [2025-03-15 03:13:14,628 INFO L125 PetriNetUnfolderBase]: For 668/766 co-relation queries the response was YES. [2025-03-15 03:13:14,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8744 conditions, 4315 events. 1191/4315 cut-off events. For 668/766 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 40016 event pairs, 293 based on Foata normal form. 2/3841 useless extension candidates. Maximal degree in co-relation 8736. Up to 570 conditions per place. [2025-03-15 03:13:14,662 INFO L140 encePairwiseOnDemand]: 137/143 looper letters, 38 selfloop transitions, 4 changer transitions 9/226 dead transitions. [2025-03-15 03:13:14,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 226 transitions, 1100 flow [2025-03-15 03:13:14,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:13:14,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:13:14,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 625 transitions. [2025-03-15 03:13:14,664 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8741258741258742 [2025-03-15 03:13:14,665 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -16 predicate places. [2025-03-15 03:13:14,665 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 226 transitions, 1100 flow [2025-03-15 03:13:14,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 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 03:13:14,666 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:14,666 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 03:13:14,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 03:13:14,666 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:14,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:14,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1916507902, now seen corresponding path program 1 times [2025-03-15 03:13:14,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:14,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590051888] [2025-03-15 03:13:14,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:14,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:14,718 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 03:13:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:14,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590051888] [2025-03-15 03:13:14,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590051888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:14,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:14,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 03:13:14,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82832722] [2025-03-15 03:13:14,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:14,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 03:13:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:14,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 03:13:14,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 03:13:14,720 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 143 [2025-03-15 03:13:14,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 226 transitions, 1100 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 03:13:14,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:14,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 143 [2025-03-15 03:13:14,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:15,159 INFO L124 PetriNetUnfolderBase]: 1190/4258 cut-off events. [2025-03-15 03:13:15,160 INFO L125 PetriNetUnfolderBase]: For 1232/1326 co-relation queries the response was YES. [2025-03-15 03:13:15,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9236 conditions, 4258 events. 1190/4258 cut-off events. For 1232/1326 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 39449 event pairs, 286 based on Foata normal form. 2/3821 useless extension candidates. Maximal degree in co-relation 9227. Up to 570 conditions per place. [2025-03-15 03:13:15,186 INFO L140 encePairwiseOnDemand]: 138/143 looper letters, 79 selfloop transitions, 5 changer transitions 9/230 dead transitions. [2025-03-15 03:13:15,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 230 transitions, 1284 flow [2025-03-15 03:13:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 03:13:15,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 03:13:15,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2025-03-15 03:13:15,188 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8951048951048951 [2025-03-15 03:13:15,189 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -14 predicate places. [2025-03-15 03:13:15,189 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 230 transitions, 1284 flow [2025-03-15 03:13:15,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 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 03:13:15,189 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:15,189 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:15,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 03:13:15,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:15,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:15,190 INFO L85 PathProgramCache]: Analyzing trace with hash -522332857, now seen corresponding path program 1 times [2025-03-15 03:13:15,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:15,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069521222] [2025-03-15 03:13:15,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:15,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:15,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:15,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 03:13:15,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:15,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069521222] [2025-03-15 03:13:15,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069521222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:15,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:15,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:15,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402306295] [2025-03-15 03:13:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:15,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 03:13:15,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:15,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 03:13:15,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 03:13:15,279 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 143 [2025-03-15 03:13:15,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 230 transitions, 1284 flow. Second operand has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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 03:13:15,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:15,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 143 [2025-03-15 03:13:15,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:15,941 INFO L124 PetriNetUnfolderBase]: 2060/5728 cut-off events. [2025-03-15 03:13:15,942 INFO L125 PetriNetUnfolderBase]: For 4108/4371 co-relation queries the response was YES. [2025-03-15 03:13:15,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15756 conditions, 5728 events. 2060/5728 cut-off events. For 4108/4371 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 53104 event pairs, 633 based on Foata normal form. 20/5206 useless extension candidates. Maximal degree in co-relation 15746. Up to 1575 conditions per place. [2025-03-15 03:13:16,001 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 142 selfloop transitions, 9 changer transitions 19/246 dead transitions. [2025-03-15 03:13:16,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 246 transitions, 1682 flow [2025-03-15 03:13:16,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 912 transitions. [2025-03-15 03:13:16,004 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7086247086247086 [2025-03-15 03:13:16,005 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -6 predicate places. [2025-03-15 03:13:16,005 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 246 transitions, 1682 flow [2025-03-15 03:13:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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 03:13:16,005 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:16,006 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:16,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 03:13:16,006 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:16,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:16,006 INFO L85 PathProgramCache]: Analyzing trace with hash 425695320, now seen corresponding path program 1 times [2025-03-15 03:13:16,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:16,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729259525] [2025-03-15 03:13:16,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:16,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:16,067 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 03:13:16,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:16,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729259525] [2025-03-15 03:13:16,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729259525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:16,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:16,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:16,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029832815] [2025-03-15 03:13:16,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:16,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:16,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:16,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:16,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:16,069 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 143 [2025-03-15 03:13:16,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 246 transitions, 1682 flow. Second operand has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 03:13:16,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:16,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 143 [2025-03-15 03:13:16,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:16,615 INFO L124 PetriNetUnfolderBase]: 2028/5631 cut-off events. [2025-03-15 03:13:16,615 INFO L125 PetriNetUnfolderBase]: For 6240/6463 co-relation queries the response was YES. [2025-03-15 03:13:16,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16386 conditions, 5631 events. 2028/5631 cut-off events. For 6240/6463 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 51955 event pairs, 627 based on Foata normal form. 0/5128 useless extension candidates. Maximal degree in co-relation 16375. Up to 1548 conditions per place. [2025-03-15 03:13:16,655 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 66 selfloop transitions, 9 changer transitions 19/241 dead transitions. [2025-03-15 03:13:16,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 241 transitions, 1804 flow [2025-03-15 03:13:16,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 03:13:16,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 03:13:16,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2025-03-15 03:13:16,657 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8776223776223776 [2025-03-15 03:13:16,658 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, -4 predicate places. [2025-03-15 03:13:16,658 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 241 transitions, 1804 flow [2025-03-15 03:13:16,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.75) internal successors, (491), 4 states have internal predecessors, (491), 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 03:13:16,658 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:16,659 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:16,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 03:13:16,659 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:16,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:16,659 INFO L85 PathProgramCache]: Analyzing trace with hash 427627568, now seen corresponding path program 1 times [2025-03-15 03:13:16,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:16,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717512786] [2025-03-15 03:13:16,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:16,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:16,749 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 03:13:16,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:16,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717512786] [2025-03-15 03:13:16,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717512786] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:16,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:16,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 03:13:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432905925] [2025-03-15 03:13:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:16,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 03:13:16,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:16,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 03:13:16,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 03:13:16,751 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 143 [2025-03-15 03:13:16,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 241 transitions, 1804 flow. Second operand has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 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 03:13:16,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:16,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 143 [2025-03-15 03:13:16,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:17,753 INFO L124 PetriNetUnfolderBase]: 4238/9953 cut-off events. [2025-03-15 03:13:17,754 INFO L125 PetriNetUnfolderBase]: For 22860/24330 co-relation queries the response was YES. [2025-03-15 03:13:17,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34309 conditions, 9953 events. 4238/9953 cut-off events. For 22860/24330 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 95135 event pairs, 1050 based on Foata normal form. 6/8487 useless extension candidates. Maximal degree in co-relation 34297. Up to 2773 conditions per place. [2025-03-15 03:13:17,891 INFO L140 encePairwiseOnDemand]: 133/143 looper letters, 190 selfloop transitions, 16 changer transitions 27/326 dead transitions. [2025-03-15 03:13:17,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 326 transitions, 3073 flow [2025-03-15 03:13:17,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:17,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:17,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 966 transitions. [2025-03-15 03:13:17,895 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7505827505827506 [2025-03-15 03:13:17,895 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 4 predicate places. [2025-03-15 03:13:17,895 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 326 transitions, 3073 flow [2025-03-15 03:13:17,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.57142857142857) internal successors, (676), 7 states have internal predecessors, (676), 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 03:13:17,896 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:17,896 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:17,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 03:13:17,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:17,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:17,897 INFO L85 PathProgramCache]: Analyzing trace with hash 311653361, now seen corresponding path program 1 times [2025-03-15 03:13:17,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:17,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065830730] [2025-03-15 03:13:17,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:17,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:17,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:17,963 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 03:13:17,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:17,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065830730] [2025-03-15 03:13:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065830730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:17,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:17,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:17,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419430458] [2025-03-15 03:13:17,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:17,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:17,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:17,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:17,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 143 [2025-03-15 03:13:17,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 326 transitions, 3073 flow. Second operand has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 03:13:17,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:17,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 143 [2025-03-15 03:13:17,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:18,835 INFO L124 PetriNetUnfolderBase]: 4166/9803 cut-off events. [2025-03-15 03:13:18,835 INFO L125 PetriNetUnfolderBase]: For 30433/31841 co-relation queries the response was YES. [2025-03-15 03:13:18,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35452 conditions, 9803 events. 4166/9803 cut-off events. For 30433/31841 co-relation queries the response was YES. Maximal size of possible extension queue 562. Compared 93810 event pairs, 1046 based on Foata normal form. 0/8395 useless extension candidates. Maximal degree in co-relation 35439. Up to 2732 conditions per place. [2025-03-15 03:13:18,911 INFO L140 encePairwiseOnDemand]: 139/143 looper letters, 107 selfloop transitions, 17 changer transitions 27/325 dead transitions. [2025-03-15 03:13:18,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 325 transitions, 3333 flow [2025-03-15 03:13:18,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 03:13:18,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 03:13:18,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2025-03-15 03:13:18,913 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8811188811188811 [2025-03-15 03:13:18,915 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 6 predicate places. [2025-03-15 03:13:18,915 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 325 transitions, 3333 flow [2025-03-15 03:13:18,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 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 03:13:18,915 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:18,916 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:18,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 03:13:18,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:18,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:18,917 INFO L85 PathProgramCache]: Analyzing trace with hash 371553125, now seen corresponding path program 1 times [2025-03-15 03:13:18,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:18,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349156726] [2025-03-15 03:13:18,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:18,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:18,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:19,058 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 03:13:19,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:19,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349156726] [2025-03-15 03:13:19,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349156726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:19,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:19,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:19,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716666717] [2025-03-15 03:13:19,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:19,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:13:19,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:19,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:13:19,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:13:19,059 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 143 [2025-03-15 03:13:19,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 325 transitions, 3333 flow. Second operand has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 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 03:13:19,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:19,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 143 [2025-03-15 03:13:19,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:20,087 INFO L124 PetriNetUnfolderBase]: 3687/8981 cut-off events. [2025-03-15 03:13:20,087 INFO L125 PetriNetUnfolderBase]: For 31558/33697 co-relation queries the response was YES. [2025-03-15 03:13:20,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35347 conditions, 8981 events. 3687/8981 cut-off events. For 31558/33697 co-relation queries the response was YES. Maximal size of possible extension queue 512. Compared 86416 event pairs, 923 based on Foata normal form. 14/7984 useless extension candidates. Maximal degree in co-relation 35333. Up to 2375 conditions per place. [2025-03-15 03:13:20,173 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 125 selfloop transitions, 14 changer transitions 35/339 dead transitions. [2025-03-15 03:13:20,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 339 transitions, 3871 flow [2025-03-15 03:13:20,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:20,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 947 transitions. [2025-03-15 03:13:20,176 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7358197358197358 [2025-03-15 03:13:20,176 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 14 predicate places. [2025-03-15 03:13:20,176 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 339 transitions, 3871 flow [2025-03-15 03:13:20,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 100.25) internal successors, (802), 8 states have internal predecessors, (802), 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 03:13:20,177 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:20,177 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:20,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 03:13:20,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:20,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash 33790932, now seen corresponding path program 1 times [2025-03-15 03:13:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677126470] [2025-03-15 03:13:20,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:20,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:20,341 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 03:13:20,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:20,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677126470] [2025-03-15 03:13:20,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677126470] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:20,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:20,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:13:20,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161574897] [2025-03-15 03:13:20,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:20,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:13:20,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:20,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:13:20,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:13:20,344 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 143 [2025-03-15 03:13:20,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 339 transitions, 3871 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:20,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:20,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 143 [2025-03-15 03:13:20,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:21,553 INFO L124 PetriNetUnfolderBase]: 4223/10028 cut-off events. [2025-03-15 03:13:21,553 INFO L125 PetriNetUnfolderBase]: For 43362/48461 co-relation queries the response was YES. [2025-03-15 03:13:21,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45701 conditions, 10028 events. 4223/10028 cut-off events. For 43362/48461 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 98263 event pairs, 797 based on Foata normal form. 29/8932 useless extension candidates. Maximal degree in co-relation 45686. Up to 2858 conditions per place. [2025-03-15 03:13:21,632 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 278 selfloop transitions, 14 changer transitions 39/411 dead transitions. [2025-03-15 03:13:21,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 411 transitions, 5558 flow [2025-03-15 03:13:21,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 03:13:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 03:13:21,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1017 transitions. [2025-03-15 03:13:21,635 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7111888111888112 [2025-03-15 03:13:21,635 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 23 predicate places. [2025-03-15 03:13:21,635 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 411 transitions, 5558 flow [2025-03-15 03:13:21,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:21,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:21,636 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:21,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 03:13:21,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:21,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1004886742, now seen corresponding path program 2 times [2025-03-15 03:13:21,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:21,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043316805] [2025-03-15 03:13:21,636 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 03:13:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:21,645 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 03:13:21,645 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 03:13:21,729 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 03:13:21,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:21,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043316805] [2025-03-15 03:13:21,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043316805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:21,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:21,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:13:21,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498571529] [2025-03-15 03:13:21,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:21,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:13:21,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:21,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:13:21,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:13:21,732 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 143 [2025-03-15 03:13:21,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 411 transitions, 5558 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:21,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:21,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 143 [2025-03-15 03:13:21,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:23,776 INFO L124 PetriNetUnfolderBase]: 6570/15078 cut-off events. [2025-03-15 03:13:23,777 INFO L125 PetriNetUnfolderBase]: For 81350/96093 co-relation queries the response was YES. [2025-03-15 03:13:23,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79017 conditions, 15078 events. 6570/15078 cut-off events. For 81350/96093 co-relation queries the response was YES. Maximal size of possible extension queue 905. Compared 156889 event pairs, 1338 based on Foata normal form. 39/13455 useless extension candidates. Maximal degree in co-relation 79001. Up to 4481 conditions per place. [2025-03-15 03:13:23,923 INFO L140 encePairwiseOnDemand]: 131/143 looper letters, 396 selfloop transitions, 21 changer transitions 55/552 dead transitions. [2025-03-15 03:13:23,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 552 transitions, 8754 flow [2025-03-15 03:13:23,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 03:13:23,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 03:13:23,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1236 transitions. [2025-03-15 03:13:23,926 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7202797202797203 [2025-03-15 03:13:23,931 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 34 predicate places. [2025-03-15 03:13:23,931 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 552 transitions, 8754 flow [2025-03-15 03:13:23,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:23,931 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:23,931 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:23,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 03:13:23,932 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:23,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:23,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1701661676, now seen corresponding path program 3 times [2025-03-15 03:13:23,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:23,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159447548] [2025-03-15 03:13:23,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 03:13:23,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:23,942 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 03:13:23,942 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 03:13:24,035 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 03:13:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:24,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159447548] [2025-03-15 03:13:24,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159447548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:24,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:24,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:13:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436779983] [2025-03-15 03:13:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:24,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:13:24,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:24,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:13:24,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:13:24,037 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 143 [2025-03-15 03:13:24,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 552 transitions, 8754 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:24,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:24,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 143 [2025-03-15 03:13:24,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:26,346 INFO L124 PetriNetUnfolderBase]: 6524/14966 cut-off events. [2025-03-15 03:13:26,346 INFO L125 PetriNetUnfolderBase]: For 96430/115786 co-relation queries the response was YES. [2025-03-15 03:13:26,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87526 conditions, 14966 events. 6524/14966 cut-off events. For 96430/115786 co-relation queries the response was YES. Maximal size of possible extension queue 897. Compared 155357 event pairs, 1242 based on Foata normal form. 62/13419 useless extension candidates. Maximal degree in co-relation 87509. Up to 4440 conditions per place. [2025-03-15 03:13:26,509 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 400 selfloop transitions, 25 changer transitions 55/560 dead transitions. [2025-03-15 03:13:26,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 560 transitions, 9832 flow [2025-03-15 03:13:26,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 03:13:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 03:13:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1218 transitions. [2025-03-15 03:13:26,511 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7097902097902098 [2025-03-15 03:13:26,511 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 44 predicate places. [2025-03-15 03:13:26,511 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 560 transitions, 9832 flow [2025-03-15 03:13:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:26,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:26,512 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 03:13:26,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:26,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1405827756, now seen corresponding path program 1 times [2025-03-15 03:13:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601871027] [2025-03-15 03:13:26,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:26,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:13:26,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:26,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601871027] [2025-03-15 03:13:26,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601871027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:26,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:26,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:13:26,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605889797] [2025-03-15 03:13:26,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:26,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:13:26,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:26,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:13:26,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:13:26,582 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 143 [2025-03-15 03:13:26,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 560 transitions, 9832 flow. Second operand has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:26,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:26,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 143 [2025-03-15 03:13:26,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:28,393 INFO L124 PetriNetUnfolderBase]: 6492/14900 cut-off events. [2025-03-15 03:13:28,393 INFO L125 PetriNetUnfolderBase]: For 112699/133845 co-relation queries the response was YES. [2025-03-15 03:13:28,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95907 conditions, 14900 events. 6492/14900 cut-off events. For 112699/133845 co-relation queries the response was YES. Maximal size of possible extension queue 890. Compared 154285 event pairs, 1047 based on Foata normal form. 110/13444 useless extension candidates. Maximal degree in co-relation 95889. Up to 4407 conditions per place. [2025-03-15 03:13:28,573 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 417 selfloop transitions, 24 changer transitions 55/576 dead transitions. [2025-03-15 03:13:28,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 576 transitions, 11102 flow [2025-03-15 03:13:28,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 03:13:28,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 03:13:28,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1030 transitions. [2025-03-15 03:13:28,575 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7202797202797203 [2025-03-15 03:13:28,575 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 52 predicate places. [2025-03-15 03:13:28,575 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 576 transitions, 11102 flow [2025-03-15 03:13:28,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 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 03:13:28,576 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:28,576 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:28,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 03:13:28,576 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:28,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:28,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1047519297, now seen corresponding path program 1 times [2025-03-15 03:13:28,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:28,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123577371] [2025-03-15 03:13:28,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:28,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:28,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:28,734 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 03:13:28,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:28,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123577371] [2025-03-15 03:13:28,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123577371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:28,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:28,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 03:13:28,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98180287] [2025-03-15 03:13:28,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:28,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 03:13:28,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:28,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 03:13:28,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-15 03:13:28,736 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 143 [2025-03-15 03:13:28,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 576 transitions, 11102 flow. Second operand has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:28,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:28,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 143 [2025-03-15 03:13:28,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:30,862 INFO L124 PetriNetUnfolderBase]: 6357/14628 cut-off events. [2025-03-15 03:13:30,863 INFO L125 PetriNetUnfolderBase]: For 123871/143231 co-relation queries the response was YES. [2025-03-15 03:13:31,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100120 conditions, 14628 events. 6357/14628 cut-off events. For 123871/143231 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 150954 event pairs, 1045 based on Foata normal form. 51/13250 useless extension candidates. Maximal degree in co-relation 100101. Up to 4343 conditions per place. [2025-03-15 03:13:31,115 INFO L140 encePairwiseOnDemand]: 131/143 looper letters, 180 selfloop transitions, 31 changer transitions 87/531 dead transitions. [2025-03-15 03:13:31,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 531 transitions, 10683 flow [2025-03-15 03:13:31,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 03:13:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 03:13:31,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1501 transitions. [2025-03-15 03:13:31,118 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6997668997668998 [2025-03-15 03:13:31,118 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 63 predicate places. [2025-03-15 03:13:31,118 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 531 transitions, 10683 flow [2025-03-15 03:13:31,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:31,119 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:31,119 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:31,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 03:13:31,119 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:31,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:31,120 INFO L85 PathProgramCache]: Analyzing trace with hash -630987081, now seen corresponding path program 1 times [2025-03-15 03:13:31,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:31,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257869706] [2025-03-15 03:13:31,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:31,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:31,238 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 03:13:31,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:31,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257869706] [2025-03-15 03:13:31,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257869706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:31,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:31,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 03:13:31,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392757003] [2025-03-15 03:13:31,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:31,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 03:13:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:31,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 03:13:31,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-15 03:13:31,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 143 [2025-03-15 03:13:31,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 531 transitions, 10683 flow. Second operand has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:31,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:31,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 143 [2025-03-15 03:13:31,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:33,335 INFO L124 PetriNetUnfolderBase]: 6316/14541 cut-off events. [2025-03-15 03:13:33,336 INFO L125 PetriNetUnfolderBase]: For 140007/161149 co-relation queries the response was YES. [2025-03-15 03:13:33,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105753 conditions, 14541 events. 6316/14541 cut-off events. For 140007/161149 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 150160 event pairs, 1045 based on Foata normal form. 49/13208 useless extension candidates. Maximal degree in co-relation 105733. Up to 4343 conditions per place. [2025-03-15 03:13:33,521 INFO L140 encePairwiseOnDemand]: 132/143 looper letters, 160 selfloop transitions, 26 changer transitions 113/516 dead transitions. [2025-03-15 03:13:33,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 516 transitions, 10894 flow [2025-03-15 03:13:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 03:13:33,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 03:13:33,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1407 transitions. [2025-03-15 03:13:33,523 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7027972027972028 [2025-03-15 03:13:33,524 INFO L298 CegarLoopForPetriNet]: 146 programPoint places, 75 predicate places. [2025-03-15 03:13:33,524 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 516 transitions, 10894 flow [2025-03-15 03:13:33,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 95.3) internal successors, (953), 10 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:33,524 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:33,524 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:33,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 03:13:33,525 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 19 more)] === [2025-03-15 03:13:33,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:33,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1102081698, now seen corresponding path program 1 times [2025-03-15 03:13:33,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:33,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128912781] [2025-03-15 03:13:33,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:33,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:33,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 03:13:33,534 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 03:13:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 03:13:33,542 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 03:13:33,542 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 03:13:33,542 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2025-03-15 03:13:33,542 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-15 03:13:33,543 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-15 03:13:33,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-15 03:13:33,544 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location f2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-15 03:13:33,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 03:13:33,544 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:33,544 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 03:13:33,544 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 03:13:33,570 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 03:13:33,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 03:13:33,573 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;@28b605a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 03:13:33,573 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-15 03:13:33,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 03:13:33,575 INFO L124 PetriNetUnfolderBase]: 1/49 cut-off events. [2025-03-15 03:13:33,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 03:13:33,575 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:33,575 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:33,575 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:33,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:33,575 INFO L85 PathProgramCache]: Analyzing trace with hash 379820581, now seen corresponding path program 1 times [2025-03-15 03:13:33,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:33,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657542977] [2025-03-15 03:13:33,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:33,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:33,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:33,615 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 03:13:33,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:33,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657542977] [2025-03-15 03:13:33,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657542977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:33,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:33,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 03:13:33,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567224603] [2025-03-15 03:13:33,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:33,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 03:13:33,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:33,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 03:13:33,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 03:13:33,617 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 188 [2025-03-15 03:13:33,618 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 412 flow. Second operand has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 03:13:33,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:33,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 188 [2025-03-15 03:13:33,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:34,760 INFO L124 PetriNetUnfolderBase]: 6279/15723 cut-off events. [2025-03-15 03:13:34,761 INFO L125 PetriNetUnfolderBase]: For 363/363 co-relation queries the response was YES. [2025-03-15 03:13:34,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25403 conditions, 15723 events. 6279/15723 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 159439 event pairs, 1284 based on Foata normal form. 449/13503 useless extension candidates. Maximal degree in co-relation 25395. Up to 3007 conditions per place. [2025-03-15 03:13:34,901 INFO L140 encePairwiseOnDemand]: 170/188 looper letters, 141 selfloop transitions, 20 changer transitions 3/239 dead transitions. [2025-03-15 03:13:34,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 239 transitions, 878 flow [2025-03-15 03:13:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 03:13:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 03:13:34,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1443 transitions. [2025-03-15 03:13:34,903 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7675531914893617 [2025-03-15 03:13:34,903 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -58 predicate places. [2025-03-15 03:13:34,903 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 239 transitions, 878 flow [2025-03-15 03:13:34,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.0) internal successors, (768), 6 states have internal predecessors, (768), 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 03:13:34,904 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:34,904 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] [2025-03-15 03:13:34,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 03:13:34,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:34,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:34,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1110463274, now seen corresponding path program 1 times [2025-03-15 03:13:34,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:34,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935050820] [2025-03-15 03:13:34,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:34,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:34,995 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 03:13:34,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:34,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935050820] [2025-03-15 03:13:34,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935050820] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:34,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:34,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:34,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614259312] [2025-03-15 03:13:34,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:34,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:13:34,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:34,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:13:34,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:13:34,997 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 188 [2025-03-15 03:13:34,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 239 transitions, 878 flow. Second operand has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:34,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:34,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 188 [2025-03-15 03:13:34,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:36,095 INFO L124 PetriNetUnfolderBase]: 4596/11966 cut-off events. [2025-03-15 03:13:36,095 INFO L125 PetriNetUnfolderBase]: For 1497/1573 co-relation queries the response was YES. [2025-03-15 03:13:36,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24777 conditions, 11966 events. 4596/11966 cut-off events. For 1497/1573 co-relation queries the response was YES. Maximal size of possible extension queue 444. Compared 118256 event pairs, 886 based on Foata normal form. 30/10474 useless extension candidates. Maximal degree in co-relation 24768. Up to 2459 conditions per place. [2025-03-15 03:13:36,197 INFO L140 encePairwiseOnDemand]: 174/188 looper letters, 107 selfloop transitions, 15 changer transitions 4/248 dead transitions. [2025-03-15 03:13:36,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 248 transitions, 1186 flow [2025-03-15 03:13:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:36,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1258 transitions. [2025-03-15 03:13:36,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7434988179669031 [2025-03-15 03:13:36,200 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -52 predicate places. [2025-03-15 03:13:36,200 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 248 transitions, 1186 flow [2025-03-15 03:13:36,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.0) internal successors, (1056), 8 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 03:13:36,201 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:36,201 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] [2025-03-15 03:13:36,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 03:13:36,201 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:36,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1682411255, now seen corresponding path program 1 times [2025-03-15 03:13:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:36,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607439062] [2025-03-15 03:13:36,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:36,238 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 03:13:36,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:36,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607439062] [2025-03-15 03:13:36,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607439062] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:36,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:36,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:36,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118533333] [2025-03-15 03:13:36,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:36,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:36,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:36,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:36,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:36,240 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-15 03:13:36,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 248 transitions, 1186 flow. Second operand has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 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 03:13:36,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:36,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-15 03:13:36,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:37,487 INFO L124 PetriNetUnfolderBase]: 6201/16331 cut-off events. [2025-03-15 03:13:37,488 INFO L125 PetriNetUnfolderBase]: For 2582/3086 co-relation queries the response was YES. [2025-03-15 03:13:37,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35303 conditions, 16331 events. 6201/16331 cut-off events. For 2582/3086 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 169869 event pairs, 1243 based on Foata normal form. 4/14308 useless extension candidates. Maximal degree in co-relation 35293. Up to 3281 conditions per place. [2025-03-15 03:13:37,646 INFO L140 encePairwiseOnDemand]: 182/188 looper letters, 47 selfloop transitions, 4 changer transitions 5/263 dead transitions. [2025-03-15 03:13:37,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 263 transitions, 1354 flow [2025-03-15 03:13:37,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 03:13:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 03:13:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 826 transitions. [2025-03-15 03:13:37,647 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8787234042553191 [2025-03-15 03:13:37,647 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -48 predicate places. [2025-03-15 03:13:37,648 INFO L471 AbstractCegarLoop]: Abstraction has has 144 places, 263 transitions, 1354 flow [2025-03-15 03:13:37,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 161.5) internal successors, (646), 4 states have internal predecessors, (646), 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 03:13:37,648 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:37,648 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 03:13:37,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 03:13:37,648 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:37,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:37,649 INFO L85 PathProgramCache]: Analyzing trace with hash 486376553, now seen corresponding path program 1 times [2025-03-15 03:13:37,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:37,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296076347] [2025-03-15 03:13:37,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:37,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:37,667 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 03:13:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:37,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296076347] [2025-03-15 03:13:37,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296076347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:37,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:37,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 03:13:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73874784] [2025-03-15 03:13:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:37,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 03:13:37,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:37,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 03:13:37,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 03:13:37,669 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-15 03:13:37,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 263 transitions, 1354 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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 03:13:37,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:37,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-15 03:13:37,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:38,768 INFO L124 PetriNetUnfolderBase]: 6193/16031 cut-off events. [2025-03-15 03:13:38,768 INFO L125 PetriNetUnfolderBase]: For 4747/5287 co-relation queries the response was YES. [2025-03-15 03:13:38,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37057 conditions, 16031 events. 6193/16031 cut-off events. For 4747/5287 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 165951 event pairs, 1176 based on Foata normal form. 4/14174 useless extension candidates. Maximal degree in co-relation 37046. Up to 3281 conditions per place. [2025-03-15 03:13:38,893 INFO L140 encePairwiseOnDemand]: 183/188 looper letters, 86 selfloop transitions, 5 changer transitions 5/267 dead transitions. [2025-03-15 03:13:38,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 267 transitions, 1552 flow [2025-03-15 03:13:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 03:13:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 03:13:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2025-03-15 03:13:38,894 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8953900709219859 [2025-03-15 03:13:38,895 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -46 predicate places. [2025-03-15 03:13:38,895 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 267 transitions, 1552 flow [2025-03-15 03:13:38,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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 03:13:38,895 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:38,896 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:38,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 03:13:38,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:38,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:38,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1360133679, now seen corresponding path program 1 times [2025-03-15 03:13:38,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:38,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562666271] [2025-03-15 03:13:38,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:38,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 03:13:38,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:38,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562666271] [2025-03-15 03:13:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562666271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:13:38,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945688509] [2025-03-15 03:13:38,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:38,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 03:13:38,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:38,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 03:13:38,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 03:13:38,964 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 188 [2025-03-15 03:13:38,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 267 transitions, 1552 flow. Second operand has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 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 03:13:38,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:38,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 188 [2025-03-15 03:13:38,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:41,208 INFO L124 PetriNetUnfolderBase]: 11212/26162 cut-off events. [2025-03-15 03:13:41,208 INFO L125 PetriNetUnfolderBase]: For 15707/16736 co-relation queries the response was YES. [2025-03-15 03:13:41,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73854 conditions, 26162 events. 11212/26162 cut-off events. For 15707/16736 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 281817 event pairs, 2513 based on Foata normal form. 50/23365 useless extension candidates. Maximal degree in co-relation 73842. Up to 10387 conditions per place. [2025-03-15 03:13:41,470 INFO L140 encePairwiseOnDemand]: 176/188 looper letters, 173 selfloop transitions, 11 changer transitions 15/283 dead transitions. [2025-03-15 03:13:41,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 283 transitions, 2008 flow [2025-03-15 03:13:41,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:41,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1206 transitions. [2025-03-15 03:13:41,472 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7127659574468085 [2025-03-15 03:13:41,472 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -38 predicate places. [2025-03-15 03:13:41,472 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 283 transitions, 2008 flow [2025-03-15 03:13:41,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.57142857142857) internal successors, (886), 7 states have internal predecessors, (886), 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 03:13:41,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:41,473 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:41,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 03:13:41,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1734495506, now seen corresponding path program 1 times [2025-03-15 03:13:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755527352] [2025-03-15 03:13:41,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:41,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 03:13:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:41,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755527352] [2025-03-15 03:13:41,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755527352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:41,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:41,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:41,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245273347] [2025-03-15 03:13:41,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:41,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:41,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:41,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:41,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:41,501 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-15 03:13:41,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 283 transitions, 2008 flow. Second operand has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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 03:13:41,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:41,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-15 03:13:41,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:44,373 INFO L124 PetriNetUnfolderBase]: 11010/25678 cut-off events. [2025-03-15 03:13:44,373 INFO L125 PetriNetUnfolderBase]: For 23377/24316 co-relation queries the response was YES. [2025-03-15 03:13:44,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75884 conditions, 25678 events. 11010/25678 cut-off events. For 23377/24316 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 275501 event pairs, 2479 based on Foata normal form. 0/22993 useless extension candidates. Maximal degree in co-relation 75871. Up to 10192 conditions per place. [2025-03-15 03:13:44,609 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 73 selfloop transitions, 9 changer transitions 15/278 dead transitions. [2025-03-15 03:13:44,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 278 transitions, 2144 flow [2025-03-15 03:13:44,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 03:13:44,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 03:13:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 663 transitions. [2025-03-15 03:13:44,610 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8816489361702128 [2025-03-15 03:13:44,611 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -36 predicate places. [2025-03-15 03:13:44,611 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 278 transitions, 2144 flow [2025-03-15 03:13:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.75) internal successors, (651), 4 states have internal predecessors, (651), 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 03:13:44,611 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:44,611 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:44,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 03:13:44,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1732871098, now seen corresponding path program 1 times [2025-03-15 03:13:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734214040] [2025-03-15 03:13:44,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:44,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:44,666 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 03:13:44,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:44,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734214040] [2025-03-15 03:13:44,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734214040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:44,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:44,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 03:13:44,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15039854] [2025-03-15 03:13:44,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:44,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 03:13:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:44,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 03:13:44,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 03:13:44,668 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 188 [2025-03-15 03:13:44,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 278 transitions, 2144 flow. Second operand has 7 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 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 03:13:44,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:44,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 188 [2025-03-15 03:13:44,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:51,579 INFO L124 PetriNetUnfolderBase]: 30129/63727 cut-off events. [2025-03-15 03:13:51,579 INFO L125 PetriNetUnfolderBase]: For 121969/129386 co-relation queries the response was YES. [2025-03-15 03:13:51,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218511 conditions, 63727 events. 30129/63727 cut-off events. For 121969/129386 co-relation queries the response was YES. Maximal size of possible extension queue 2944. Compared 737591 event pairs, 4793 based on Foata normal form. 162/54798 useless extension candidates. Maximal degree in co-relation 218497. Up to 24221 conditions per place. [2025-03-15 03:13:52,405 INFO L140 encePairwiseOnDemand]: 177/188 looper letters, 306 selfloop transitions, 28 changer transitions 15/450 dead transitions. [2025-03-15 03:13:52,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 450 transitions, 4560 flow [2025-03-15 03:13:52,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:13:52,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:13:52,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1273 transitions. [2025-03-15 03:13:52,407 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7523640661938534 [2025-03-15 03:13:52,407 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -28 predicate places. [2025-03-15 03:13:52,407 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 450 transitions, 4560 flow [2025-03-15 03:13:52,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 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 03:13:52,408 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:13:52,408 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:13:52,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 03:13:52,408 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:13:52,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:13:52,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2065214679, now seen corresponding path program 1 times [2025-03-15 03:13:52,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:13:52,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107118143] [2025-03-15 03:13:52,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:13:52,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:13:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:13:52,436 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 03:13:52,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:13:52,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107118143] [2025-03-15 03:13:52,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107118143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:13:52,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:13:52,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 03:13:52,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82735672] [2025-03-15 03:13:52,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:13:52,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 03:13:52,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:13:52,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 03:13:52,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 03:13:52,438 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 188 [2025-03-15 03:13:52,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 450 transitions, 4560 flow. Second operand has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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 03:13:52,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:13:52,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 188 [2025-03-15 03:13:52,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:13:59,350 INFO L124 PetriNetUnfolderBase]: 30706/63238 cut-off events. [2025-03-15 03:13:59,351 INFO L125 PetriNetUnfolderBase]: For 166937/172343 co-relation queries the response was YES. [2025-03-15 03:13:59,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231151 conditions, 63238 events. 30706/63238 cut-off events. For 166937/172343 co-relation queries the response was YES. Maximal size of possible extension queue 2978. Compared 717580 event pairs, 5035 based on Foata normal form. 6/54594 useless extension candidates. Maximal degree in co-relation 231136. Up to 24675 conditions per place. [2025-03-15 03:14:00,132 INFO L140 encePairwiseOnDemand]: 184/188 looper letters, 201 selfloop transitions, 17 changer transitions 15/499 dead transitions. [2025-03-15 03:14:00,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 499 transitions, 5608 flow [2025-03-15 03:14:00,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 03:14:00,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 03:14:00,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 670 transitions. [2025-03-15 03:14:00,134 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8909574468085106 [2025-03-15 03:14:00,134 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -25 predicate places. [2025-03-15 03:14:00,134 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 499 transitions, 5608 flow [2025-03-15 03:14:00,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 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 03:14:00,134 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:14:00,134 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:14:00,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 03:14:00,135 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:14:00,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:14:00,135 INFO L85 PathProgramCache]: Analyzing trace with hash 2115571393, now seen corresponding path program 1 times [2025-03-15 03:14:00,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:14:00,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102390546] [2025-03-15 03:14:00,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:14:00,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:14:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:14:00,237 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 03:14:00,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:14:00,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102390546] [2025-03-15 03:14:00,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102390546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:14:00,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:14:00,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 03:14:00,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902599869] [2025-03-15 03:14:00,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:14:00,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 03:14:00,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:14:00,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 03:14:00,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 03:14:00,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 188 [2025-03-15 03:14:00,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 499 transitions, 5608 flow. Second operand has 8 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 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 03:14:00,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:14:00,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 188 [2025-03-15 03:14:00,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:14:07,476 INFO L124 PetriNetUnfolderBase]: 27711/58314 cut-off events. [2025-03-15 03:14:07,476 INFO L125 PetriNetUnfolderBase]: For 183988/193539 co-relation queries the response was YES. [2025-03-15 03:14:07,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239630 conditions, 58314 events. 27711/58314 cut-off events. For 183988/193539 co-relation queries the response was YES. Maximal size of possible extension queue 2813. Compared 668803 event pairs, 4420 based on Foata normal form. 142/51864 useless extension candidates. Maximal degree in co-relation 239614. Up to 23992 conditions per place. [2025-03-15 03:14:08,150 INFO L140 encePairwiseOnDemand]: 176/188 looper letters, 315 selfloop transitions, 18 changer transitions 19/589 dead transitions. [2025-03-15 03:14:08,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 589 transitions, 7508 flow [2025-03-15 03:14:08,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 03:14:08,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 03:14:08,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1249 transitions. [2025-03-15 03:14:08,152 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7381796690307328 [2025-03-15 03:14:08,152 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -17 predicate places. [2025-03-15 03:14:08,152 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 589 transitions, 7508 flow [2025-03-15 03:14:08,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 132.25) internal successors, (1058), 8 states have internal predecessors, (1058), 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 03:14:08,153 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:14:08,153 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:14:08,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 03:14:08,153 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:14:08,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:14:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -893839344, now seen corresponding path program 1 times [2025-03-15 03:14:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:14:08,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986761174] [2025-03-15 03:14:08,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:14:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:14:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:14:08,232 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 03:14:08,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:14:08,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986761174] [2025-03-15 03:14:08,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986761174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:14:08,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:14:08,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:14:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575523704] [2025-03-15 03:14:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:14:08,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:14:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:14:08,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:14:08,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:14:08,233 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2025-03-15 03:14:08,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 589 transitions, 7508 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:08,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:14:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2025-03-15 03:14:08,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:14:16,807 INFO L124 PetriNetUnfolderBase]: 31721/63430 cut-off events. [2025-03-15 03:14:16,807 INFO L125 PetriNetUnfolderBase]: For 233628/253352 co-relation queries the response was YES. [2025-03-15 03:14:17,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304163 conditions, 63430 events. 31721/63430 cut-off events. For 233628/253352 co-relation queries the response was YES. Maximal size of possible extension queue 2972. Compared 708628 event pairs, 4297 based on Foata normal form. 165/56295 useless extension candidates. Maximal degree in co-relation 304146. Up to 28672 conditions per place. [2025-03-15 03:14:17,611 INFO L140 encePairwiseOnDemand]: 176/188 looper letters, 608 selfloop transitions, 23 changer transitions 19/738 dead transitions. [2025-03-15 03:14:17,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 738 transitions, 10876 flow [2025-03-15 03:14:17,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 03:14:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 03:14:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1369 transitions. [2025-03-15 03:14:17,613 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7281914893617021 [2025-03-15 03:14:17,614 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, -8 predicate places. [2025-03-15 03:14:17,614 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 738 transitions, 10876 flow [2025-03-15 03:14:17,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:17,614 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:14:17,614 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:14:17,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 03:14:17,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:14:17,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:14:17,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1462482276, now seen corresponding path program 2 times [2025-03-15 03:14:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:14:17,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308416930] [2025-03-15 03:14:17,615 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 03:14:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:14:17,621 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 03:14:17,621 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 03:14:17,690 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 03:14:17,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:14:17,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308416930] [2025-03-15 03:14:17,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308416930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:14:17,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:14:17,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:14:17,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569194345] [2025-03-15 03:14:17,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:14:17,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:14:17,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:14:17,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:14:17,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:14:17,692 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2025-03-15 03:14:17,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 738 transitions, 10876 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:17,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:14:17,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2025-03-15 03:14:17,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:14:31,593 INFO L124 PetriNetUnfolderBase]: 47380/95511 cut-off events. [2025-03-15 03:14:31,594 INFO L125 PetriNetUnfolderBase]: For 396268/448558 co-relation queries the response was YES. [2025-03-15 03:14:32,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516348 conditions, 95511 events. 47380/95511 cut-off events. For 396268/448558 co-relation queries the response was YES. Maximal size of possible extension queue 4466. Compared 1127532 event pairs, 6003 based on Foata normal form. 278/85317 useless extension candidates. Maximal degree in co-relation 516330. Up to 42617 conditions per place. [2025-03-15 03:14:33,420 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 887 selfloop transitions, 46 changer transitions 23/1044 dead transitions. [2025-03-15 03:14:33,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 1044 transitions, 17672 flow [2025-03-15 03:14:33,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 03:14:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 03:14:33,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1807 transitions. [2025-03-15 03:14:33,422 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7393617021276596 [2025-03-15 03:14:33,422 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, 4 predicate places. [2025-03-15 03:14:33,422 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 1044 transitions, 17672 flow [2025-03-15 03:14:33,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:33,423 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:14:33,423 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:14:33,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 03:14:33,423 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:14:33,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:14:33,424 INFO L85 PathProgramCache]: Analyzing trace with hash -230702998, now seen corresponding path program 3 times [2025-03-15 03:14:33,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:14:33,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750522616] [2025-03-15 03:14:33,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 03:14:33,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:14:33,430 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 03:14:33,430 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 03:14:33,481 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 03:14:33,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:14:33,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750522616] [2025-03-15 03:14:33,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750522616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:14:33,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:14:33,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:14:33,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452352849] [2025-03-15 03:14:33,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:14:33,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:14:33,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:14:33,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:14:33,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:14:33,483 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2025-03-15 03:14:33,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 1044 transitions, 17672 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:33,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:14:33,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2025-03-15 03:14:33,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:14:49,812 INFO L124 PetriNetUnfolderBase]: 47630/96477 cut-off events. [2025-03-15 03:14:49,812 INFO L125 PetriNetUnfolderBase]: For 453869/521382 co-relation queries the response was YES. [2025-03-15 03:14:50,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 583490 conditions, 96477 events. 47630/96477 cut-off events. For 453869/521382 co-relation queries the response was YES. Maximal size of possible extension queue 4519. Compared 1143263 event pairs, 5619 based on Foata normal form. 399/86406 useless extension candidates. Maximal degree in co-relation 583471. Up to 42875 conditions per place. [2025-03-15 03:14:51,373 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 943 selfloop transitions, 64 changer transitions 23/1118 dead transitions. [2025-03-15 03:14:51,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 1118 transitions, 20899 flow [2025-03-15 03:14:51,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 03:14:51,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 03:14:51,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1927 transitions. [2025-03-15 03:14:51,375 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7321428571428571 [2025-03-15 03:14:51,376 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, 17 predicate places. [2025-03-15 03:14:51,376 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 1118 transitions, 20899 flow [2025-03-15 03:14:51,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:51,376 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:14:51,376 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:14:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 03:14:51,376 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting f1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:14:51,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:14:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash -822370838, now seen corresponding path program 1 times [2025-03-15 03:14:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:14:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327304986] [2025-03-15 03:14:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:14:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:14:51,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:14:51,444 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 03:14:51,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:14:51,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327304986] [2025-03-15 03:14:51,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327304986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:14:51,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:14:51,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 03:14:51,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487150375] [2025-03-15 03:14:51,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:14:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-15 03:14:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:14:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-15 03:14:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-15 03:14:51,446 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 188 [2025-03-15 03:14:51,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 1118 transitions, 20899 flow. Second operand has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:14:51,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:14:51,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 188 [2025-03-15 03:14:51,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:15:09,947 INFO L124 PetriNetUnfolderBase]: 47842/97519 cut-off events. [2025-03-15 03:15:09,947 INFO L125 PetriNetUnfolderBase]: For 521363/597056 co-relation queries the response was YES. [2025-03-15 03:15:10,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651228 conditions, 97519 events. 47842/97519 cut-off events. For 521363/597056 co-relation queries the response was YES. Maximal size of possible extension queue 4572. Compared 1162424 event pairs, 4832 based on Foata normal form. 670/87720 useless extension candidates. Maximal degree in co-relation 651208. Up to 43227 conditions per place. [2025-03-15 03:15:11,942 INFO L140 encePairwiseOnDemand]: 175/188 looper letters, 1070 selfloop transitions, 56 changer transitions 23/1237 dead transitions. [2025-03-15 03:15:11,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 1237 transitions, 25308 flow [2025-03-15 03:15:11,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 03:15:11,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 03:15:11,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1676 transitions. [2025-03-15 03:15:11,944 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7429078014184397 [2025-03-15 03:15:11,944 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, 28 predicate places. [2025-03-15 03:15:11,944 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 1237 transitions, 25308 flow [2025-03-15 03:15:11,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 123.55555555555556) internal successors, (1112), 9 states have internal predecessors, (1112), 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 03:15:11,945 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:15:11,945 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:15:11,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 03:15:11,945 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:15:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:15:11,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1211605469, now seen corresponding path program 1 times [2025-03-15 03:15:11,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:15:11,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073898446] [2025-03-15 03:15:11,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:15:11,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:15:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:15:12,047 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 03:15:12,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:15:12,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073898446] [2025-03-15 03:15:12,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073898446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:15:12,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:15:12,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 03:15:12,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795007010] [2025-03-15 03:15:12,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:15:12,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 03:15:12,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:15:12,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 03:15:12,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-15 03:15:12,048 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2025-03-15 03:15:12,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 1237 transitions, 25308 flow. Second operand has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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 03:15:12,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:15:12,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2025-03-15 03:15:12,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:15:30,899 INFO L124 PetriNetUnfolderBase]: 46869/95984 cut-off events. [2025-03-15 03:15:30,899 INFO L125 PetriNetUnfolderBase]: For 569228/640423 co-relation queries the response was YES. [2025-03-15 03:15:31,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688645 conditions, 95984 events. 46869/95984 cut-off events. For 569228/640423 co-relation queries the response was YES. Maximal size of possible extension queue 4506. Compared 1145931 event pairs, 4575 based on Foata normal form. 383/86554 useless extension candidates. Maximal degree in co-relation 688624. Up to 43227 conditions per place. [2025-03-15 03:15:32,963 INFO L140 encePairwiseOnDemand]: 173/188 looper letters, 627 selfloop transitions, 67 changer transitions 35/1211 dead transitions. [2025-03-15 03:15:32,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 1211 transitions, 26060 flow [2025-03-15 03:15:32,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-15 03:15:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-15 03:15:32,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 2181 transitions. [2025-03-15 03:15:32,966 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7250664893617021 [2025-03-15 03:15:32,966 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, 43 predicate places. [2025-03-15 03:15:32,966 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 1211 transitions, 26060 flow [2025-03-15 03:15:32,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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 03:15:32,967 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:15:32,967 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:15:32,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 03:15:32,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting f1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:15:32,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:15:32,967 INFO L85 PathProgramCache]: Analyzing trace with hash 276308401, now seen corresponding path program 1 times [2025-03-15 03:15:32,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:15:32,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239428539] [2025-03-15 03:15:32,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:15:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:15:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:15:33,078 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 03:15:33,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:15:33,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239428539] [2025-03-15 03:15:33,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239428539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:15:33,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 03:15:33,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 03:15:33,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600852320] [2025-03-15 03:15:33,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:15:33,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 03:15:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:15:33,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 03:15:33,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-15 03:15:33,080 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 188 [2025-03-15 03:15:33,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 1211 transitions, 26060 flow. Second operand has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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 03:15:33,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:15:33,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 188 [2025-03-15 03:15:33,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 03:15:52,219 INFO L124 PetriNetUnfolderBase]: 46533/95414 cut-off events. [2025-03-15 03:15:52,219 INFO L125 PetriNetUnfolderBase]: For 638123/715927 co-relation queries the response was YES. [2025-03-15 03:15:53,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 733309 conditions, 95414 events. 46533/95414 cut-off events. For 638123/715927 co-relation queries the response was YES. Maximal size of possible extension queue 4484. Compared 1138949 event pairs, 4575 based on Foata normal form. 327/86171 useless extension candidates. Maximal degree in co-relation 733287. Up to 42773 conditions per place. [2025-03-15 03:15:54,383 INFO L140 encePairwiseOnDemand]: 174/188 looper letters, 631 selfloop transitions, 54 changer transitions 39/1202 dead transitions. [2025-03-15 03:15:54,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1202 transitions, 27291 flow [2025-03-15 03:15:54,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 03:15:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 03:15:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2056 transitions. [2025-03-15 03:15:54,385 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7290780141843972 [2025-03-15 03:15:54,386 INFO L298 CegarLoopForPetriNet]: 192 programPoint places, 57 predicate places. [2025-03-15 03:15:54,386 INFO L471 AbstractCegarLoop]: Abstraction has has 249 places, 1202 transitions, 27291 flow [2025-03-15 03:15:54,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 127.3) internal successors, (1273), 10 states have internal predecessors, (1273), 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 03:15:54,386 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 03:15:54,386 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 03:15:54,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 03:15:54,386 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting f2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 25 more)] === [2025-03-15 03:15:54,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 03:15:54,387 INFO L85 PathProgramCache]: Analyzing trace with hash 111659663, now seen corresponding path program 1 times [2025-03-15 03:15:54,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 03:15:54,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713907542] [2025-03-15 03:15:54,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:15:54,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 03:15:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:15:54,429 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:15:54,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 03:15:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713907542] [2025-03-15 03:15:54,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713907542] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 03:15:54,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749242627] [2025-03-15 03:15:54,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 03:15:54,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 03:15:54,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 03:15:54,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 03:15:54,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 03:15:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 03:15:54,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-15 03:15:54,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 03:15:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 03:15:54,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 03:15:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749242627] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 03:15:54,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 03:15:54,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [5] total 14 [2025-03-15 03:15:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825214561] [2025-03-15 03:15:54,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 03:15:54,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 03:15:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 03:15:54,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 03:15:54,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2025-03-15 03:15:54,677 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 188 [2025-03-15 03:15:54,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 1202 transitions, 27291 flow. Second operand has 10 states, 10 states have (on average 121.9) internal successors, (1219), 10 states have internal predecessors, (1219), 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 03:15:54,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 03:15:54,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 188 [2025-03-15 03:15:54,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand