/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/reorder_2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:24:41,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:24:41,570 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:24:41,598 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:24:41,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:24:41,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:24:41,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:24:41,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:24:41,600 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:24:41,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:24:41,601 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:24:41,602 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:41,602 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:24:41,602 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:24:41,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:24:41,862 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:24:41,863 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:24:41,864 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:24:41,864 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:24:41,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/reorder_2.i [2025-03-15 01:24:43,009 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bab653f/d5b4654f2c0646608c04e139a84486f4/FLAGabc0f2b3c [2025-03-15 01:24:43,326 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:24:43,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/reorder_2.i [2025-03-15 01:24:43,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bab653f/d5b4654f2c0646608c04e139a84486f4/FLAGabc0f2b3c [2025-03-15 01:24:43,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bab653f/d5b4654f2c0646608c04e139a84486f4 [2025-03-15 01:24:43,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:24:43,360 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:24:43,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:43,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:24:43,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:24:43,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a25ec8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43, skipping insertion in model container [2025-03-15 01:24:43,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:24:43,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:43,753 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:24:43,805 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:24:43,874 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:24:43,875 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43 WrapperNode [2025-03-15 01:24:43,875 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:24:43,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:43,876 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:24:43,876 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:24:43,882 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,899 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,915 INFO L138 Inliner]: procedures = 372, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 133 [2025-03-15 01:24:43,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:24:43,916 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:24:43,916 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:24:43,916 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:24:43,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,924 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,925 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:24:43,940 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:24:43,940 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:24:43,940 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:24:43,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (1/1) ... [2025-03-15 01:24:43,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:24:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:24:43,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:24:43,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:24:43,988 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-15 01:24:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-15 01:24:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:24:43,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:24:43,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:24:43,991 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:24:44,131 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:24:44,133 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:24:44,312 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:24:44,312 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:24:44,321 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:24:44,321 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:24:44,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:44 BoogieIcfgContainer [2025-03-15 01:24:44,321 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:24:44,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:24:44,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:24:44,327 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:24:44,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:24:43" (1/3) ... [2025-03-15 01:24:44,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c199ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:44, skipping insertion in model container [2025-03-15 01:24:44,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:24:43" (2/3) ... [2025-03-15 01:24:44,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c199ffa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:24:44, skipping insertion in model container [2025-03-15 01:24:44,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:24:44" (3/3) ... [2025-03-15 01:24:44,329 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_2.i [2025-03-15 01:24:44,340 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:24:44,342 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_2.i that has 3 procedures, 145 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-15 01:24:44,342 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:24:44,400 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-15 01:24:44,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:44,447 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;@423b5d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:44,448 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:44,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:44,519 INFO L124 PetriNetUnfolderBase]: 4/87 cut-off events. [2025-03-15 01:24:44,521 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:44,521 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:44,522 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:44,523 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:44,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:44,528 INFO L85 PathProgramCache]: Analyzing trace with hash 638338356, now seen corresponding path program 1 times [2025-03-15 01:24:44,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:44,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834787882] [2025-03-15 01:24:44,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:44,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:44,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:44,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:44,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834787882] [2025-03-15 01:24:44,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834787882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:44,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:44,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:44,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503800611] [2025-03-15 01:24:44,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:44,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:44,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:44,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:44,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:44,858 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2025-03-15 01:24:44,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 159 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:44,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:44,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2025-03-15 01:24:44,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,043 INFO L124 PetriNetUnfolderBase]: 13/380 cut-off events. [2025-03-15 01:24:45,044 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-03-15 01:24:45,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 380 events. 13/380 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1460 event pairs, 0 based on Foata normal form. 93/417 useless extension candidates. Maximal degree in co-relation 217. Up to 66 conditions per place. [2025-03-15 01:24:45,049 INFO L140 encePairwiseOnDemand]: 138/159 looper letters, 44 selfloop transitions, 10 changer transitions 36/171 dead transitions. [2025-03-15 01:24:45,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 171 transitions, 494 flow [2025-03-15 01:24:45,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:45,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2025-03-15 01:24:45,065 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7974842767295598 [2025-03-15 01:24:45,067 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 0 predicate places. [2025-03-15 01:24:45,068 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 171 transitions, 494 flow [2025-03-15 01:24:45,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,068 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,068 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] [2025-03-15 01:24:45,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:24:45,068 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,069 INFO L85 PathProgramCache]: Analyzing trace with hash -2077288123, now seen corresponding path program 1 times [2025-03-15 01:24:45,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303692965] [2025-03-15 01:24:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303692965] [2025-03-15 01:24:45,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303692965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:45,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003057072] [2025-03-15 01:24:45,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,184 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 159 [2025-03-15 01:24:45,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 171 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 159 [2025-03-15 01:24:45,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,361 INFO L124 PetriNetUnfolderBase]: 16/595 cut-off events. [2025-03-15 01:24:45,363 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-15 01:24:45,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 595 events. 16/595 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3033 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 412. Up to 123 conditions per place. [2025-03-15 01:24:45,366 INFO L140 encePairwiseOnDemand]: 146/159 looper letters, 87 selfloop transitions, 9 changer transitions 45/221 dead transitions. [2025-03-15 01:24:45,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 221 transitions, 936 flow [2025-03-15 01:24:45,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 538 transitions. [2025-03-15 01:24:45,368 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8459119496855346 [2025-03-15 01:24:45,369 INFO L298 CegarLoopForPetriNet]: 151 programPoint places, 3 predicate places. [2025-03-15 01:24:45,369 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 221 transitions, 936 flow [2025-03-15 01:24:45,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,369 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,369 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:45,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:24:45,370 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1267573693, now seen corresponding path program 1 times [2025-03-15 01:24:45,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797900506] [2025-03-15 01:24:45,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:45,397 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:24:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:45,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:24:45,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:24:45,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:24:45,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:24:45,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:24:45,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:24:45,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:24:45,434 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-03-15 01:24:45,435 WARN L336 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:24:45,435 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-15 01:24:45,464 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-15 01:24:45,467 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:45,468 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;@423b5d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:45,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:45,474 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:45,474 INFO L124 PetriNetUnfolderBase]: 4/87 cut-off events. [2025-03-15 01:24:45,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:45,474 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,474 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:45,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,475 INFO L85 PathProgramCache]: Analyzing trace with hash -85978040, now seen corresponding path program 1 times [2025-03-15 01:24:45,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765727375] [2025-03-15 01:24:45,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:45,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765727375] [2025-03-15 01:24:45,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765727375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:45,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132306882] [2025-03-15 01:24:45,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,550 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:45,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 185 transitions, 414 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:45,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:45,831 INFO L124 PetriNetUnfolderBase]: 100/1560 cut-off events. [2025-03-15 01:24:45,832 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-03-15 01:24:45,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2203 conditions, 1560 events. 100/1560 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 11081 event pairs, 0 based on Foata normal form. 782/2091 useless extension candidates. Maximal degree in co-relation 1082. Up to 298 conditions per place. [2025-03-15 01:24:45,838 INFO L140 encePairwiseOnDemand]: 162/185 looper letters, 65 selfloop transitions, 10 changer transitions 34/206 dead transitions. [2025-03-15 01:24:45,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 206 transitions, 638 flow [2025-03-15 01:24:45,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:45,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:45,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 744 transitions. [2025-03-15 01:24:45,840 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8043243243243243 [2025-03-15 01:24:45,840 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 0 predicate places. [2025-03-15 01:24:45,840 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 206 transitions, 638 flow [2025-03-15 01:24:45,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,841 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:45,841 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] [2025-03-15 01:24:45,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:24:45,841 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 886422138, now seen corresponding path program 1 times [2025-03-15 01:24:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420883360] [2025-03-15 01:24:45,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:45,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420883360] [2025-03-15 01:24:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420883360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:45,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:45,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011138453] [2025-03-15 01:24:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:45,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:45,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:45,912 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 206 transitions, 638 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:46,330 INFO L124 PetriNetUnfolderBase]: 171/2769 cut-off events. [2025-03-15 01:24:46,330 INFO L125 PetriNetUnfolderBase]: For 561/561 co-relation queries the response was YES. [2025-03-15 01:24:46,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4826 conditions, 2769 events. 171/2769 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23868 event pairs, 0 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 2297. Up to 537 conditions per place. [2025-03-15 01:24:46,340 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 124 selfloop transitions, 10 changer transitions 39/274 dead transitions. [2025-03-15 01:24:46,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 274 transitions, 1256 flow [2025-03-15 01:24:46,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:46,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:46,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 630 transitions. [2025-03-15 01:24:46,343 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8513513513513513 [2025-03-15 01:24:46,344 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 3 predicate places. [2025-03-15 01:24:46,344 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 274 transitions, 1256 flow [2025-03-15 01:24:46,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:46,344 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:46,344 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:46,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:24:46,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:46,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:46,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1099165141, now seen corresponding path program 1 times [2025-03-15 01:24:46,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:46,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954604879] [2025-03-15 01:24:46,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:46,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:46,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:46,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:46,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:46,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954604879] [2025-03-15 01:24:46,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954604879] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:46,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:46,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:46,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929591409] [2025-03-15 01:24:46,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:46,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:46,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:46,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:46,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:46,406 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:46,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 274 transitions, 1256 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:46,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:46,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:46,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:46,756 INFO L124 PetriNetUnfolderBase]: 171/2759 cut-off events. [2025-03-15 01:24:46,756 INFO L125 PetriNetUnfolderBase]: For 1237/1237 co-relation queries the response was YES. [2025-03-15 01:24:46,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 2759 events. 171/2759 cut-off events. For 1237/1237 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23778 event pairs, 0 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 2731. Up to 552 conditions per place. [2025-03-15 01:24:46,767 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 117 selfloop transitions, 19 changer transitions 39/277 dead transitions. [2025-03-15 01:24:46,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 277 transitions, 1550 flow [2025-03-15 01:24:46,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2025-03-15 01:24:46,769 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7848648648648648 [2025-03-15 01:24:46,769 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 7 predicate places. [2025-03-15 01:24:46,769 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 277 transitions, 1550 flow [2025-03-15 01:24:46,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:46,770 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:46,770 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] [2025-03-15 01:24:46,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:24:46,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:46,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:46,770 INFO L85 PathProgramCache]: Analyzing trace with hash 416688804, now seen corresponding path program 1 times [2025-03-15 01:24:46,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:46,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173254706] [2025-03-15 01:24:46,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:46,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:46,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173254706] [2025-03-15 01:24:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173254706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12253732] [2025-03-15 01:24:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:46,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:46,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:46,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:46,889 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:46,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 277 transitions, 1550 flow. Second operand has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:46,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:46,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:46,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:47,284 INFO L124 PetriNetUnfolderBase]: 171/2757 cut-off events. [2025-03-15 01:24:47,285 INFO L125 PetriNetUnfolderBase]: For 2279/2279 co-relation queries the response was YES. [2025-03-15 01:24:47,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6666 conditions, 2757 events. 171/2757 cut-off events. For 2279/2279 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23793 event pairs, 0 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 3170. Up to 552 conditions per place. [2025-03-15 01:24:47,296 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 113 selfloop transitions, 22 changer transitions 39/276 dead transitions. [2025-03-15 01:24:47,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 276 transitions, 1832 flow [2025-03-15 01:24:47,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:47,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:47,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2025-03-15 01:24:47,298 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7583011583011583 [2025-03-15 01:24:47,298 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 12 predicate places. [2025-03-15 01:24:47,298 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 276 transitions, 1832 flow [2025-03-15 01:24:47,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.66666666666666) internal successors, (790), 6 states have internal predecessors, (790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,299 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:47,299 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:24:47,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:24:47,299 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 32451475, now seen corresponding path program 1 times [2025-03-15 01:24:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123526745] [2025-03-15 01:24:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:47,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123526745] [2025-03-15 01:24:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123526745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195101321] [2025-03-15 01:24:47,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:47,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:47,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:47,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 276 transitions, 1832 flow. Second operand has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:47,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:47,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:47,705 INFO L124 PetriNetUnfolderBase]: 171/2755 cut-off events. [2025-03-15 01:24:47,705 INFO L125 PetriNetUnfolderBase]: For 3675/3675 co-relation queries the response was YES. [2025-03-15 01:24:47,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7572 conditions, 2755 events. 171/2755 cut-off events. For 3675/3675 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 23753 event pairs, 0 based on Foata normal form. 0/2328 useless extension candidates. Maximal degree in co-relation 3605. Up to 552 conditions per place. [2025-03-15 01:24:47,719 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 116 selfloop transitions, 26 changer transitions 39/283 dead transitions. [2025-03-15 01:24:47,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 283 transitions, 2206 flow [2025-03-15 01:24:47,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1114 transitions. [2025-03-15 01:24:47,743 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7527027027027027 [2025-03-15 01:24:47,744 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 18 predicate places. [2025-03-15 01:24:47,744 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 283 transitions, 2206 flow [2025-03-15 01:24:47,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.83333333333334) internal successors, (791), 6 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,744 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:47,744 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:47,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:24:47,745 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:47,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:47,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1371648607, now seen corresponding path program 1 times [2025-03-15 01:24:47,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:47,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893301253] [2025-03-15 01:24:47,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:47,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:47,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:47,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893301253] [2025-03-15 01:24:47,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893301253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:47,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:47,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:47,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467961115] [2025-03-15 01:24:47,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:47,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:47,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:47,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:47,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:47,825 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:47,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 283 transitions, 2206 flow. Second operand has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:47,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:47,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:47,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:48,204 INFO L124 PetriNetUnfolderBase]: 157/2590 cut-off events. [2025-03-15 01:24:48,205 INFO L125 PetriNetUnfolderBase]: For 5145/5145 co-relation queries the response was YES. [2025-03-15 01:24:48,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8042 conditions, 2590 events. 157/2590 cut-off events. For 5145/5145 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21871 event pairs, 0 based on Foata normal form. 0/2186 useless extension candidates. Maximal degree in co-relation 3766. Up to 535 conditions per place. [2025-03-15 01:24:48,216 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 129 selfloop transitions, 11 changer transitions 37/280 dead transitions. [2025-03-15 01:24:48,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 280 transitions, 2456 flow [2025-03-15 01:24:48,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:48,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:48,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 626 transitions. [2025-03-15 01:24:48,218 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.845945945945946 [2025-03-15 01:24:48,219 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 21 predicate places. [2025-03-15 01:24:48,219 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 280 transitions, 2456 flow [2025-03-15 01:24:48,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.75) internal successors, (535), 4 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,219 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,219 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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] [2025-03-15 01:24:48,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:24:48,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:48,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,220 INFO L85 PathProgramCache]: Analyzing trace with hash -808573759, now seen corresponding path program 1 times [2025-03-15 01:24:48,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133069167] [2025-03-15 01:24:48,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:48,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133069167] [2025-03-15 01:24:48,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133069167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:48,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:48,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:24:48,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900287068] [2025-03-15 01:24:48,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:48,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:24:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:48,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:24:48,373 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:24:48,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 185 [2025-03-15 01:24:48,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 280 transitions, 2456 flow. Second operand has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:48,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 185 [2025-03-15 01:24:48,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:48,862 INFO L124 PetriNetUnfolderBase]: 157/2585 cut-off events. [2025-03-15 01:24:48,862 INFO L125 PetriNetUnfolderBase]: For 7117/7117 co-relation queries the response was YES. [2025-03-15 01:24:48,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8898 conditions, 2585 events. 157/2585 cut-off events. For 7117/7117 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21911 event pairs, 0 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4167. Up to 533 conditions per place. [2025-03-15 01:24:48,874 INFO L140 encePairwiseOnDemand]: 170/185 looper letters, 132 selfloop transitions, 18 changer transitions 37/284 dead transitions. [2025-03-15 01:24:48,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 284 transitions, 2792 flow [2025-03-15 01:24:48,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:24:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:24:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1359 transitions. [2025-03-15 01:24:48,877 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7345945945945946 [2025-03-15 01:24:48,877 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 30 predicate places. [2025-03-15 01:24:48,878 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 284 transitions, 2792 flow [2025-03-15 01:24:48,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,878 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:48,878 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:48,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:24:48,879 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:48,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:48,879 INFO L85 PathProgramCache]: Analyzing trace with hash 60312188, now seen corresponding path program 1 times [2025-03-15 01:24:48,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:48,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395166991] [2025-03-15 01:24:48,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:48,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:48,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395166991] [2025-03-15 01:24:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395166991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:48,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:48,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:48,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056768438] [2025-03-15 01:24:48,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:48,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:48,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:48,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:48,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:48,963 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:48,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 284 transitions, 2792 flow. Second operand has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:48,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:48,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:48,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:49,355 INFO L124 PetriNetUnfolderBase]: 157/2580 cut-off events. [2025-03-15 01:24:49,356 INFO L125 PetriNetUnfolderBase]: For 9337/9337 co-relation queries the response was YES. [2025-03-15 01:24:49,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9776 conditions, 2580 events. 157/2580 cut-off events. For 9337/9337 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21782 event pairs, 0 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4580. Up to 528 conditions per place. [2025-03-15 01:24:49,369 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 115 selfloop transitions, 24 changer transitions 37/283 dead transitions. [2025-03-15 01:24:49,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 283 transitions, 3078 flow [2025-03-15 01:24:49,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:49,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 982 transitions. [2025-03-15 01:24:49,371 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7583011583011583 [2025-03-15 01:24:49,372 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 35 predicate places. [2025-03-15 01:24:49,372 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 283 transitions, 3078 flow [2025-03-15 01:24:49,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.0) internal successors, (792), 6 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:49,372 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:49,373 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:49,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:24:49,373 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:49,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:49,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1869678323, now seen corresponding path program 1 times [2025-03-15 01:24:49,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:49,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68158126] [2025-03-15 01:24:49,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:49,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:49,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:49,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:49,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:49,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68158126] [2025-03-15 01:24:49,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68158126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:49,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:49,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:49,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043520391] [2025-03-15 01:24:49,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:49,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:49,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:49,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:49,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:49,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:49,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 283 transitions, 3078 flow. Second operand has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:49,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:49,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:49,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:49,812 INFO L124 PetriNetUnfolderBase]: 157/2575 cut-off events. [2025-03-15 01:24:49,812 INFO L125 PetriNetUnfolderBase]: For 11879/11879 co-relation queries the response was YES. [2025-03-15 01:24:49,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10644 conditions, 2575 events. 157/2575 cut-off events. For 11879/11879 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 21777 event pairs, 0 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4993. Up to 523 conditions per place. [2025-03-15 01:24:49,828 INFO L140 encePairwiseOnDemand]: 173/185 looper letters, 118 selfloop transitions, 28 changer transitions 37/290 dead transitions. [2025-03-15 01:24:49,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 290 transitions, 3520 flow [2025-03-15 01:24:49,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:49,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1114 transitions. [2025-03-15 01:24:49,830 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7527027027027027 [2025-03-15 01:24:49,831 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 41 predicate places. [2025-03-15 01:24:49,831 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 290 transitions, 3520 flow [2025-03-15 01:24:49,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.16666666666666) internal successors, (793), 6 states have internal predecessors, (793), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:49,832 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:49,832 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:49,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:24:49,832 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:49,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:49,832 INFO L85 PathProgramCache]: Analyzing trace with hash -604379910, now seen corresponding path program 1 times [2025-03-15 01:24:49,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:49,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967573883] [2025-03-15 01:24:49,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:49,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:49,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:49,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:49,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967573883] [2025-03-15 01:24:49,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967573883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:49,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:49,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:49,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811883867] [2025-03-15 01:24:49,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:49,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:49,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:49,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:49,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:49,880 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 185 [2025-03-15 01:24:49,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 290 transitions, 3520 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:49,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:49,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 185 [2025-03-15 01:24:49,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:50,259 INFO L124 PetriNetUnfolderBase]: 157/2542 cut-off events. [2025-03-15 01:24:50,259 INFO L125 PetriNetUnfolderBase]: For 14170/14170 co-relation queries the response was YES. [2025-03-15 01:24:50,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11649 conditions, 2542 events. 157/2542 cut-off events. For 14170/14170 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 21339 event pairs, 0 based on Foata normal form. 0/2199 useless extension candidates. Maximal degree in co-relation 5449. Up to 618 conditions per place. [2025-03-15 01:24:50,270 INFO L140 encePairwiseOnDemand]: 172/185 looper letters, 125 selfloop transitions, 23 changer transitions 37/293 dead transitions. [2025-03-15 01:24:50,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 293 transitions, 3834 flow [2025-03-15 01:24:50,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:50,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:50,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 726 transitions. [2025-03-15 01:24:50,272 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7848648648648648 [2025-03-15 01:24:50,273 INFO L298 CegarLoopForPetriNet]: 175 programPoint places, 45 predicate places. [2025-03-15 01:24:50,273 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 293 transitions, 3834 flow [2025-03-15 01:24:50,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,273 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:50,273 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:50,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:24:50,274 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:50,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:50,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1396433764, now seen corresponding path program 1 times [2025-03-15 01:24:50,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:50,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731053165] [2025-03-15 01:24:50,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:50,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:50,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:50,287 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:24:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:24:50,300 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:24:50,300 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:24:50,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:24:50,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:24:50,301 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:50,302 WARN L336 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:24:50,302 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-15 01:24:50,327 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-15 01:24:50,333 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:24:50,333 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;@423b5d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:24:50,333 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:24:50,338 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:24:50,338 INFO L124 PetriNetUnfolderBase]: 4/89 cut-off events. [2025-03-15 01:24:50,338 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:24:50,338 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:50,338 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:50,338 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:50,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:50,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1557489828, now seen corresponding path program 1 times [2025-03-15 01:24:50,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:50,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809040225] [2025-03-15 01:24:50,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:50,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:50,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:50,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:50,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809040225] [2025-03-15 01:24:50,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809040225] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:50,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:50,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:50,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792778237] [2025-03-15 01:24:50,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:50,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:50,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:50,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:50,379 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:50,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 211 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:50,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:50,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:50,919 INFO L124 PetriNetUnfolderBase]: 565/5822 cut-off events. [2025-03-15 01:24:50,920 INFO L125 PetriNetUnfolderBase]: For 647/647 co-relation queries the response was YES. [2025-03-15 01:24:50,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8496 conditions, 5822 events. 565/5822 cut-off events. For 647/647 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 56179 event pairs, 16 based on Foata normal form. 4361/9251 useless extension candidates. Maximal degree in co-relation 4301. Up to 1300 conditions per place. [2025-03-15 01:24:50,944 INFO L140 encePairwiseOnDemand]: 186/211 looper letters, 75 selfloop transitions, 10 changer transitions 34/232 dead transitions. [2025-03-15 01:24:50,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 232 transitions, 750 flow [2025-03-15 01:24:50,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:50,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:50,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 843 transitions. [2025-03-15 01:24:50,947 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7990521327014218 [2025-03-15 01:24:50,947 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, -2 predicate places. [2025-03-15 01:24:50,948 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 232 transitions, 750 flow [2025-03-15 01:24:50,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.0) internal successors, (592), 4 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,948 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:50,948 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] [2025-03-15 01:24:50,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:24:50,948 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:50,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:50,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1240067345, now seen corresponding path program 1 times [2025-03-15 01:24:50,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:50,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524140428] [2025-03-15 01:24:50,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:50,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:50,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:50,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524140428] [2025-03-15 01:24:50,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524140428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:50,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:50,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:50,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028354944] [2025-03-15 01:24:50,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:50,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:50,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:50,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:50,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:50,985 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:50,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 232 transitions, 750 flow. Second operand has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:50,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:50,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:50,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:52,071 INFO L124 PetriNetUnfolderBase]: 1071/11029 cut-off events. [2025-03-15 01:24:52,071 INFO L125 PetriNetUnfolderBase]: For 2663/2663 co-relation queries the response was YES. [2025-03-15 01:24:52,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19945 conditions, 11029 events. 1071/11029 cut-off events. For 2663/2663 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 125229 event pairs, 25 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 9860. Up to 2487 conditions per place. [2025-03-15 01:24:52,115 INFO L140 encePairwiseOnDemand]: 198/211 looper letters, 144 selfloop transitions, 10 changer transitions 39/310 dead transitions. [2025-03-15 01:24:52,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 310 transitions, 1486 flow [2025-03-15 01:24:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:52,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:52,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 714 transitions. [2025-03-15 01:24:52,117 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8459715639810427 [2025-03-15 01:24:52,117 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 1 predicate places. [2025-03-15 01:24:52,118 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 310 transitions, 1486 flow [2025-03-15 01:24:52,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 149.0) internal successors, (596), 4 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:52,118 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:52,118 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:52,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 01:24:52,118 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:52,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:52,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1105814469, now seen corresponding path program 1 times [2025-03-15 01:24:52,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:52,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241959983] [2025-03-15 01:24:52,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:52,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:52,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:52,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:52,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241959983] [2025-03-15 01:24:52,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241959983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:52,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:52,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:24:52,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230535395] [2025-03-15 01:24:52,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:52,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:52,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:52,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:52,169 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:52,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 310 transitions, 1486 flow. Second operand has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:52,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:52,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:52,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:53,415 INFO L124 PetriNetUnfolderBase]: 1071/11015 cut-off events. [2025-03-15 01:24:53,416 INFO L125 PetriNetUnfolderBase]: For 5427/5427 co-relation queries the response was YES. [2025-03-15 01:24:53,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23828 conditions, 11015 events. 1071/11015 cut-off events. For 5427/5427 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 125131 event pairs, 25 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 11762. Up to 2537 conditions per place. [2025-03-15 01:24:53,471 INFO L140 encePairwiseOnDemand]: 198/211 looper letters, 137 selfloop transitions, 19 changer transitions 39/313 dead transitions. [2025-03-15 01:24:53,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 313 transitions, 1820 flow [2025-03-15 01:24:53,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:24:53,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:24:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2025-03-15 01:24:53,473 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7781990521327015 [2025-03-15 01:24:53,473 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 5 predicate places. [2025-03-15 01:24:53,473 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 313 transitions, 1820 flow [2025-03-15 01:24:53,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 148.5) internal successors, (594), 4 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:53,473 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:53,473 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] [2025-03-15 01:24:53,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 01:24:53,474 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:53,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:53,474 INFO L85 PathProgramCache]: Analyzing trace with hash -955225428, now seen corresponding path program 1 times [2025-03-15 01:24:53,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:53,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225544521] [2025-03-15 01:24:53,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:53,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:53,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:53,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:53,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:53,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225544521] [2025-03-15 01:24:53,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225544521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:53,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:53,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:53,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008920136] [2025-03-15 01:24:53,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:53,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:53,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:53,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:53,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:53,536 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:53,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 313 transitions, 1820 flow. Second operand has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:53,537 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:53,537 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:53,537 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:54,707 INFO L124 PetriNetUnfolderBase]: 1071/11011 cut-off events. [2025-03-15 01:24:54,707 INFO L125 PetriNetUnfolderBase]: For 9639/9639 co-relation queries the response was YES. [2025-03-15 01:24:54,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27648 conditions, 11011 events. 1071/11011 cut-off events. For 9639/9639 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 125004 event pairs, 25 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 13636. Up to 2537 conditions per place. [2025-03-15 01:24:54,757 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 133 selfloop transitions, 22 changer transitions 39/312 dead transitions. [2025-03-15 01:24:54,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 312 transitions, 2142 flow [2025-03-15 01:24:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1111 transitions. [2025-03-15 01:24:54,759 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7522004062288422 [2025-03-15 01:24:54,760 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 10 predicate places. [2025-03-15 01:24:54,760 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 312 transitions, 2142 flow [2025-03-15 01:24:54,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.66666666666666) internal successors, (892), 6 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,760 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:54,760 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:24:54,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 01:24:54,760 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:54,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:54,761 INFO L85 PathProgramCache]: Analyzing trace with hash 452783452, now seen corresponding path program 1 times [2025-03-15 01:24:54,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:54,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614667386] [2025-03-15 01:24:54,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:54,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:54,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:54,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:54,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:54,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614667386] [2025-03-15 01:24:54,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614667386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:54,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:54,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:54,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527813915] [2025-03-15 01:24:54,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:54,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:54,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:54,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:54,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:54,811 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:54,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 312 transitions, 2142 flow. Second operand has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:54,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:54,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:54,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:56,344 INFO L124 PetriNetUnfolderBase]: 1071/11009 cut-off events. [2025-03-15 01:24:56,344 INFO L125 PetriNetUnfolderBase]: For 15269/15269 co-relation queries the response was YES. [2025-03-15 01:24:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31468 conditions, 11009 events. 1071/11009 cut-off events. For 15269/15269 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 125140 event pairs, 25 based on Foata normal form. 0/9279 useless extension candidates. Maximal degree in co-relation 15510. Up to 2537 conditions per place. [2025-03-15 01:24:56,424 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 144 selfloop transitions, 26 changer transitions 39/327 dead transitions. [2025-03-15 01:24:56,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 327 transitions, 2636 flow [2025-03-15 01:24:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:24:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:24:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1266 transitions. [2025-03-15 01:24:56,427 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-15 01:24:56,427 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 17 predicate places. [2025-03-15 01:24:56,427 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 327 transitions, 2636 flow [2025-03-15 01:24:56,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.83333333333334) internal successors, (893), 6 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:56,428 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:56,428 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:56,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 01:24:56,428 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:56,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:56,428 INFO L85 PathProgramCache]: Analyzing trace with hash 374611549, now seen corresponding path program 1 times [2025-03-15 01:24:56,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:56,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187279021] [2025-03-15 01:24:56,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:56,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:56,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:56,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187279021] [2025-03-15 01:24:56,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187279021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:56,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:56,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:24:56,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074302718] [2025-03-15 01:24:56,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:56,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:24:56,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:56,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:24:56,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:24:56,476 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:56,477 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 327 transitions, 2636 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:56,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:56,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:56,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:57,714 INFO L124 PetriNetUnfolderBase]: 1008/10423 cut-off events. [2025-03-15 01:24:57,715 INFO L125 PetriNetUnfolderBase]: For 21262/21262 co-relation queries the response was YES. [2025-03-15 01:24:57,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33778 conditions, 10423 events. 1008/10423 cut-off events. For 21262/21262 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 117458 event pairs, 26 based on Foata normal form. 0/8771 useless extension candidates. Maximal degree in co-relation 16516. Up to 2470 conditions per place. [2025-03-15 01:24:57,786 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 153 selfloop transitions, 11 changer transitions 37/324 dead transitions. [2025-03-15 01:24:57,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 324 transitions, 2934 flow [2025-03-15 01:24:57,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:24:57,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:24:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 710 transitions. [2025-03-15 01:24:57,788 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8412322274881516 [2025-03-15 01:24:57,788 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 20 predicate places. [2025-03-15 01:24:57,788 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 324 transitions, 2934 flow [2025-03-15 01:24:57,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:57,788 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:57,788 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:57,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 01:24:57,789 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:57,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:57,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1075952023, now seen corresponding path program 1 times [2025-03-15 01:24:57,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:57,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19838326] [2025-03-15 01:24:57,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:57,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:57,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:57,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:57,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19838326] [2025-03-15 01:24:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19838326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:57,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:57,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:57,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239453695] [2025-03-15 01:24:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:57,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:57,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:57,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:57,841 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:57,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 324 transitions, 2934 flow. Second operand has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:57,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:57,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:57,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:24:59,114 INFO L124 PetriNetUnfolderBase]: 1008/10409 cut-off events. [2025-03-15 01:24:59,114 INFO L125 PetriNetUnfolderBase]: For 29126/29126 co-relation queries the response was YES. [2025-03-15 01:24:59,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37481 conditions, 10409 events. 1008/10409 cut-off events. For 29126/29126 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 117250 event pairs, 26 based on Foata normal form. 0/8771 useless extension candidates. Maximal degree in co-relation 18323. Up to 2456 conditions per place. [2025-03-15 01:24:59,181 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 141 selfloop transitions, 24 changer transitions 37/323 dead transitions. [2025-03-15 01:24:59,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 323 transitions, 3272 flow [2025-03-15 01:24:59,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:24:59,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:24:59,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1111 transitions. [2025-03-15 01:24:59,182 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7522004062288422 [2025-03-15 01:24:59,183 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 25 predicate places. [2025-03-15 01:24:59,183 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 323 transitions, 3272 flow [2025-03-15 01:24:59,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.0) internal successors, (894), 6 states have internal predecessors, (894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:59,183 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:24:59,183 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:24:59,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 01:24:59,184 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:24:59,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:24:59,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1005224951, now seen corresponding path program 1 times [2025-03-15 01:24:59,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:24:59,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275367771] [2025-03-15 01:24:59,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:24:59,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:24:59,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:24:59,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:24:59,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:24:59,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275367771] [2025-03-15 01:24:59,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275367771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:24:59,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:24:59,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:24:59,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821035374] [2025-03-15 01:24:59,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:24:59,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:24:59,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:24:59,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:24:59,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:24:59,231 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:24:59,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 323 transitions, 3272 flow. Second operand has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:24:59,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:24:59,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:24:59,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:00,492 INFO L124 PetriNetUnfolderBase]: 1008/10402 cut-off events. [2025-03-15 01:25:00,492 INFO L125 PetriNetUnfolderBase]: For 38307/38307 co-relation queries the response was YES. [2025-03-15 01:25:00,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41184 conditions, 10402 events. 1008/10402 cut-off events. For 38307/38307 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 117198 event pairs, 26 based on Foata normal form. 0/8771 useless extension candidates. Maximal degree in co-relation 20116. Up to 2449 conditions per place. [2025-03-15 01:25:00,550 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 152 selfloop transitions, 28 changer transitions 37/338 dead transitions. [2025-03-15 01:25:00,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 338 transitions, 3854 flow [2025-03-15 01:25:00,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:00,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:00,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1266 transitions. [2025-03-15 01:25:00,551 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-15 01:25:00,551 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 32 predicate places. [2025-03-15 01:25:00,551 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 338 transitions, 3854 flow [2025-03-15 01:25:00,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.16666666666666) internal successors, (895), 6 states have internal predecessors, (895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,552 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:00,552 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:00,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-15 01:25:00,552 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash 801979627, now seen corresponding path program 1 times [2025-03-15 01:25:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877915253] [2025-03-15 01:25:00,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877915253] [2025-03-15 01:25:00,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877915253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:00,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:00,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:25:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778049038] [2025-03-15 01:25:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:00,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:25:00,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:00,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:25:00,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:00,643 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 211 [2025-03-15 01:25:00,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 338 transitions, 3854 flow. Second operand has 8 states, 8 states have (on average 144.5) internal successors, (1156), 8 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:00,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:00,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 211 [2025-03-15 01:25:00,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:01,872 INFO L124 PetriNetUnfolderBase]: 733/7984 cut-off events. [2025-03-15 01:25:01,872 INFO L125 PetriNetUnfolderBase]: For 37484/37484 co-relation queries the response was YES. [2025-03-15 01:25:01,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34005 conditions, 7984 events. 733/7984 cut-off events. For 37484/37484 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 84072 event pairs, 18 based on Foata normal form. 0/6733 useless extension candidates. Maximal degree in co-relation 20541. Up to 2009 conditions per place. [2025-03-15 01:25:01,909 INFO L140 encePairwiseOnDemand]: 196/211 looper letters, 164 selfloop transitions, 19 changer transitions 37/335 dead transitions. [2025-03-15 01:25:01,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 335 transitions, 4103 flow [2025-03-15 01:25:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:25:01,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:25:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1541 transitions. [2025-03-15 01:25:01,911 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7303317535545024 [2025-03-15 01:25:01,911 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 41 predicate places. [2025-03-15 01:25:01,911 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 335 transitions, 4103 flow [2025-03-15 01:25:01,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 144.5) internal successors, (1156), 8 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,912 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:01,912 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:01,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 01:25:01,912 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:01,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:01,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1530490025, now seen corresponding path program 1 times [2025-03-15 01:25:01,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:01,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23964853] [2025-03-15 01:25:01,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:01,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:01,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:01,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23964853] [2025-03-15 01:25:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23964853] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:01,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:01,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:01,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398019737] [2025-03-15 01:25:01,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:01,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:01,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:01,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:01,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:01,942 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:25:01,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 335 transitions, 4103 flow. Second operand has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:01,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:01,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:25:01,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:02,922 INFO L124 PetriNetUnfolderBase]: 733/7915 cut-off events. [2025-03-15 01:25:02,922 INFO L125 PetriNetUnfolderBase]: For 44624/44624 co-relation queries the response was YES. [2025-03-15 01:25:02,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37285 conditions, 7915 events. 733/7915 cut-off events. For 44624/44624 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 83019 event pairs, 18 based on Foata normal form. 0/6780 useless extension candidates. Maximal degree in co-relation 22487. Up to 2201 conditions per place. [2025-03-15 01:25:02,983 INFO L140 encePairwiseOnDemand]: 198/211 looper letters, 146 selfloop transitions, 23 changer transitions 37/338 dead transitions. [2025-03-15 01:25:02,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 338 transitions, 4459 flow [2025-03-15 01:25:02,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2025-03-15 01:25:02,984 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7781990521327015 [2025-03-15 01:25:02,985 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 45 predicate places. [2025-03-15 01:25:02,985 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 338 transitions, 4459 flow [2025-03-15 01:25:02,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.25) internal successors, (601), 4 states have internal predecessors, (601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:02,985 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:02,985 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:02,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-15 01:25:02,985 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:02,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:02,986 INFO L85 PathProgramCache]: Analyzing trace with hash -620295078, now seen corresponding path program 1 times [2025-03-15 01:25:02,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:02,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420626621] [2025-03-15 01:25:02,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:02,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:02,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420626621] [2025-03-15 01:25:03,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420626621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:03,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:03,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:03,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381387904] [2025-03-15 01:25:03,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:03,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:03,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:03,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:03,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:03,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:25:03,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 338 transitions, 4459 flow. Second operand has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:03,023 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:03,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:25:03,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:04,330 INFO L124 PetriNetUnfolderBase]: 733/7810 cut-off events. [2025-03-15 01:25:04,331 INFO L125 PetriNetUnfolderBase]: For 52179/52179 co-relation queries the response was YES. [2025-03-15 01:25:04,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40572 conditions, 7810 events. 733/7810 cut-off events. For 52179/52179 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 81584 event pairs, 18 based on Foata normal form. 0/6853 useless extension candidates. Maximal degree in co-relation 24406. Up to 2201 conditions per place. [2025-03-15 01:25:04,391 INFO L140 encePairwiseOnDemand]: 198/211 looper letters, 146 selfloop transitions, 23 changer transitions 37/341 dead transitions. [2025-03-15 01:25:04,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 341 transitions, 4815 flow [2025-03-15 01:25:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 821 transitions. [2025-03-15 01:25:04,393 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7781990521327015 [2025-03-15 01:25:04,393 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 49 predicate places. [2025-03-15 01:25:04,393 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 341 transitions, 4815 flow [2025-03-15 01:25:04,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.75) internal successors, (603), 4 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:04,393 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:04,393 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:25:04,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 01:25:04,393 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2100476897, now seen corresponding path program 1 times [2025-03-15 01:25:04,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:04,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829681150] [2025-03-15 01:25:04,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:04,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:04,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829681150] [2025-03-15 01:25:04,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829681150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:04,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:04,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:25:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38674400] [2025-03-15 01:25:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:04,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:25:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:25:04,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:04,457 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:25:04,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 341 transitions, 4815 flow. Second operand has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:04,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:04,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:25:04,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:05,662 INFO L124 PetriNetUnfolderBase]: 733/7809 cut-off events. [2025-03-15 01:25:05,662 INFO L125 PetriNetUnfolderBase]: For 62968/62968 co-relation queries the response was YES. [2025-03-15 01:25:05,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43342 conditions, 7809 events. 733/7809 cut-off events. For 62968/62968 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 81405 event pairs, 18 based on Foata normal form. 0/6853 useless extension candidates. Maximal degree in co-relation 26085. Up to 2201 conditions per place. [2025-03-15 01:25:05,701 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 146 selfloop transitions, 34 changer transitions 37/344 dead transitions. [2025-03-15 01:25:05,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 344 transitions, 5273 flow [2025-03-15 01:25:05,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:25:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:25:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1707 transitions. [2025-03-15 01:25:05,703 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7354588539422663 [2025-03-15 01:25:05,704 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 58 predicate places. [2025-03-15 01:25:05,704 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 344 transitions, 5273 flow [2025-03-15 01:25:05,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.125) internal successors, (1193), 8 states have internal predecessors, (1193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:05,704 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:05,705 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:25:05,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 01:25:05,705 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:05,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:05,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1994807284, now seen corresponding path program 1 times [2025-03-15 01:25:05,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:05,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763486445] [2025-03-15 01:25:05,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:05,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:05,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:05,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:05,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763486445] [2025-03-15 01:25:05,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763486445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:05,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:05,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:25:05,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419875149] [2025-03-15 01:25:05,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:05,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:25:05,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:05,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:25:05,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:05,772 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 211 [2025-03-15 01:25:05,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 344 transitions, 5273 flow. Second operand has 8 states, 8 states have (on average 149.375) internal successors, (1195), 8 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:05,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:05,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 211 [2025-03-15 01:25:05,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:06,933 INFO L124 PetriNetUnfolderBase]: 733/7803 cut-off events. [2025-03-15 01:25:06,933 INFO L125 PetriNetUnfolderBase]: For 74538/74538 co-relation queries the response was YES. [2025-03-15 01:25:06,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46132 conditions, 7803 events. 733/7803 cut-off events. For 74538/74538 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 81491 event pairs, 18 based on Foata normal form. 0/6853 useless extension candidates. Maximal degree in co-relation 27777. Up to 2201 conditions per place. [2025-03-15 01:25:06,998 INFO L140 encePairwiseOnDemand]: 199/211 looper letters, 146 selfloop transitions, 36 changer transitions 37/351 dead transitions. [2025-03-15 01:25:06,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 351 transitions, 5849 flow [2025-03-15 01:25:06,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:25:06,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:25:06,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1707 transitions. [2025-03-15 01:25:06,999 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7354588539422663 [2025-03-15 01:25:06,999 INFO L298 CegarLoopForPetriNet]: 199 programPoint places, 67 predicate places. [2025-03-15 01:25:07,000 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 351 transitions, 5849 flow [2025-03-15 01:25:07,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 149.375) internal successors, (1195), 8 states have internal predecessors, (1195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:07,000 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:07,000 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:07,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-15 01:25:07,000 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:07,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:07,001 INFO L85 PathProgramCache]: Analyzing trace with hash -989319878, now seen corresponding path program 1 times [2025-03-15 01:25:07,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:07,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694807924] [2025-03-15 01:25:07,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:07,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:25:07,013 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:25:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:25:07,032 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:25:07,032 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:25:07,032 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:25:07,033 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:25:07,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-15 01:25:07,033 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:07,035 WARN L336 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:25:07,035 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-15 01:25:07,054 INFO L143 ThreadInstanceAdder]: Constructed 16 joinOtherThreadTransitions. [2025-03-15 01:25:07,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:25:07,057 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;@423b5d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:25:07,057 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:25:07,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:25:07,060 INFO L124 PetriNetUnfolderBase]: 4/88 cut-off events. [2025-03-15 01:25:07,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:25:07,060 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:07,060 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:07,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:07,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:07,060 INFO L85 PathProgramCache]: Analyzing trace with hash 518770288, now seen corresponding path program 1 times [2025-03-15 01:25:07,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:07,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911489904] [2025-03-15 01:25:07,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:07,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:07,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:07,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:07,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911489904] [2025-03-15 01:25:07,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911489904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:07,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:07,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951608878] [2025-03-15 01:25:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:07,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:07,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:07,083 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:07,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 237 transitions, 578 flow. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:07,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:07,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:07,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:09,351 INFO L124 PetriNetUnfolderBase]: 2926/22106 cut-off events. [2025-03-15 01:25:09,352 INFO L125 PetriNetUnfolderBase]: For 3252/3252 co-relation queries the response was YES. [2025-03-15 01:25:09,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33555 conditions, 22106 events. 2926/22106 cut-off events. For 3252/3252 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 265387 event pairs, 284 based on Foata normal form. 21628/40321 useless extension candidates. Maximal degree in co-relation 16762. Up to 5550 conditions per place. [2025-03-15 01:25:09,431 INFO L140 encePairwiseOnDemand]: 210/237 looper letters, 85 selfloop transitions, 10 changer transitions 34/258 dead transitions. [2025-03-15 01:25:09,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 258 transitions, 866 flow [2025-03-15 01:25:09,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:09,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:09,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 942 transitions. [2025-03-15 01:25:09,432 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7949367088607595 [2025-03-15 01:25:09,432 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, -4 predicate places. [2025-03-15 01:25:09,432 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 258 transitions, 866 flow [2025-03-15 01:25:09,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 4 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:09,433 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:09,433 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] [2025-03-15 01:25:09,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-15 01:25:09,433 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:09,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:09,433 INFO L85 PathProgramCache]: Analyzing trace with hash 133178020, now seen corresponding path program 1 times [2025-03-15 01:25:09,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:09,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306761779] [2025-03-15 01:25:09,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:09,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:09,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:09,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:09,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306761779] [2025-03-15 01:25:09,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306761779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:09,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:09,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:25:09,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410755818] [2025-03-15 01:25:09,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:09,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:09,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:09,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:09,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:09,458 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:09,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 258 transitions, 866 flow. Second operand has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:09,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:09,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:09,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:14,540 INFO L124 PetriNetUnfolderBase]: 5752/43255 cut-off events. [2025-03-15 01:25:14,541 INFO L125 PetriNetUnfolderBase]: For 11862/11862 co-relation queries the response was YES. [2025-03-15 01:25:14,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81846 conditions, 43255 events. 5752/43255 cut-off events. For 11862/11862 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 594530 event pairs, 431 based on Foata normal form. 0/36613 useless extension candidates. Maximal degree in co-relation 40315. Up to 10916 conditions per place. [2025-03-15 01:25:15,114 INFO L140 encePairwiseOnDemand]: 224/237 looper letters, 164 selfloop transitions, 10 changer transitions 39/346 dead transitions. [2025-03-15 01:25:15,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 346 transitions, 1724 flow [2025-03-15 01:25:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:15,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:15,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 798 transitions. [2025-03-15 01:25:15,115 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8417721518987342 [2025-03-15 01:25:15,116 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, -1 predicate places. [2025-03-15 01:25:15,116 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 346 transitions, 1724 flow [2025-03-15 01:25:15,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:15,116 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:15,116 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:15,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-15 01:25:15,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:15,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:15,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1103930171, now seen corresponding path program 1 times [2025-03-15 01:25:15,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:15,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59971931] [2025-03-15 01:25:15,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:15,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:15,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:15,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:15,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:15,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59971931] [2025-03-15 01:25:15,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59971931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:15,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:15,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:15,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842468602] [2025-03-15 01:25:15,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:15,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:15,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:15,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:15,141 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:15,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 346 transitions, 1724 flow. Second operand has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 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 01:25:15,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:15,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:15,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:20,619 INFO L124 PetriNetUnfolderBase]: 5752/43237 cut-off events. [2025-03-15 01:25:20,620 INFO L125 PetriNetUnfolderBase]: For 22630/22630 co-relation queries the response was YES. [2025-03-15 01:25:20,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98063 conditions, 43237 events. 5752/43237 cut-off events. For 22630/22630 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 594423 event pairs, 431 based on Foata normal form. 0/36613 useless extension candidates. Maximal degree in co-relation 48224. Up to 11021 conditions per place. [2025-03-15 01:25:21,066 INFO L140 encePairwiseOnDemand]: 224/237 looper letters, 157 selfloop transitions, 19 changer transitions 39/349 dead transitions. [2025-03-15 01:25:21,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 349 transitions, 2098 flow [2025-03-15 01:25:21,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:25:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:25:21,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 916 transitions. [2025-03-15 01:25:21,068 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7729957805907173 [2025-03-15 01:25:21,068 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 3 predicate places. [2025-03-15 01:25:21,068 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 349 transitions, 2098 flow [2025-03-15 01:25:21,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.5) internal successors, (662), 4 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 01:25:21,069 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:21,069 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] [2025-03-15 01:25:21,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-15 01:25:21,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:21,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:21,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1385325940, now seen corresponding path program 1 times [2025-03-15 01:25:21,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:21,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726051016] [2025-03-15 01:25:21,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:21,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:21,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:21,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726051016] [2025-03-15 01:25:21,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726051016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:21,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:21,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:21,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731416318] [2025-03-15 01:25:21,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:21,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:21,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:21,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:21,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:21,127 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:21,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 349 transitions, 2098 flow. Second operand has 6 states, 6 states have (on average 165.66666666666666) internal successors, (994), 6 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:21,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:21,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:21,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:26,612 INFO L124 PetriNetUnfolderBase]: 5752/43231 cut-off events. [2025-03-15 01:25:26,613 INFO L125 PetriNetUnfolderBase]: For 38902/38902 co-relation queries the response was YES. [2025-03-15 01:25:26,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114154 conditions, 43231 events. 5752/43231 cut-off events. For 38902/38902 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 594283 event pairs, 431 based on Foata normal form. 0/36613 useless extension candidates. Maximal degree in co-relation 56052. Up to 11021 conditions per place. [2025-03-15 01:25:26,958 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 153 selfloop transitions, 22 changer transitions 39/348 dead transitions. [2025-03-15 01:25:26,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 348 transitions, 2460 flow [2025-03-15 01:25:26,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:26,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:26,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1240 transitions. [2025-03-15 01:25:26,959 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474382157926461 [2025-03-15 01:25:26,960 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 8 predicate places. [2025-03-15 01:25:26,960 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 348 transitions, 2460 flow [2025-03-15 01:25:26,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.66666666666666) internal successors, (994), 6 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:26,960 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:26,961 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:25:26,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-15 01:25:26,961 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:26,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:26,961 INFO L85 PathProgramCache]: Analyzing trace with hash -4567937, now seen corresponding path program 1 times [2025-03-15 01:25:26,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:26,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10545314] [2025-03-15 01:25:26,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:26,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:26,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:27,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:27,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10545314] [2025-03-15 01:25:27,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10545314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:27,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:27,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:27,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832455682] [2025-03-15 01:25:27,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:27,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:27,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:27,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:27,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:27,011 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:27,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 348 transitions, 2460 flow. Second operand has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:27,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:27,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:27,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:33,681 INFO L124 PetriNetUnfolderBase]: 5752/43229 cut-off events. [2025-03-15 01:25:33,681 INFO L125 PetriNetUnfolderBase]: For 60622/60622 co-relation queries the response was YES. [2025-03-15 01:25:33,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130249 conditions, 43229 events. 5752/43229 cut-off events. For 60622/60622 co-relation queries the response was YES. Maximal size of possible extension queue 590. Compared 594227 event pairs, 431 based on Foata normal form. 0/36613 useless extension candidates. Maximal degree in co-relation 63884. Up to 11021 conditions per place. [2025-03-15 01:25:34,032 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 164 selfloop transitions, 26 changer transitions 39/363 dead transitions. [2025-03-15 01:25:34,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 363 transitions, 2994 flow [2025-03-15 01:25:34,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:34,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1412 transitions. [2025-03-15 01:25:34,033 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7447257383966245 [2025-03-15 01:25:34,034 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 15 predicate places. [2025-03-15 01:25:34,034 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 363 transitions, 2994 flow [2025-03-15 01:25:34,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.83333333333334) internal successors, (995), 6 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:34,034 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:34,034 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:34,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 01:25:34,034 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:34,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:34,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2025383526, now seen corresponding path program 1 times [2025-03-15 01:25:34,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:34,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987039778] [2025-03-15 01:25:34,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:34,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:34,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987039778] [2025-03-15 01:25:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987039778] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:25:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103614462] [2025-03-15 01:25:34,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:34,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:34,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:34,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:34,063 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:34,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 363 transitions, 2994 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:34,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:34,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:34,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:40,025 INFO L124 PetriNetUnfolderBase]: 5495/41056 cut-off events. [2025-03-15 01:25:40,026 INFO L125 PetriNetUnfolderBase]: For 83769/83769 co-relation queries the response was YES. [2025-03-15 01:25:40,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140847 conditions, 41056 events. 5495/41056 cut-off events. For 83769/83769 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 561016 event pairs, 436 based on Foata normal form. 0/34720 useless extension candidates. Maximal degree in co-relation 68781. Up to 10759 conditions per place. [2025-03-15 01:25:40,409 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 173 selfloop transitions, 11 changer transitions 37/360 dead transitions. [2025-03-15 01:25:40,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 360 transitions, 3332 flow [2025-03-15 01:25:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:25:40,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:25:40,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 794 transitions. [2025-03-15 01:25:40,410 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8375527426160337 [2025-03-15 01:25:40,411 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 18 predicate places. [2025-03-15 01:25:40,411 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 360 transitions, 3332 flow [2025-03-15 01:25:40,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:40,411 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:40,411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:40,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 01:25:40,411 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:40,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:40,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1320055436, now seen corresponding path program 1 times [2025-03-15 01:25:40,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:40,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289555152] [2025-03-15 01:25:40,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:40,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:40,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:40,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:40,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289555152] [2025-03-15 01:25:40,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289555152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:40,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:40,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:40,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836136640] [2025-03-15 01:25:40,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:40,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:40,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:40,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:40,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:40,468 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:40,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 360 transitions, 3332 flow. Second operand has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:40,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:40,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:40,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:46,290 INFO L124 PetriNetUnfolderBase]: 5495/41029 cut-off events. [2025-03-15 01:25:46,290 INFO L125 PetriNetUnfolderBase]: For 114457/114457 co-relation queries the response was YES. [2025-03-15 01:25:46,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156451 conditions, 41029 events. 5495/41029 cut-off events. For 114457/114457 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 560773 event pairs, 436 based on Foata normal form. 0/34720 useless extension candidates. Maximal degree in co-relation 76360. Up to 10732 conditions per place. [2025-03-15 01:25:46,846 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 161 selfloop transitions, 24 changer transitions 37/359 dead transitions. [2025-03-15 01:25:46,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 359 transitions, 3710 flow [2025-03-15 01:25:46,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:25:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:25:46,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1240 transitions. [2025-03-15 01:25:46,848 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7474382157926461 [2025-03-15 01:25:46,848 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 23 predicate places. [2025-03-15 01:25:46,848 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 359 transitions, 3710 flow [2025-03-15 01:25:46,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.0) internal successors, (996), 6 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:46,849 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:46,849 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:46,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-15 01:25:46,849 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:46,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:46,849 INFO L85 PathProgramCache]: Analyzing trace with hash -2027953505, now seen corresponding path program 1 times [2025-03-15 01:25:46,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107713258] [2025-03-15 01:25:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:46,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:46,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:46,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107713258] [2025-03-15 01:25:46,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107713258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:46,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:46,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:25:46,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517833052] [2025-03-15 01:25:46,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:46,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:25:46,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:46,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:25:46,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:25:46,896 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:46,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 359 transitions, 3710 flow. Second operand has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:46,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:46,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:46,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:52,912 INFO L124 PetriNetUnfolderBase]: 5495/41020 cut-off events. [2025-03-15 01:25:52,913 INFO L125 PetriNetUnfolderBase]: For 150268/150268 co-relation queries the response was YES. [2025-03-15 01:25:53,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172073 conditions, 41020 events. 5495/41020 cut-off events. For 150268/150268 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 560609 event pairs, 436 based on Foata normal form. 0/34720 useless extension candidates. Maximal degree in co-relation 83939. Up to 10723 conditions per place. [2025-03-15 01:25:53,279 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 172 selfloop transitions, 28 changer transitions 37/374 dead transitions. [2025-03-15 01:25:53,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 374 transitions, 4332 flow [2025-03-15 01:25:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:25:53,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:25:53,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1412 transitions. [2025-03-15 01:25:53,281 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7447257383966245 [2025-03-15 01:25:53,281 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 30 predicate places. [2025-03-15 01:25:53,281 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 374 transitions, 4332 flow [2025-03-15 01:25:53,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 166.16666666666666) internal successors, (997), 6 states have internal predecessors, (997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:53,282 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:53,282 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:53,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-15 01:25:53,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:53,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:53,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1130068442, now seen corresponding path program 1 times [2025-03-15 01:25:53,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:53,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844371323] [2025-03-15 01:25:53,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:53,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:53,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:53,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:53,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844371323] [2025-03-15 01:25:53,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844371323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:53,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:53,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-15 01:25:53,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75255460] [2025-03-15 01:25:53,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:53,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:25:53,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:53,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:25:53,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:25:53,499 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 237 [2025-03-15 01:25:53,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 374 transitions, 4332 flow. Second operand has 8 states, 8 states have (on average 161.5) internal successors, (1292), 8 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:53,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:53,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 237 [2025-03-15 01:25:53,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:25:57,438 INFO L124 PetriNetUnfolderBase]: 3365/26562 cut-off events. [2025-03-15 01:25:57,438 INFO L125 PetriNetUnfolderBase]: For 124101/124101 co-relation queries the response was YES. [2025-03-15 01:25:57,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119083 conditions, 26562 events. 3365/26562 cut-off events. For 124101/124101 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 332188 event pairs, 298 based on Foata normal form. 0/22476 useless extension candidates. Maximal degree in co-relation 66788. Up to 8198 conditions per place. [2025-03-15 01:25:57,669 INFO L140 encePairwiseOnDemand]: 222/237 looper letters, 179 selfloop transitions, 19 changer transitions 37/366 dead transitions. [2025-03-15 01:25:57,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 366 transitions, 4500 flow [2025-03-15 01:25:57,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:25:57,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:25:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1722 transitions. [2025-03-15 01:25:57,671 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7265822784810126 [2025-03-15 01:25:57,671 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 39 predicate places. [2025-03-15 01:25:57,671 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 366 transitions, 4500 flow [2025-03-15 01:25:57,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 161.5) internal successors, (1292), 8 states have internal predecessors, (1292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:57,672 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:25:57,672 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:25:57,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-15 01:25:57,672 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:25:57,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:25:57,672 INFO L85 PathProgramCache]: Analyzing trace with hash -202043587, now seen corresponding path program 1 times [2025-03-15 01:25:57,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:25:57,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775388748] [2025-03-15 01:25:57,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:25:57,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:25:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:25:57,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:25:57,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:25:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775388748] [2025-03-15 01:25:57,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775388748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:25:57,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:25:57,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:25:57,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794675127] [2025-03-15 01:25:57,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:25:57,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:25:57,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:25:57,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:25:57,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:25:57,872 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:25:57,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 366 transitions, 4500 flow. Second operand has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:25:57,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:25:57,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:25:57,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:02,218 INFO L124 PetriNetUnfolderBase]: 3365/26435 cut-off events. [2025-03-15 01:26:02,218 INFO L125 PetriNetUnfolderBase]: For 147706/147706 co-relation queries the response was YES. [2025-03-15 01:26:02,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130624 conditions, 26435 events. 3365/26435 cut-off events. For 147706/147706 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 330177 event pairs, 298 based on Foata normal form. 0/22575 useless extension candidates. Maximal degree in co-relation 73207. Up to 8198 conditions per place. [2025-03-15 01:26:02,442 INFO L140 encePairwiseOnDemand]: 224/237 looper letters, 161 selfloop transitions, 23 changer transitions 37/369 dead transitions. [2025-03-15 01:26:02,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 369 transitions, 4886 flow [2025-03-15 01:26:02,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:02,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:02,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 916 transitions. [2025-03-15 01:26:02,443 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7729957805907173 [2025-03-15 01:26:02,443 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 43 predicate places. [2025-03-15 01:26:02,443 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 369 transitions, 4886 flow [2025-03-15 01:26:02,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.25) internal successors, (669), 4 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:02,444 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:02,444 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:02,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-15 01:26:02,444 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:02,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:02,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1729715764, now seen corresponding path program 1 times [2025-03-15 01:26:02,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:02,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51785954] [2025-03-15 01:26:02,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:02,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:02,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:02,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:02,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:02,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51785954] [2025-03-15 01:26:02,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51785954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:02,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:02,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:02,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618309407] [2025-03-15 01:26:02,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:02,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:02,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:02,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:02,477 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:26:02,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 369 transitions, 4886 flow. Second operand has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:02,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:02,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:26:02,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:06,970 INFO L124 PetriNetUnfolderBase]: 3365/26100 cut-off events. [2025-03-15 01:26:06,970 INFO L125 PetriNetUnfolderBase]: For 171443/171443 co-relation queries the response was YES. [2025-03-15 01:26:07,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142479 conditions, 26100 events. 3365/26100 cut-off events. For 171443/171443 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 324590 event pairs, 298 based on Foata normal form. 0/22864 useless extension candidates. Maximal degree in co-relation 79736. Up to 8198 conditions per place. [2025-03-15 01:26:07,222 INFO L140 encePairwiseOnDemand]: 224/237 looper letters, 161 selfloop transitions, 23 changer transitions 37/372 dead transitions. [2025-03-15 01:26:07,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 372 transitions, 5272 flow [2025-03-15 01:26:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:07,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:07,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 916 transitions. [2025-03-15 01:26:07,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7729957805907173 [2025-03-15 01:26:07,224 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 47 predicate places. [2025-03-15 01:26:07,224 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 372 transitions, 5272 flow [2025-03-15 01:26:07,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:07,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:07,224 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 01:26:07,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-15 01:26:07,224 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:07,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:07,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1325028067, now seen corresponding path program 1 times [2025-03-15 01:26:07,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:07,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380206335] [2025-03-15 01:26:07,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:07,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:07,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:07,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380206335] [2025-03-15 01:26:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380206335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:07,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:07,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:26:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803979300] [2025-03-15 01:26:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:07,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:26:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:07,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:26:07,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:07,277 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:26:07,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 372 transitions, 5272 flow. Second operand has 8 states, 8 states have (on average 166.125) internal successors, (1329), 8 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:07,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:07,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:26:07,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:11,962 INFO L124 PetriNetUnfolderBase]: 3365/26099 cut-off events. [2025-03-15 01:26:11,962 INFO L125 PetriNetUnfolderBase]: For 206695/206695 co-relation queries the response was YES. [2025-03-15 01:26:12,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152302 conditions, 26099 events. 3365/26099 cut-off events. For 206695/206695 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 324665 event pairs, 298 based on Foata normal form. 0/22864 useless extension candidates. Maximal degree in co-relation 85231. Up to 8197 conditions per place. [2025-03-15 01:26:12,195 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 167 selfloop transitions, 34 changer transitions 37/381 dead transitions. [2025-03-15 01:26:12,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 5860 flow [2025-03-15 01:26:12,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:12,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:12,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1910 transitions. [2025-03-15 01:26:12,197 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7326428845416187 [2025-03-15 01:26:12,197 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 57 predicate places. [2025-03-15 01:26:12,198 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 381 transitions, 5860 flow [2025-03-15 01:26:12,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 166.125) internal successors, (1329), 8 states have internal predecessors, (1329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:12,198 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:12,198 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-15 01:26:12,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-15 01:26:12,198 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:12,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1248947187, now seen corresponding path program 1 times [2025-03-15 01:26:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485811977] [2025-03-15 01:26:12,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:12,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:12,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:12,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485811977] [2025-03-15 01:26:12,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485811977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:12,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:12,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 01:26:12,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393942258] [2025-03-15 01:26:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:12,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 01:26:12,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:12,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 01:26:12,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-15 01:26:12,255 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:26:12,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 381 transitions, 5860 flow. Second operand has 8 states, 8 states have (on average 166.375) internal successors, (1331), 8 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:12,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:12,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:26:12,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:16,928 INFO L124 PetriNetUnfolderBase]: 3365/26092 cut-off events. [2025-03-15 01:26:16,929 INFO L125 PetriNetUnfolderBase]: For 244897/244897 co-relation queries the response was YES. [2025-03-15 01:26:17,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162174 conditions, 26092 events. 3365/26092 cut-off events. For 244897/244897 co-relation queries the response was YES. Maximal size of possible extension queue 327. Compared 324480 event pairs, 298 based on Foata normal form. 0/22864 useless extension candidates. Maximal degree in co-relation 90770. Up to 8197 conditions per place. [2025-03-15 01:26:17,157 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 171 selfloop transitions, 36 changer transitions 37/396 dead transitions. [2025-03-15 01:26:17,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 396 transitions, 6622 flow [2025-03-15 01:26:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:26:17,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:26:17,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1910 transitions. [2025-03-15 01:26:17,158 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7326428845416187 [2025-03-15 01:26:17,159 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 67 predicate places. [2025-03-15 01:26:17,159 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 396 transitions, 6622 flow [2025-03-15 01:26:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 166.375) internal successors, (1331), 8 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:17,159 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:17,159 INFO L221 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:17,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-03-15 01:26:17,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:17,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:17,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1202324327, now seen corresponding path program 1 times [2025-03-15 01:26:17,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:17,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136167854] [2025-03-15 01:26:17,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:17,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:17,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:17,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:17,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:17,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136167854] [2025-03-15 01:26:17,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136167854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:17,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:17,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:26:17,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983414867] [2025-03-15 01:26:17,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:17,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:26:17,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:17,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:26:17,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:26:17,241 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 237 [2025-03-15 01:26:17,242 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 396 transitions, 6622 flow. Second operand has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:17,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:17,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 237 [2025-03-15 01:26:17,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:22,380 INFO L124 PetriNetUnfolderBase]: 3351/25802 cut-off events. [2025-03-15 01:26:22,380 INFO L125 PetriNetUnfolderBase]: For 283775/283775 co-relation queries the response was YES. [2025-03-15 01:26:22,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170543 conditions, 25802 events. 3351/25802 cut-off events. For 283775/283775 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 321686 event pairs, 315 based on Foata normal form. 0/22599 useless extension candidates. Maximal degree in co-relation 94811. Up to 8197 conditions per place. [2025-03-15 01:26:22,635 INFO L140 encePairwiseOnDemand]: 223/237 looper letters, 200 selfloop transitions, 17 changer transitions 37/394 dead transitions. [2025-03-15 01:26:22,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 394 transitions, 7016 flow [2025-03-15 01:26:22,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:26:22,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:26:22,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1247 transitions. [2025-03-15 01:26:22,637 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7516576250753466 [2025-03-15 01:26:22,638 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 73 predicate places. [2025-03-15 01:26:22,638 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 394 transitions, 7016 flow [2025-03-15 01:26:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 162.83333333333334) internal successors, (977), 6 states have internal predecessors, (977), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:22,638 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:22,638 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:22,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-03-15 01:26:22,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:22,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:22,639 INFO L85 PathProgramCache]: Analyzing trace with hash -2001752547, now seen corresponding path program 1 times [2025-03-15 01:26:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051250705] [2025-03-15 01:26:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:22,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:22,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051250705] [2025-03-15 01:26:22,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051250705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:22,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:22,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:26:22,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354192326] [2025-03-15 01:26:22,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:22,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:22,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:22,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:22,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:22,727 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:26:22,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 394 transitions, 7016 flow. Second operand has 10 states, 10 states have (on average 166.3) internal successors, (1663), 10 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:22,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:22,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:26:22,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:28,084 INFO L124 PetriNetUnfolderBase]: 3351/25801 cut-off events. [2025-03-15 01:26:28,084 INFO L125 PetriNetUnfolderBase]: For 328578/328578 co-relation queries the response was YES. [2025-03-15 01:26:28,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180287 conditions, 25801 events. 3351/25801 cut-off events. For 328578/328578 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 321897 event pairs, 315 based on Foata normal form. 0/22599 useless extension candidates. Maximal degree in co-relation 100235. Up to 8196 conditions per place. [2025-03-15 01:26:28,361 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 175 selfloop transitions, 39 changer transitions 37/397 dead transitions. [2025-03-15 01:26:28,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 397 transitions, 7562 flow [2025-03-15 01:26:28,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:26:28,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:26:28,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2402 transitions. [2025-03-15 01:26:28,363 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7239300783604581 [2025-03-15 01:26:28,363 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 85 predicate places. [2025-03-15 01:26:28,363 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 397 transitions, 7562 flow [2025-03-15 01:26:28,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.3) internal successors, (1663), 10 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:28,363 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:28,363 INFO L221 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:28,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-03-15 01:26:28,364 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:28,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:28,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1004774950, now seen corresponding path program 1 times [2025-03-15 01:26:28,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:28,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176208489] [2025-03-15 01:26:28,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:28,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:28,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:26:28,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:28,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176208489] [2025-03-15 01:26:28,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176208489] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:28,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:28,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-15 01:26:28,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449957702] [2025-03-15 01:26:28,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:28,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 01:26:28,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:28,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 01:26:28,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-15 01:26:28,443 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 237 [2025-03-15 01:26:28,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 397 transitions, 7562 flow. Second operand has 10 states, 10 states have (on average 166.5) internal successors, (1665), 10 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:28,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:28,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 237 [2025-03-15 01:26:28,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:33,704 INFO L124 PetriNetUnfolderBase]: 3351/25795 cut-off events. [2025-03-15 01:26:33,705 INFO L125 PetriNetUnfolderBase]: For 376280/376280 co-relation queries the response was YES. [2025-03-15 01:26:33,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190062 conditions, 25795 events. 3351/25795 cut-off events. For 376280/376280 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 321668 event pairs, 315 based on Foata normal form. 0/22599 useless extension candidates. Maximal degree in co-relation 105679. Up to 8196 conditions per place. [2025-03-15 01:26:33,967 INFO L140 encePairwiseOnDemand]: 225/237 looper letters, 173 selfloop transitions, 43 changer transitions 37/404 dead transitions. [2025-03-15 01:26:33,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 404 transitions, 8252 flow [2025-03-15 01:26:33,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 01:26:33,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 01:26:33,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2402 transitions. [2025-03-15 01:26:33,969 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7239300783604581 [2025-03-15 01:26:33,969 INFO L298 CegarLoopForPetriNet]: 223 programPoint places, 97 predicate places. [2025-03-15 01:26:33,969 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 404 transitions, 8252 flow [2025-03-15 01:26:33,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 166.5) internal successors, (1665), 10 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:33,970 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:33,970 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:33,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-15 01:26:33,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:33,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:33,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1467047515, now seen corresponding path program 1 times [2025-03-15 01:26:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226023550] [2025-03-15 01:26:33,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:26:33,983 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-15 01:26:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-15 01:26:33,999 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-15 01:26:33,999 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-15 01:26:33,999 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 10 remaining) [2025-03-15 01:26:34,000 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 10 remaining) [2025-03-15 01:26:34,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-15 01:26:34,000 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:34,001 WARN L336 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-15 01:26:34,001 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-03-15 01:26:34,021 INFO L143 ThreadInstanceAdder]: Constructed 20 joinOtherThreadTransitions. [2025-03-15 01:26:34,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:26:34,023 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;@423b5d52, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:26:34,023 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-03-15 01:26:34,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:26:34,025 INFO L124 PetriNetUnfolderBase]: 4/88 cut-off events. [2025-03-15 01:26:34,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:26:34,025 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:34,025 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:26:34,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:34,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:34,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1847835012, now seen corresponding path program 1 times [2025-03-15 01:26:34,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:34,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612546694] [2025-03-15 01:26:34,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:34,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:34,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 01:26:34,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:34,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612546694] [2025-03-15 01:26:34,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612546694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:34,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:34,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:26:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476233018] [2025-03-15 01:26:34,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:34,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:34,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:34,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:34,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:34,048 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2025-03-15 01:26:34,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 263 transitions, 666 flow. Second operand has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:34,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:34,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2025-03-15 01:26:34,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:26:45,002 INFO L124 PetriNetUnfolderBase]: 14533/87216 cut-off events. [2025-03-15 01:26:45,002 INFO L125 PetriNetUnfolderBase]: For 15730/15730 co-relation queries the response was YES. [2025-03-15 01:26:45,704 INFO L83 FinitePrefix]: Finished finitePrefix Result has 137539 conditions, 87216 events. 14533/87216 cut-off events. For 15730/15730 co-relation queries the response was YES. Maximal size of possible extension queue 973. Compared 1263054 event pairs, 2560 based on Foata normal form. 103397/177717 useless extension candidates. Maximal degree in co-relation 67628. Up to 23854 conditions per place. [2025-03-15 01:26:45,940 INFO L140 encePairwiseOnDemand]: 234/263 looper letters, 95 selfloop transitions, 10 changer transitions 34/284 dead transitions. [2025-03-15 01:26:45,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 284 transitions, 986 flow [2025-03-15 01:26:45,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:26:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:26:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1041 transitions. [2025-03-15 01:26:45,942 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7916349809885932 [2025-03-15 01:26:45,942 INFO L298 CegarLoopForPetriNet]: 247 programPoint places, -6 predicate places. [2025-03-15 01:26:45,942 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 284 transitions, 986 flow [2025-03-15 01:26:45,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.0) internal successors, (728), 4 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:45,942 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:26:45,942 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] [2025-03-15 01:26:45,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-03-15 01:26:45,942 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:26:45,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:26:45,943 INFO L85 PathProgramCache]: Analyzing trace with hash 711190937, now seen corresponding path program 1 times [2025-03-15 01:26:45,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:26:45,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714567488] [2025-03-15 01:26:45,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:26:45,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:26:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:26:45,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 01:26:45,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:26:45,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714567488] [2025-03-15 01:26:45,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714567488] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:26:45,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:26:45,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:26:45,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942374563] [2025-03-15 01:26:45,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:26:45,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:26:45,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:26:45,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:26:45,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:26:45,965 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2025-03-15 01:26:45,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 284 transitions, 986 flow. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:26:45,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:26:45,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2025-03-15 01:26:45,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:09,053 INFO L124 PetriNetUnfolderBase]: 28914/173055 cut-off events. [2025-03-15 01:27:09,053 INFO L125 PetriNetUnfolderBase]: For 52423/52423 co-relation queries the response was YES. [2025-03-15 01:27:10,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341987 conditions, 173055 events. 28914/173055 cut-off events. For 52423/52423 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 2798504 event pairs, 3856 based on Foata normal form. 0/147534 useless extension candidates. Maximal degree in co-relation 166928. Up to 47436 conditions per place. [2025-03-15 01:27:11,216 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 184 selfloop transitions, 10 changer transitions 39/382 dead transitions. [2025-03-15 01:27:11,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 382 transitions, 1970 flow [2025-03-15 01:27:11,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:27:11,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:27:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 882 transitions. [2025-03-15 01:27:11,217 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8384030418250951 [2025-03-15 01:27:11,218 INFO L298 CegarLoopForPetriNet]: 247 programPoint places, -3 predicate places. [2025-03-15 01:27:11,218 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 382 transitions, 1970 flow [2025-03-15 01:27:11,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:11,218 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:11,218 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:27:11,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-03-15 01:27:11,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:27:11,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:11,218 INFO L85 PathProgramCache]: Analyzing trace with hash -861535531, now seen corresponding path program 1 times [2025-03-15 01:27:11,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:11,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316749054] [2025-03-15 01:27:11,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:11,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 01:27:11,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:11,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316749054] [2025-03-15 01:27:11,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316749054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:11,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:11,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:27:11,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267356049] [2025-03-15 01:27:11,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:11,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:27:11,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:11,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:27:11,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:27:11,239 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2025-03-15 01:27:11,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 382 transitions, 1970 flow. Second operand has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:11,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:11,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2025-03-15 01:27:11,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:27:36,400 INFO L124 PetriNetUnfolderBase]: 28914/173033 cut-off events. [2025-03-15 01:27:36,400 INFO L125 PetriNetUnfolderBase]: For 94439/94439 co-relation queries the response was YES. [2025-03-15 01:27:37,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411059 conditions, 173033 events. 28914/173033 cut-off events. For 94439/94439 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 2797341 event pairs, 3856 based on Foata normal form. 0/147534 useless extension candidates. Maximal degree in co-relation 200323. Up to 47616 conditions per place. [2025-03-15 01:27:38,675 INFO L140 encePairwiseOnDemand]: 250/263 looper letters, 177 selfloop transitions, 19 changer transitions 39/385 dead transitions. [2025-03-15 01:27:38,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 248 places, 385 transitions, 2384 flow [2025-03-15 01:27:38,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:27:38,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:27:38,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1011 transitions. [2025-03-15 01:27:38,677 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7688212927756654 [2025-03-15 01:27:38,677 INFO L298 CegarLoopForPetriNet]: 247 programPoint places, 1 predicate places. [2025-03-15 01:27:38,677 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 385 transitions, 2384 flow [2025-03-15 01:27:38,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.5) internal successors, (730), 4 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:38,677 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:27:38,677 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] [2025-03-15 01:27:38,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-03-15 01:27:38,678 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:27:38,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:27:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1151591684, now seen corresponding path program 1 times [2025-03-15 01:27:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:27:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793185550] [2025-03-15 01:27:38,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:27:38,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:27:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:27:38,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:27:38,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:27:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793185550] [2025-03-15 01:27:38,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793185550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:27:38,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:27:38,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:27:38,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892940187] [2025-03-15 01:27:38,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:27:38,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:27:38,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:27:38,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:27:38,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:27:38,718 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2025-03-15 01:27:38,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 385 transitions, 2384 flow. Second operand has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:27:38,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:27:38,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2025-03-15 01:27:38,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:28:04,335 INFO L124 PetriNetUnfolderBase]: 28914/173025 cut-off events. [2025-03-15 01:28:04,335 INFO L125 PetriNetUnfolderBase]: For 157653/157653 co-relation queries the response was YES. [2025-03-15 01:28:05,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479922 conditions, 173025 events. 28914/173025 cut-off events. For 157653/157653 co-relation queries the response was YES. Maximal size of possible extension queue 1885. Compared 2797615 event pairs, 3856 based on Foata normal form. 0/147534 useless extension candidates. Maximal degree in co-relation 233564. Up to 47616 conditions per place. [2025-03-15 01:28:06,730 INFO L140 encePairwiseOnDemand]: 251/263 looper letters, 173 selfloop transitions, 22 changer transitions 39/384 dead transitions. [2025-03-15 01:28:06,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 384 transitions, 2786 flow [2025-03-15 01:28:06,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:28:06,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:28:06,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1369 transitions. [2025-03-15 01:28:06,732 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7436175991309071 [2025-03-15 01:28:06,732 INFO L298 CegarLoopForPetriNet]: 247 programPoint places, 6 predicate places. [2025-03-15 01:28:06,732 INFO L471 AbstractCegarLoop]: Abstraction has has 253 places, 384 transitions, 2786 flow [2025-03-15 01:28:06,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:28:06,732 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:28:06,732 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 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] [2025-03-15 01:28:06,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-03-15 01:28:06,733 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2025-03-15 01:28:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:28:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1339602692, now seen corresponding path program 1 times [2025-03-15 01:28:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:28:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843232856] [2025-03-15 01:28:06,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:28:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:28:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:28:06,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:28:06,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:28:06,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843232856] [2025-03-15 01:28:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843232856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:28:06,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:28:06,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:28:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713049727] [2025-03-15 01:28:06,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:28:06,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:28:06,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:28:06,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:28:06,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:28:06,768 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 263 [2025-03-15 01:28:06,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 384 transitions, 2786 flow. Second operand has 6 states, 6 states have (on average 182.83333333333334) internal successors, (1097), 6 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:28:06,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:28:06,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 263 [2025-03-15 01:28:06,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand