/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/weaver/chl-name-comparator-symm.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:27:35,561 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:27:35,611 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 02:27:35,653 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:27:35,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:27:35,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:27:35,655 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:27:35,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:27:35,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:27:35,656 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:27:35,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:27:35,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:27:35,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:27:35,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:27:35,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:27:35,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:27:35,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:27:35,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 02:27:35,907 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:27:35,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:27:35,915 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:27:35,916 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:27:35,916 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:27:35,917 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-03-15 02:27:37,156 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0341e1d/d69b092070084d26880aefd524383e40/FLAGccfa67eae [2025-03-15 02:27:37,356 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:27:37,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-name-comparator-symm.wvr.c [2025-03-15 02:27:37,362 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0341e1d/d69b092070084d26880aefd524383e40/FLAGccfa67eae [2025-03-15 02:27:37,378 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e0341e1d/d69b092070084d26880aefd524383e40 [2025-03-15 02:27:37,380 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:27:37,383 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:27:37,385 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:27:37,385 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:27:37,388 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:27:37,389 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,389 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f5544b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37, skipping insertion in model container [2025-03-15 02:27:37,390 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,406 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:27:37,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:27:37,569 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:27:37,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:27:37,611 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:27:37,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37 WrapperNode [2025-03-15 02:27:37,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:27:37,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:27:37,612 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:27:37,612 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:27:37,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,643 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 252 [2025-03-15 02:27:37,643 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:27:37,644 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:27:37,644 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:27:37,644 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:27:37,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,649 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,660 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,665 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:27:37,669 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:27:37,669 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:27:37,669 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:27:37,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (1/1) ... [2025-03-15 02:27:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:27:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:37,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 02:27:37,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 02:27:37,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:27:37,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:27:37,720 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:27:37,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:27:37,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:27:37,721 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 02:27:37,811 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:27:37,813 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:27:38,171 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:27:38,172 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:27:38,189 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:27:38,189 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-15 02:27:38,189 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:27:38 BoogieIcfgContainer [2025-03-15 02:27:38,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:27:38,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:27:38,192 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:27:38,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:27:38,195 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:27:37" (1/3) ... [2025-03-15 02:27:38,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc4595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:27:38, skipping insertion in model container [2025-03-15 02:27:38,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:27:37" (2/3) ... [2025-03-15 02:27:38,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70fc4595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:27:38, skipping insertion in model container [2025-03-15 02:27:38,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:27:38" (3/3) ... [2025-03-15 02:27:38,197 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2025-03-15 02:27:38,208 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:27:38,210 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-symm.wvr.c that has 3 procedures, 319 locations, 1 initial locations, 3 loop locations, and 20 error locations. [2025-03-15 02:27:38,210 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:27:38,325 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:27:38,367 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:27:38,379 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;@6d0d26cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:27:38,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-15 02:27:38,419 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:27:38,420 INFO L124 PetriNetUnfolderBase]: 2/98 cut-off events. [2025-03-15 02:27:38,424 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:27:38,425 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:38,425 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:38,426 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:38,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:38,430 INFO L85 PathProgramCache]: Analyzing trace with hash 543940500, now seen corresponding path program 1 times [2025-03-15 02:27:38,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:38,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568104449] [2025-03-15 02:27:38,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:38,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:38,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:38,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:38,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568104449] [2025-03-15 02:27:38,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568104449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:38,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:38,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:38,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350739940] [2025-03-15 02:27:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:38,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:38,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:38,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:38,775 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 340 [2025-03-15 02:27:38,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 340 transitions, 694 flow. Second operand has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:38,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:38,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 340 [2025-03-15 02:27:38,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:38,933 INFO L124 PetriNetUnfolderBase]: 10/328 cut-off events. [2025-03-15 02:27:38,934 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-15 02:27:38,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 328 events. 10/328 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 731 event pairs, 0 based on Foata normal form. 20/309 useless extension candidates. Maximal degree in co-relation 245. Up to 20 conditions per place. [2025-03-15 02:27:38,945 INFO L140 encePairwiseOnDemand]: 317/340 looper letters, 21 selfloop transitions, 5 changer transitions 13/325 dead transitions. [2025-03-15 02:27:38,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 325 transitions, 716 flow [2025-03-15 02:27:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:27:38,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:27:38,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1575 transitions. [2025-03-15 02:27:38,962 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9264705882352942 [2025-03-15 02:27:38,964 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, -7 predicate places. [2025-03-15 02:27:38,964 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 325 transitions, 716 flow [2025-03-15 02:27:38,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 307.5) internal successors, (1230), 4 states have internal predecessors, (1230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:38,965 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:38,965 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:38,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:27:38,966 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:38,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:38,967 INFO L85 PathProgramCache]: Analyzing trace with hash -945204732, now seen corresponding path program 1 times [2025-03-15 02:27:38,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:38,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745718583] [2025-03-15 02:27:38,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:38,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:39,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745718583] [2025-03-15 02:27:39,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745718583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857065109] [2025-03-15 02:27:39,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:39,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:39,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:39,155 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:39,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 02:27:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:39,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:27:39,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:27:39,333 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:39,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:27:39,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857065109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:39,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:27:39,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:27:39,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405864476] [2025-03-15 02:27:39,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:39,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:39,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:39,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:39,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:27:39,339 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 340 [2025-03-15 02:27:39,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 325 transitions, 716 flow. Second operand has 6 states, 6 states have (on average 308.1666666666667) internal successors, (1849), 6 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:39,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:39,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 340 [2025-03-15 02:27:39,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:39,465 INFO L124 PetriNetUnfolderBase]: 10/327 cut-off events. [2025-03-15 02:27:39,466 INFO L125 PetriNetUnfolderBase]: For 23/26 co-relation queries the response was YES. [2025-03-15 02:27:39,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 327 events. 10/327 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 725 event pairs, 0 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 266. Up to 19 conditions per place. [2025-03-15 02:27:39,470 INFO L140 encePairwiseOnDemand]: 334/340 looper letters, 17 selfloop transitions, 8 changer transitions 13/324 dead transitions. [2025-03-15 02:27:39,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 324 transitions, 764 flow [2025-03-15 02:27:39,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:27:39,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:27:39,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2169 transitions. [2025-03-15 02:27:39,475 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.911344537815126 [2025-03-15 02:27:39,476 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, -2 predicate places. [2025-03-15 02:27:39,476 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 324 transitions, 764 flow [2025-03-15 02:27:39,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.1666666666667) internal successors, (1849), 6 states have internal predecessors, (1849), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:39,478 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:39,478 INFO L221 CegarLoopForPetriNet]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:39,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-15 02:27:39,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:39,682 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:39,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash 763425153, now seen corresponding path program 1 times [2025-03-15 02:27:39,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:39,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350393169] [2025-03-15 02:27:39,683 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:39,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:39,829 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:39,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350393169] [2025-03-15 02:27:39,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350393169] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:39,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490107014] [2025-03-15 02:27:39,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:39,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:39,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:39,832 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:39,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 02:27:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:39,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:27:39,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:27:39,944 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:39,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:27:39,998 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:39,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490107014] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:27:39,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:27:39,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:27:39,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476389112] [2025-03-15 02:27:39,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:27:39,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:27:39,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:40,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:27:40,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:27:40,005 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 340 [2025-03-15 02:27:40,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 324 transitions, 764 flow. Second operand has 12 states, 12 states have (on average 308.8333333333333) internal successors, (3706), 12 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:40,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:40,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 340 [2025-03-15 02:27:40,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:40,165 INFO L124 PetriNetUnfolderBase]: 13/362 cut-off events. [2025-03-15 02:27:40,165 INFO L125 PetriNetUnfolderBase]: For 68/73 co-relation queries the response was YES. [2025-03-15 02:27:40,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 530 conditions, 362 events. 13/362 cut-off events. For 68/73 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 962 event pairs, 0 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 402. Up to 45 conditions per place. [2025-03-15 02:27:40,168 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 33 selfloop transitions, 18 changer transitions 13/350 dead transitions. [2025-03-15 02:27:40,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 350 transitions, 1024 flow [2025-03-15 02:27:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:27:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:27:40,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4339 transitions. [2025-03-15 02:27:40,185 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9115546218487395 [2025-03-15 02:27:40,186 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 11 predicate places. [2025-03-15 02:27:40,186 INFO L471 AbstractCegarLoop]: Abstraction has has 336 places, 350 transitions, 1024 flow [2025-03-15 02:27:40,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 308.8333333333333) internal successors, (3706), 12 states have internal predecessors, (3706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:40,188 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:40,188 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:40,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 02:27:40,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-15 02:27:40,389 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:40,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:40,389 INFO L85 PathProgramCache]: Analyzing trace with hash -115709954, now seen corresponding path program 1 times [2025-03-15 02:27:40,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:40,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627482361] [2025-03-15 02:27:40,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:40,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:40,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:40,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:40,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:40,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627482361] [2025-03-15 02:27:40,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627482361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:40,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:40,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:40,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641702571] [2025-03-15 02:27:40,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:40,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:40,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:40,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:40,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:40,496 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:27:40,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 350 transitions, 1024 flow. Second operand has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:40,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:40,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:27:40,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:40,652 INFO L124 PetriNetUnfolderBase]: 54/961 cut-off events. [2025-03-15 02:27:40,652 INFO L125 PetriNetUnfolderBase]: For 301/315 co-relation queries the response was YES. [2025-03-15 02:27:40,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 961 events. 54/961 cut-off events. For 301/315 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5596 event pairs, 3 based on Foata normal form. 0/822 useless extension candidates. Maximal degree in co-relation 935. Up to 65 conditions per place. [2025-03-15 02:27:40,658 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 22 selfloop transitions, 6 changer transitions 14/363 dead transitions. [2025-03-15 02:27:40,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 363 transitions, 1155 flow [2025-03-15 02:27:40,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:27:40,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:27:40,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1567 transitions. [2025-03-15 02:27:40,661 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9217647058823529 [2025-03-15 02:27:40,661 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 15 predicate places. [2025-03-15 02:27:40,661 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 363 transitions, 1155 flow [2025-03-15 02:27:40,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.0) internal successors, (1236), 4 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:40,662 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:40,662 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:40,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:27:40,662 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:40,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:40,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1114218605, now seen corresponding path program 1 times [2025-03-15 02:27:40,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:40,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95924114] [2025-03-15 02:27:40,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:40,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:40,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:40,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95924114] [2025-03-15 02:27:40,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95924114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:40,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:40,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880740963] [2025-03-15 02:27:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:40,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:40,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:40,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:40,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:40,735 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:40,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 363 transitions, 1155 flow. Second operand has 4 states, 4 states have (on average 297.5) internal successors, (1190), 4 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:40,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:40,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:40,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:40,991 INFO L124 PetriNetUnfolderBase]: 131/1373 cut-off events. [2025-03-15 02:27:40,991 INFO L125 PetriNetUnfolderBase]: For 1379/1397 co-relation queries the response was YES. [2025-03-15 02:27:40,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2305 conditions, 1373 events. 131/1373 cut-off events. For 1379/1397 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9786 event pairs, 16 based on Foata normal form. 0/1175 useless extension candidates. Maximal degree in co-relation 1935. Up to 128 conditions per place. [2025-03-15 02:27:41,001 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 40 selfloop transitions, 5 changer transitions 14/377 dead transitions. [2025-03-15 02:27:41,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 377 transitions, 1321 flow [2025-03-15 02:27:41,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:41,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:41,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1227 transitions. [2025-03-15 02:27:41,005 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9022058823529412 [2025-03-15 02:27:41,005 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 17 predicate places. [2025-03-15 02:27:41,006 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 377 transitions, 1321 flow [2025-03-15 02:27:41,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 297.5) internal successors, (1190), 4 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:41,006 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:41,006 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:41,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:27:41,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:41,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:41,007 INFO L85 PathProgramCache]: Analyzing trace with hash -181037530, now seen corresponding path program 1 times [2025-03-15 02:27:41,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:41,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120502398] [2025-03-15 02:27:41,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:41,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:41,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:41,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120502398] [2025-03-15 02:27:41,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120502398] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:41,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:41,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:27:41,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117149642] [2025-03-15 02:27:41,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:41,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:27:41,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:41,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:27:41,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:27:41,107 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 340 [2025-03-15 02:27:41,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 377 transitions, 1321 flow. Second operand has 5 states, 5 states have (on average 307.4) internal successors, (1537), 5 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:41,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:41,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 340 [2025-03-15 02:27:41,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:41,259 INFO L124 PetriNetUnfolderBase]: 106/827 cut-off events. [2025-03-15 02:27:41,262 INFO L125 PetriNetUnfolderBase]: For 1858/1858 co-relation queries the response was YES. [2025-03-15 02:27:41,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1871 conditions, 827 events. 106/827 cut-off events. For 1858/1858 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4417 event pairs, 23 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1473. Up to 126 conditions per place. [2025-03-15 02:27:41,269 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 42 selfloop transitions, 6 changer transitions 14/375 dead transitions. [2025-03-15 02:27:41,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 375 transitions, 1405 flow [2025-03-15 02:27:41,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:27:41,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:27:41,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1549 transitions. [2025-03-15 02:27:41,275 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9111764705882353 [2025-03-15 02:27:41,276 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 21 predicate places. [2025-03-15 02:27:41,276 INFO L471 AbstractCegarLoop]: Abstraction has has 346 places, 375 transitions, 1405 flow [2025-03-15 02:27:41,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 307.4) internal successors, (1537), 5 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:41,277 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:41,277 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:41,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:27:41,278 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:41,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:41,278 INFO L85 PathProgramCache]: Analyzing trace with hash -491314026, now seen corresponding path program 1 times [2025-03-15 02:27:41,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:41,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628185441] [2025-03-15 02:27:41,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:41,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:41,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:41,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:41,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:41,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628185441] [2025-03-15 02:27:41,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628185441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:41,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494785165] [2025-03-15 02:27:41,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:41,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:41,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:41,406 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:41,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 02:27:41,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:41,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:27:41,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:27:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:41,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:27:41,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:27:41,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494785165] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:27:41,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:27:41,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-15 02:27:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36976124] [2025-03-15 02:27:41,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:27:41,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-15 02:27:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:41,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-15 02:27:41,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-03-15 02:27:41,661 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 340 [2025-03-15 02:27:41,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 346 places, 375 transitions, 1405 flow. Second operand has 14 states, 14 states have (on average 303.07142857142856) internal successors, (4243), 14 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:41,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:41,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 340 [2025-03-15 02:27:41,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:41,906 INFO L124 PetriNetUnfolderBase]: 104/823 cut-off events. [2025-03-15 02:27:41,906 INFO L125 PetriNetUnfolderBase]: For 2503/2503 co-relation queries the response was YES. [2025-03-15 02:27:41,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1986 conditions, 823 events. 104/823 cut-off events. For 2503/2503 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4250 event pairs, 23 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 1554. Up to 122 conditions per place. [2025-03-15 02:27:41,916 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 43 selfloop transitions, 16 changer transitions 14/371 dead transitions. [2025-03-15 02:27:41,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 371 transitions, 1487 flow [2025-03-15 02:27:41,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:27:41,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:27:41,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3340 transitions. [2025-03-15 02:27:41,922 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.893048128342246 [2025-03-15 02:27:41,923 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 31 predicate places. [2025-03-15 02:27:41,923 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 371 transitions, 1487 flow [2025-03-15 02:27:41,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 303.07142857142856) internal successors, (4243), 14 states have internal predecessors, (4243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:41,925 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:41,925 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:41,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-15 02:27:42,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:42,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:42,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:42,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1655721009, now seen corresponding path program 2 times [2025-03-15 02:27:42,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:42,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750854387] [2025-03-15 02:27:42,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:27:42,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:42,147 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:27:42,147 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:27:42,206 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:27:42,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750854387] [2025-03-15 02:27:42,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750854387] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:42,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514940975] [2025-03-15 02:27:42,207 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:27:42,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:42,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:42,209 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:42,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 02:27:42,269 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:27:42,269 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:27:42,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:27:42,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:27:42,342 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:27:42,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:27:42,444 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:27:42,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514940975] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:27:42,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:27:42,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-15 02:27:42,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833718537] [2025-03-15 02:27:42,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:27:42,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-15 02:27:42,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:42,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-15 02:27:42,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-15 02:27:42,448 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 300 out of 340 [2025-03-15 02:27:42,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 371 transitions, 1487 flow. Second operand has 10 states, 10 states have (on average 303.8) internal successors, (3038), 10 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:42,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:42,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 300 of 340 [2025-03-15 02:27:42,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:42,642 INFO L124 PetriNetUnfolderBase]: 104/822 cut-off events. [2025-03-15 02:27:42,642 INFO L125 PetriNetUnfolderBase]: For 3248/3248 co-relation queries the response was YES. [2025-03-15 02:27:42,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2115 conditions, 822 events. 104/822 cut-off events. For 3248/3248 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4241 event pairs, 23 based on Foata normal form. 0/724 useless extension candidates. Maximal degree in co-relation 1635. Up to 121 conditions per place. [2025-03-15 02:27:42,650 INFO L140 encePairwiseOnDemand]: 329/340 looper letters, 33 selfloop transitions, 25 changer transitions 14/370 dead transitions. [2025-03-15 02:27:42,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 370 transitions, 1597 flow [2025-03-15 02:27:42,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:27:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:27:42,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2424 transitions. [2025-03-15 02:27:42,655 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8911764705882353 [2025-03-15 02:27:42,656 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 37 predicate places. [2025-03-15 02:27:42,656 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 370 transitions, 1597 flow [2025-03-15 02:27:42,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 303.8) internal successors, (3038), 10 states have internal predecessors, (3038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:42,658 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:42,658 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:42,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-15 02:27:42,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:42,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:42,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:42,859 INFO L85 PathProgramCache]: Analyzing trace with hash 541547894, now seen corresponding path program 2 times [2025-03-15 02:27:42,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:42,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731052183] [2025-03-15 02:27:42,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:27:42,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:42,891 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:27:42,891 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:27:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:42,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:42,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731052183] [2025-03-15 02:27:42,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731052183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:42,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:42,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:27:42,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947238545] [2025-03-15 02:27:42,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:42,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:42,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:42,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:42,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:27:42,963 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 340 [2025-03-15 02:27:42,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 370 transitions, 1597 flow. Second operand has 6 states, 6 states have (on average 284.5) internal successors, (1707), 6 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:42,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:42,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 340 [2025-03-15 02:27:42,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:43,312 INFO L124 PetriNetUnfolderBase]: 476/2574 cut-off events. [2025-03-15 02:27:43,313 INFO L125 PetriNetUnfolderBase]: For 4670/4672 co-relation queries the response was YES. [2025-03-15 02:27:43,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5290 conditions, 2574 events. 476/2574 cut-off events. For 4670/4672 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 21616 event pairs, 63 based on Foata normal form. 0/2218 useless extension candidates. Maximal degree in co-relation 4573. Up to 612 conditions per place. [2025-03-15 02:27:43,329 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 61 selfloop transitions, 8 changer transitions 14/383 dead transitions. [2025-03-15 02:27:43,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 383 transitions, 1839 flow [2025-03-15 02:27:43,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:27:43,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:27:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1744 transitions. [2025-03-15 02:27:43,333 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8549019607843137 [2025-03-15 02:27:43,334 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 41 predicate places. [2025-03-15 02:27:43,334 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 383 transitions, 1839 flow [2025-03-15 02:27:43,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.5) internal successors, (1707), 6 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:43,334 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:43,335 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:43,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:27:43,335 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:43,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:43,335 INFO L85 PathProgramCache]: Analyzing trace with hash -613150385, now seen corresponding path program 1 times [2025-03-15 02:27:43,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:43,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310783371] [2025-03-15 02:27:43,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:43,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:43,394 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:43,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310783371] [2025-03-15 02:27:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310783371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17505406] [2025-03-15 02:27:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:43,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:43,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:43,396 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:43,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 383 transitions, 1839 flow. Second operand has 4 states, 4 states have (on average 297.75) internal successors, (1191), 4 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:43,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:43,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:43,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:43,813 INFO L124 PetriNetUnfolderBase]: 553/2998 cut-off events. [2025-03-15 02:27:43,813 INFO L125 PetriNetUnfolderBase]: For 16631/17320 co-relation queries the response was YES. [2025-03-15 02:27:43,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6789 conditions, 2998 events. 553/2998 cut-off events. For 16631/17320 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 26720 event pairs, 84 based on Foata normal form. 11/2574 useless extension candidates. Maximal degree in co-relation 5128. Up to 612 conditions per place. [2025-03-15 02:27:43,840 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 48 selfloop transitions, 5 changer transitions 14/397 dead transitions. [2025-03-15 02:27:43,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 397 transitions, 2061 flow [2025-03-15 02:27:43,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:43,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:43,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1227 transitions. [2025-03-15 02:27:43,843 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9022058823529412 [2025-03-15 02:27:43,844 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 43 predicate places. [2025-03-15 02:27:43,844 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 397 transitions, 2061 flow [2025-03-15 02:27:43,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 297.75) internal successors, (1191), 4 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:43,844 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:43,844 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:43,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:27:43,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:43,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 385358266, now seen corresponding path program 1 times [2025-03-15 02:27:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:43,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025301193] [2025-03-15 02:27:43,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:43,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025301193] [2025-03-15 02:27:43,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025301193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:43,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:43,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:43,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786208608] [2025-03-15 02:27:43,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:43,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:43,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:43,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:43,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:43,920 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:27:43,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 397 transitions, 2061 flow. Second operand has 4 states, 4 states have (on average 309.25) internal successors, (1237), 4 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:43,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:43,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:27:43,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:44,573 INFO L124 PetriNetUnfolderBase]: 897/5107 cut-off events. [2025-03-15 02:27:44,573 INFO L125 PetriNetUnfolderBase]: For 40182/41302 co-relation queries the response was YES. [2025-03-15 02:27:44,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11520 conditions, 5107 events. 897/5107 cut-off events. For 40182/41302 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 51973 event pairs, 114 based on Foata normal form. 50/4404 useless extension candidates. Maximal degree in co-relation 9028. Up to 888 conditions per place. [2025-03-15 02:27:44,607 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 44 selfloop transitions, 6 changer transitions 16/417 dead transitions. [2025-03-15 02:27:44,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 417 transitions, 2485 flow [2025-03-15 02:27:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:27:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:27:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1566 transitions. [2025-03-15 02:27:44,610 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9211764705882353 [2025-03-15 02:27:44,610 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 47 predicate places. [2025-03-15 02:27:44,611 INFO L471 AbstractCegarLoop]: Abstraction has has 372 places, 417 transitions, 2485 flow [2025-03-15 02:27:44,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 309.25) internal successors, (1237), 4 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:44,611 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:44,611 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:44,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:27:44,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:44,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:44,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1827791795, now seen corresponding path program 1 times [2025-03-15 02:27:44,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:44,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751696067] [2025-03-15 02:27:44,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:44,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:44,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:44,715 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:44,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:44,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751696067] [2025-03-15 02:27:44,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751696067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:44,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:44,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:27:44,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122850102] [2025-03-15 02:27:44,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:44,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:44,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:44,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:44,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:27:44,717 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 340 [2025-03-15 02:27:44,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 372 places, 417 transitions, 2485 flow. Second operand has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:44,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:44,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 340 [2025-03-15 02:27:44,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:45,924 INFO L124 PetriNetUnfolderBase]: 1448/7330 cut-off events. [2025-03-15 02:27:45,924 INFO L125 PetriNetUnfolderBase]: For 39726/41096 co-relation queries the response was YES. [2025-03-15 02:27:45,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17146 conditions, 7330 events. 1448/7330 cut-off events. For 39726/41096 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 78984 event pairs, 158 based on Foata normal form. 23/6186 useless extension candidates. Maximal degree in co-relation 14425. Up to 1280 conditions per place. [2025-03-15 02:27:45,971 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 87 selfloop transitions, 10 changer transitions 16/434 dead transitions. [2025-03-15 02:27:45,971 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 434 transitions, 2931 flow [2025-03-15 02:27:45,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:27:45,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:27:45,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1744 transitions. [2025-03-15 02:27:45,974 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8549019607843137 [2025-03-15 02:27:45,976 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 51 predicate places. [2025-03-15 02:27:45,976 INFO L471 AbstractCegarLoop]: Abstraction has has 376 places, 434 transitions, 2931 flow [2025-03-15 02:27:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:45,976 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:45,977 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:45,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:27:45,977 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:45,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:45,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1422887361, now seen corresponding path program 1 times [2025-03-15 02:27:45,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:45,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024572072] [2025-03-15 02:27:45,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:45,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:46,066 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:46,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:46,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024572072] [2025-03-15 02:27:46,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024572072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:46,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:46,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:27:46,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857146188] [2025-03-15 02:27:46,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:46,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:46,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:46,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:46,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:27:46,069 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 340 [2025-03-15 02:27:46,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 376 places, 434 transitions, 2931 flow. Second operand has 6 states, 6 states have (on average 284.5) internal successors, (1707), 6 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:46,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:46,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 340 [2025-03-15 02:27:46,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:46,924 INFO L124 PetriNetUnfolderBase]: 1421/7053 cut-off events. [2025-03-15 02:27:46,924 INFO L125 PetriNetUnfolderBase]: For 46683/48979 co-relation queries the response was YES. [2025-03-15 02:27:46,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18390 conditions, 7053 events. 1421/7053 cut-off events. For 46683/48979 co-relation queries the response was YES. Maximal size of possible extension queue 276. Compared 75431 event pairs, 163 based on Foata normal form. 29/5982 useless extension candidates. Maximal degree in co-relation 15934. Up to 1232 conditions per place. [2025-03-15 02:27:46,965 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 86 selfloop transitions, 10 changer transitions 16/433 dead transitions. [2025-03-15 02:27:46,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 433 transitions, 3125 flow [2025-03-15 02:27:46,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:27:46,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:27:46,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1743 transitions. [2025-03-15 02:27:46,968 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8544117647058823 [2025-03-15 02:27:46,968 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 55 predicate places. [2025-03-15 02:27:46,969 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 433 transitions, 3125 flow [2025-03-15 02:27:46,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.5) internal successors, (1707), 6 states have internal predecessors, (1707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:46,969 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:46,969 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:46,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:27:46,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:46,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:46,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1159836113, now seen corresponding path program 1 times [2025-03-15 02:27:46,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:46,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228941289] [2025-03-15 02:27:46,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:46,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:46,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:47,017 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:47,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:47,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228941289] [2025-03-15 02:27:47,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228941289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:47,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:47,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:47,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685995954] [2025-03-15 02:27:47,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:47,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:47,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:47,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:47,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:47,019 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:47,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 433 transitions, 3125 flow. Second operand has 4 states, 4 states have (on average 298.5) internal successors, (1194), 4 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:47,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:47,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:47,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:48,015 INFO L124 PetriNetUnfolderBase]: 1404/7234 cut-off events. [2025-03-15 02:27:48,016 INFO L125 PetriNetUnfolderBase]: For 54172/56272 co-relation queries the response was YES. [2025-03-15 02:27:48,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19723 conditions, 7234 events. 1404/7234 cut-off events. For 54172/56272 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 77959 event pairs, 168 based on Foata normal form. 19/6147 useless extension candidates. Maximal degree in co-relation 16714. Up to 1280 conditions per place. [2025-03-15 02:27:48,060 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 70 selfloop transitions, 4 changer transitions 16/438 dead transitions. [2025-03-15 02:27:48,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 438 transitions, 3459 flow [2025-03-15 02:27:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:48,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1222 transitions. [2025-03-15 02:27:48,063 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8985294117647059 [2025-03-15 02:27:48,063 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 58 predicate places. [2025-03-15 02:27:48,063 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 438 transitions, 3459 flow [2025-03-15 02:27:48,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.5) internal successors, (1194), 4 states have internal predecessors, (1194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:48,064 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:48,064 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:48,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:27:48,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:48,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:48,065 INFO L85 PathProgramCache]: Analyzing trace with hash -42228388, now seen corresponding path program 1 times [2025-03-15 02:27:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476642866] [2025-03-15 02:27:48,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:48,119 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:48,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:48,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476642866] [2025-03-15 02:27:48,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476642866] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:48,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:48,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:48,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609249283] [2025-03-15 02:27:48,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:48,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:48,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:48,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:48,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:48,121 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:48,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 438 transitions, 3459 flow. Second operand has 4 states, 4 states have (on average 298.75) internal successors, (1195), 4 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 02:27:48,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:48,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:48,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:49,212 INFO L124 PetriNetUnfolderBase]: 1506/7489 cut-off events. [2025-03-15 02:27:49,213 INFO L125 PetriNetUnfolderBase]: For 65612/67753 co-relation queries the response was YES. [2025-03-15 02:27:49,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22310 conditions, 7489 events. 1506/7489 cut-off events. For 65612/67753 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 81815 event pairs, 168 based on Foata normal form. 44/6384 useless extension candidates. Maximal degree in co-relation 18918. Up to 1232 conditions per place. [2025-03-15 02:27:49,288 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 82 selfloop transitions, 5 changer transitions 16/453 dead transitions. [2025-03-15 02:27:49,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 453 transitions, 3959 flow [2025-03-15 02:27:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:49,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:49,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1219 transitions. [2025-03-15 02:27:49,290 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8963235294117647 [2025-03-15 02:27:49,291 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 60 predicate places. [2025-03-15 02:27:49,291 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 453 transitions, 3959 flow [2025-03-15 02:27:49,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.75) internal successors, (1195), 4 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 02:27:49,291 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:49,291 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:49,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:27:49,292 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:49,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:49,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1092625176, now seen corresponding path program 1 times [2025-03-15 02:27:49,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:49,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869145595] [2025-03-15 02:27:49,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:49,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:49,398 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:49,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:49,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869145595] [2025-03-15 02:27:49,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869145595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:49,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:49,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:27:49,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492515599] [2025-03-15 02:27:49,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:49,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:49,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:49,401 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:49,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:27:49,402 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 340 [2025-03-15 02:27:49,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 453 transitions, 3959 flow. Second operand has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:49,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:49,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 340 [2025-03-15 02:27:49,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:50,346 INFO L124 PetriNetUnfolderBase]: 1495/7669 cut-off events. [2025-03-15 02:27:50,346 INFO L125 PetriNetUnfolderBase]: For 69064/73107 co-relation queries the response was YES. [2025-03-15 02:27:50,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24579 conditions, 7669 events. 1495/7669 cut-off events. For 69064/73107 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 84028 event pairs, 163 based on Foata normal form. 37/6559 useless extension candidates. Maximal degree in co-relation 20588. Up to 1226 conditions per place. [2025-03-15 02:27:50,412 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 100 selfloop transitions, 10 changer transitions 16/452 dead transitions. [2025-03-15 02:27:50,412 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 452 transitions, 4181 flow [2025-03-15 02:27:50,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:27:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:27:50,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1743 transitions. [2025-03-15 02:27:50,415 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8544117647058823 [2025-03-15 02:27:50,415 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 64 predicate places. [2025-03-15 02:27:50,415 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 452 transitions, 4181 flow [2025-03-15 02:27:50,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.6666666666667) internal successors, (1708), 6 states have internal predecessors, (1708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:50,416 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:50,416 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:50,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:27:50,416 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:50,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:50,417 INFO L85 PathProgramCache]: Analyzing trace with hash -827737930, now seen corresponding path program 1 times [2025-03-15 02:27:50,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:50,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883778672] [2025-03-15 02:27:50,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:50,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:50,541 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:50,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:50,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883778672] [2025-03-15 02:27:50,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883778672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:50,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:50,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:27:50,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974980853] [2025-03-15 02:27:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:50,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:27:50,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:50,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:27:50,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:27:50,543 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:27:50,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 452 transitions, 4181 flow. Second operand has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:50,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:50,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:27:50,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:51,648 INFO L124 PetriNetUnfolderBase]: 1867/8555 cut-off events. [2025-03-15 02:27:51,648 INFO L125 PetriNetUnfolderBase]: For 82289/85539 co-relation queries the response was YES. [2025-03-15 02:27:51,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29974 conditions, 8555 events. 1867/8555 cut-off events. For 82289/85539 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 92459 event pairs, 167 based on Foata normal form. 26/7426 useless extension candidates. Maximal degree in co-relation 25826. Up to 1334 conditions per place. [2025-03-15 02:27:51,720 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 127 selfloop transitions, 15 changer transitions 16/473 dead transitions. [2025-03-15 02:27:51,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 473 transitions, 4809 flow [2025-03-15 02:27:51,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:27:51,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:27:51,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2288 transitions. [2025-03-15 02:27:51,723 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8411764705882353 [2025-03-15 02:27:51,723 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 71 predicate places. [2025-03-15 02:27:51,723 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 473 transitions, 4809 flow [2025-03-15 02:27:51,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.375) internal successors, (2235), 8 states have internal predecessors, (2235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:51,724 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:51,724 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:51,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:27:51,724 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:51,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:51,725 INFO L85 PathProgramCache]: Analyzing trace with hash -488356931, now seen corresponding path program 1 times [2025-03-15 02:27:51,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:51,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886618374] [2025-03-15 02:27:51,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:51,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:51,773 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:51,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886618374] [2025-03-15 02:27:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886618374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701178129] [2025-03-15 02:27:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:51,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:51,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:51,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:51,775 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:51,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 473 transitions, 4809 flow. Second operand has 4 states, 4 states have (on average 298.75) internal successors, (1195), 4 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 02:27:51,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:51,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:51,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:52,757 INFO L124 PetriNetUnfolderBase]: 1825/8318 cut-off events. [2025-03-15 02:27:52,758 INFO L125 PetriNetUnfolderBase]: For 87579/93000 co-relation queries the response was YES. [2025-03-15 02:27:52,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30769 conditions, 8318 events. 1825/8318 cut-off events. For 87579/93000 co-relation queries the response was YES. Maximal size of possible extension queue 296. Compared 90293 event pairs, 167 based on Foata normal form. 29/7268 useless extension candidates. Maximal degree in co-relation 26962. Up to 1334 conditions per place. [2025-03-15 02:27:52,831 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 96 selfloop transitions, 4 changer transitions 16/484 dead transitions. [2025-03-15 02:27:52,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 484 transitions, 5477 flow [2025-03-15 02:27:52,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:52,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:52,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1222 transitions. [2025-03-15 02:27:52,832 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8985294117647059 [2025-03-15 02:27:52,833 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 74 predicate places. [2025-03-15 02:27:52,833 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 484 transitions, 5477 flow [2025-03-15 02:27:52,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 298.75) internal successors, (1195), 4 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 02:27:52,833 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:52,834 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:52,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-15 02:27:52,834 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:52,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:52,834 INFO L85 PathProgramCache]: Analyzing trace with hash 109928840, now seen corresponding path program 1 times [2025-03-15 02:27:52,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:52,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004086864] [2025-03-15 02:27:52,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:52,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:52,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:52,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004086864] [2025-03-15 02:27:52,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004086864] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:52,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:52,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:27:52,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440166007] [2025-03-15 02:27:52,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:52,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:27:52,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:52,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:27:52,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:27:52,932 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:27:52,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 484 transitions, 5477 flow. Second operand has 8 states, 8 states have (on average 279.5) internal successors, (2236), 8 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:52,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:52,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:27:52,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:54,347 INFO L124 PetriNetUnfolderBase]: 1940/8376 cut-off events. [2025-03-15 02:27:54,347 INFO L125 PetriNetUnfolderBase]: For 101294/105543 co-relation queries the response was YES. [2025-03-15 02:27:54,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33725 conditions, 8376 events. 1940/8376 cut-off events. For 101294/105543 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 89839 event pairs, 167 based on Foata normal form. 29/7389 useless extension candidates. Maximal degree in co-relation 29819. Up to 1320 conditions per place. [2025-03-15 02:27:54,442 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 168 selfloop transitions, 16 changer transitions 16/514 dead transitions. [2025-03-15 02:27:54,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 514 transitions, 6525 flow [2025-03-15 02:27:54,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:27:54,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:27:54,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2287 transitions. [2025-03-15 02:27:54,445 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8408088235294118 [2025-03-15 02:27:54,445 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 81 predicate places. [2025-03-15 02:27:54,445 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 514 transitions, 6525 flow [2025-03-15 02:27:54,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.5) internal successors, (2236), 8 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:54,446 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:54,446 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:54,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-15 02:27:54,446 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:54,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:54,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1669568513, now seen corresponding path program 1 times [2025-03-15 02:27:54,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:54,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800471336] [2025-03-15 02:27:54,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:54,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:54,573 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:54,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:54,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800471336] [2025-03-15 02:27:54,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800471336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:54,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:54,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:27:54,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815751246] [2025-03-15 02:27:54,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:54,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:54,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:54,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:54,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:27:54,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:27:54,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 514 transitions, 6525 flow. Second operand has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:54,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:54,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:27:54,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:55,634 INFO L124 PetriNetUnfolderBase]: 1511/6411 cut-off events. [2025-03-15 02:27:55,635 INFO L125 PetriNetUnfolderBase]: For 353476/367801 co-relation queries the response was YES. [2025-03-15 02:27:55,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29544 conditions, 6411 events. 1511/6411 cut-off events. For 353476/367801 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 63898 event pairs, 212 based on Foata normal form. 455/6064 useless extension candidates. Maximal degree in co-relation 25332. Up to 1091 conditions per place. [2025-03-15 02:27:55,676 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 149 selfloop transitions, 13 changer transitions 18/543 dead transitions. [2025-03-15 02:27:55,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 543 transitions, 7402 flow [2025-03-15 02:27:55,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:27:55,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:27:55,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2573 transitions. [2025-03-15 02:27:55,678 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8408496732026144 [2025-03-15 02:27:55,678 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 89 predicate places. [2025-03-15 02:27:55,678 INFO L471 AbstractCegarLoop]: Abstraction has has 414 places, 543 transitions, 7402 flow [2025-03-15 02:27:55,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 281.5) internal successors, (1689), 6 states have internal predecessors, (1689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:55,679 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:55,679 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:55,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-15 02:27:55,679 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:55,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:55,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1294976013, now seen corresponding path program 1 times [2025-03-15 02:27:55,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:55,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873770396] [2025-03-15 02:27:55,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:55,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:55,733 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:55,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873770396] [2025-03-15 02:27:55,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873770396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:55,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:55,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:27:55,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937757896] [2025-03-15 02:27:55,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:55,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:27:55,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:55,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:27:55,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:27:55,734 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 340 [2025-03-15 02:27:55,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 414 places, 543 transitions, 7402 flow. Second operand has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:55,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:55,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 340 [2025-03-15 02:27:55,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:56,774 INFO L124 PetriNetUnfolderBase]: 1672/7011 cut-off events. [2025-03-15 02:27:56,775 INFO L125 PetriNetUnfolderBase]: For 244376/257025 co-relation queries the response was YES. [2025-03-15 02:27:56,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34262 conditions, 7011 events. 1672/7011 cut-off events. For 244376/257025 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 71483 event pairs, 167 based on Foata normal form. 79/6186 useless extension candidates. Maximal degree in co-relation 29234. Up to 1292 conditions per place. [2025-03-15 02:27:56,858 INFO L140 encePairwiseOnDemand]: 335/340 looper letters, 139 selfloop transitions, 5 changer transitions 24/574 dead transitions. [2025-03-15 02:27:56,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 416 places, 574 transitions, 8848 flow [2025-03-15 02:27:56,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:27:56,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:27:56,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1219 transitions. [2025-03-15 02:27:56,860 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8963235294117647 [2025-03-15 02:27:56,860 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 91 predicate places. [2025-03-15 02:27:56,860 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 574 transitions, 8848 flow [2025-03-15 02:27:56,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:56,861 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:56,861 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:56,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-15 02:27:56,861 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:56,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:56,862 INFO L85 PathProgramCache]: Analyzing trace with hash -983066772, now seen corresponding path program 1 times [2025-03-15 02:27:56,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:56,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746335555] [2025-03-15 02:27:56,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:56,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:56,940 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:56,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746335555] [2025-03-15 02:27:56,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746335555] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:56,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832771132] [2025-03-15 02:27:56,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:56,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:56,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:56,943 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:56,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 02:27:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:57,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:27:57,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:27:57,076 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:57,076 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:27:57,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832771132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:57,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:27:57,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:27:57,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199166844] [2025-03-15 02:27:57,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:57,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:27:57,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:57,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:27:57,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:27:57,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:27:57,079 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 574 transitions, 8848 flow. Second operand has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:57,079 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:57,079 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:27:57,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:58,021 INFO L124 PetriNetUnfolderBase]: 1664/6735 cut-off events. [2025-03-15 02:27:58,021 INFO L125 PetriNetUnfolderBase]: For 274457/291241 co-relation queries the response was YES. [2025-03-15 02:27:58,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34263 conditions, 6735 events. 1664/6735 cut-off events. For 274457/291241 co-relation queries the response was YES. Maximal size of possible extension queue 277. Compared 67828 event pairs, 153 based on Foata normal form. 233/6120 useless extension candidates. Maximal degree in co-relation 29782. Up to 1240 conditions per place. [2025-03-15 02:27:58,086 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 122 selfloop transitions, 8 changer transitions 24/575 dead transitions. [2025-03-15 02:27:58,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 575 transitions, 9222 flow [2025-03-15 02:27:58,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:27:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:27:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2181 transitions. [2025-03-15 02:27:58,088 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9163865546218487 [2025-03-15 02:27:58,088 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 96 predicate places. [2025-03-15 02:27:58,088 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 575 transitions, 9222 flow [2025-03-15 02:27:58,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.5) internal successors, (1857), 6 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:58,089 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:58,089 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:58,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-15 02:27:58,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-15 02:27:58,289 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:58,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:58,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1833666242, now seen corresponding path program 1 times [2025-03-15 02:27:58,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:58,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171926104] [2025-03-15 02:27:58,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:58,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:58,392 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:58,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:58,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171926104] [2025-03-15 02:27:58,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171926104] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:27:58,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:27:58,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:27:58,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507683636] [2025-03-15 02:27:58,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:27:58,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:27:58,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:27:58,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:27:58,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:27:58,395 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:27:58,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 575 transitions, 9222 flow. Second operand has 8 states, 8 states have (on average 279.5) internal successors, (2236), 8 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:58,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:27:58,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:27:58,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:27:59,846 INFO L124 PetriNetUnfolderBase]: 2070/7858 cut-off events. [2025-03-15 02:27:59,846 INFO L125 PetriNetUnfolderBase]: For 515971/539372 co-relation queries the response was YES. [2025-03-15 02:27:59,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42002 conditions, 7858 events. 2070/7858 cut-off events. For 515971/539372 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 80298 event pairs, 151 based on Foata normal form. 181/7190 useless extension candidates. Maximal degree in co-relation 37371. Up to 1474 conditions per place. [2025-03-15 02:27:59,907 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 222 selfloop transitions, 22 changer transitions 24/616 dead transitions. [2025-03-15 02:27:59,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 616 transitions, 10852 flow [2025-03-15 02:27:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:27:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:27:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2288 transitions. [2025-03-15 02:27:59,909 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8411764705882353 [2025-03-15 02:27:59,909 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 103 predicate places. [2025-03-15 02:27:59,909 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 616 transitions, 10852 flow [2025-03-15 02:27:59,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.5) internal successors, (2236), 8 states have internal predecessors, (2236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:27:59,909 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:27:59,910 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:27:59,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-15 02:27:59,910 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:27:59,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:27:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -410297991, now seen corresponding path program 1 times [2025-03-15 02:27:59,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:27:59,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456710721] [2025-03-15 02:27:59,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:59,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:27:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:27:59,974 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:27:59,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:27:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456710721] [2025-03-15 02:27:59,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456710721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:27:59,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2125903666] [2025-03-15 02:27:59,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:27:59,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:27:59,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:27:59,976 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:27:59,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 02:28:00,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:00,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:00,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:00,094 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:00,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:00,152 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2125903666] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:00,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:00,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:00,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943528931] [2025-03-15 02:28:00,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:00,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:00,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:00,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:00,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:00,154 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:28:00,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 616 transitions, 10852 flow. Second operand has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:00,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:00,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:28:00,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:04,030 INFO L124 PetriNetUnfolderBase]: 5532/21137 cut-off events. [2025-03-15 02:28:04,030 INFO L125 PetriNetUnfolderBase]: For 1387431/1475174 co-relation queries the response was YES. [2025-03-15 02:28:04,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116472 conditions, 21137 events. 5532/21137 cut-off events. For 1387431/1475174 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 251536 event pairs, 387 based on Foata normal form. 2076/21002 useless extension candidates. Maximal degree in co-relation 101902. Up to 4594 conditions per place. [2025-03-15 02:28:04,268 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 425 selfloop transitions, 16 changer transitions 48/933 dead transitions. [2025-03-15 02:28:04,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 933 transitions, 26968 flow [2025-03-15 02:28:04,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:04,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4368 transitions. [2025-03-15 02:28:04,271 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9176470588235294 [2025-03-15 02:28:04,272 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 116 predicate places. [2025-03-15 02:28:04,272 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 933 transitions, 26968 flow [2025-03-15 02:28:04,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 310.0) internal successors, (3720), 12 states have internal predecessors, (3720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:04,273 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:04,273 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:04,280 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-15 02:28:04,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:04,474 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1009079647, now seen corresponding path program 1 times [2025-03-15 02:28:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881354657] [2025-03-15 02:28:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:04,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:04,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:04,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881354657] [2025-03-15 02:28:04,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881354657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:04,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:28:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948629050] [2025-03-15 02:28:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-15 02:28:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:04,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-15 02:28:04,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:04,579 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:28:04,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 933 transitions, 26968 flow. Second operand has 8 states, 8 states have (on average 279.625) internal successors, (2237), 8 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:04,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:04,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:28:04,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:09,682 INFO L124 PetriNetUnfolderBase]: 5719/21408 cut-off events. [2025-03-15 02:28:09,683 INFO L125 PetriNetUnfolderBase]: For 1394241/1467756 co-relation queries the response was YES. [2025-03-15 02:28:09,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124057 conditions, 21408 events. 5719/21408 cut-off events. For 1394241/1467756 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 252386 event pairs, 401 based on Foata normal form. 908/20233 useless extension candidates. Maximal degree in co-relation 108228. Up to 4690 conditions per place. [2025-03-15 02:28:09,943 INFO L140 encePairwiseOnDemand]: 328/340 looper letters, 553 selfloop transitions, 23 changer transitions 120/1067 dead transitions. [2025-03-15 02:28:09,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 1067 transitions, 34392 flow [2025-03-15 02:28:09,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:28:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:28:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2287 transitions. [2025-03-15 02:28:09,945 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8408088235294118 [2025-03-15 02:28:09,946 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 123 predicate places. [2025-03-15 02:28:09,946 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 1067 transitions, 34392 flow [2025-03-15 02:28:09,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 279.625) internal successors, (2237), 8 states have internal predecessors, (2237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:09,946 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:09,946 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:09,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-15 02:28:09,946 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:09,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1829896584, now seen corresponding path program 1 times [2025-03-15 02:28:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:09,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497946915] [2025-03-15 02:28:09,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:10,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:10,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:10,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497946915] [2025-03-15 02:28:10,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497946915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:10,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:28:10,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-15 02:28:10,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148404674] [2025-03-15 02:28:10,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:10,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:28:10,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:10,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:28:10,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:28:10,033 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 340 [2025-03-15 02:28:10,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 1067 transitions, 34392 flow. Second operand has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:10,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:10,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 340 [2025-03-15 02:28:10,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:15,105 INFO L124 PetriNetUnfolderBase]: 4986/17300 cut-off events. [2025-03-15 02:28:15,105 INFO L125 PetriNetUnfolderBase]: For 1898847/1974464 co-relation queries the response was YES. [2025-03-15 02:28:15,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116034 conditions, 17300 events. 4986/17300 cut-off events. For 1898847/1974464 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 192244 event pairs, 412 based on Foata normal form. 850/16261 useless extension candidates. Maximal degree in co-relation 100206. Up to 3886 conditions per place. [2025-03-15 02:28:15,474 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 397 selfloop transitions, 13 changer transitions 183/1029 dead transitions. [2025-03-15 02:28:15,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 1029 transitions, 31830 flow [2025-03-15 02:28:15,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:28:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:28:15,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2571 transitions. [2025-03-15 02:28:15,476 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8401960784313726 [2025-03-15 02:28:15,476 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 131 predicate places. [2025-03-15 02:28:15,476 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 1029 transitions, 31830 flow [2025-03-15 02:28:15,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:15,477 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:15,477 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:15,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-15 02:28:15,477 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:15,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:15,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1806497384, now seen corresponding path program 1 times [2025-03-15 02:28:15,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:15,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084410734] [2025-03-15 02:28:15,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:15,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:15,541 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:15,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:15,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084410734] [2025-03-15 02:28:15,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084410734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:15,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43963273] [2025-03-15 02:28:15,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:15,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:15,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:15,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:15,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-15 02:28:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:15,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:15,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:15,666 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:15,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:28:15,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43963273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:15,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:28:15,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:28:15,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376682122] [2025-03-15 02:28:15,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:15,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:15,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:15,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:15,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:28:15,668 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:28:15,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1029 transitions, 31830 flow. Second operand has 6 states, 6 states have (on average 309.6666666666667) internal successors, (1858), 6 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:15,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:15,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:28:15,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:19,465 INFO L124 PetriNetUnfolderBase]: 4977/17263 cut-off events. [2025-03-15 02:28:19,465 INFO L125 PetriNetUnfolderBase]: For 2075040/2153239 co-relation queries the response was YES. [2025-03-15 02:28:19,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117850 conditions, 17263 events. 4977/17263 cut-off events. For 2075040/2153239 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 191321 event pairs, 282 based on Foata normal form. 878/16294 useless extension candidates. Maximal degree in co-relation 101566. Up to 3882 conditions per place. [2025-03-15 02:28:19,708 INFO L140 encePairwiseOnDemand]: 333/340 looper letters, 329 selfloop transitions, 8 changer transitions 183/1046 dead transitions. [2025-03-15 02:28:19,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 461 places, 1046 transitions, 33868 flow [2025-03-15 02:28:19,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:28:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:28:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 2180 transitions. [2025-03-15 02:28:19,710 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9159663865546218 [2025-03-15 02:28:19,710 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 136 predicate places. [2025-03-15 02:28:19,710 INFO L471 AbstractCegarLoop]: Abstraction has has 461 places, 1046 transitions, 33868 flow [2025-03-15 02:28:19,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.6666666666667) internal successors, (1858), 6 states have internal predecessors, (1858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:19,710 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:19,710 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:19,717 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-15 02:28:19,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:19,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:19,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash -166843088, now seen corresponding path program 1 times [2025-03-15 02:28:19,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:19,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710888419] [2025-03-15 02:28:19,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:19,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:19,980 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:19,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710888419] [2025-03-15 02:28:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710888419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977632212] [2025-03-15 02:28:19,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:19,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:19,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:19,982 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:19,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-15 02:28:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:20,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:28:20,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:20,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:28:20,183 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:20,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977632212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:28:20,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:28:20,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:28:20,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255018939] [2025-03-15 02:28:20,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:28:20,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:28:20,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:20,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:28:20,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:20,185 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 340 [2025-03-15 02:28:20,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 461 places, 1046 transitions, 33868 flow. Second operand has 12 states, 12 states have (on average 310.0833333333333) internal successors, (3721), 12 states have internal predecessors, (3721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:20,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:20,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 340 [2025-03-15 02:28:20,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:31,919 INFO L124 PetriNetUnfolderBase]: 12792/45372 cut-off events. [2025-03-15 02:28:31,920 INFO L125 PetriNetUnfolderBase]: For 8941499/9270200 co-relation queries the response was YES. [2025-03-15 02:28:32,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309396 conditions, 45372 events. 12792/45372 cut-off events. For 8941499/9270200 co-relation queries the response was YES. Maximal size of possible extension queue 1229. Compared 597400 event pairs, 593 based on Foata normal form. 3492/44540 useless extension candidates. Maximal degree in co-relation 290496. Up to 13052 conditions per place. [2025-03-15 02:28:32,553 INFO L140 encePairwiseOnDemand]: 332/340 looper letters, 830 selfloop transitions, 16 changer transitions 561/1933 dead transitions. [2025-03-15 02:28:32,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 474 places, 1933 transitions, 87802 flow [2025-03-15 02:28:32,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:28:32,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:28:32,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 4364 transitions. [2025-03-15 02:28:32,556 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9168067226890756 [2025-03-15 02:28:32,557 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 149 predicate places. [2025-03-15 02:28:32,557 INFO L471 AbstractCegarLoop]: Abstraction has has 474 places, 1933 transitions, 87802 flow [2025-03-15 02:28:32,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 310.0833333333333) internal successors, (3721), 12 states have internal predecessors, (3721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:32,558 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:32,558 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:32,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-15 02:28:32,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-15 02:28:32,759 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:32,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:32,759 INFO L85 PathProgramCache]: Analyzing trace with hash 804229763, now seen corresponding path program 1 times [2025-03-15 02:28:32,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:32,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105777017] [2025-03-15 02:28:32,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:32,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:32,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,865 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:32,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105777017] [2025-03-15 02:28:32,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105777017] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:32,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836761405] [2025-03-15 02:28:32,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:32,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:32,868 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:32,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-15 02:28:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:32,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:28:32,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-15 02:28:33,042 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:28:33,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836761405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:33,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:28:33,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-15 02:28:33,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532250082] [2025-03-15 02:28:33,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:33,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:33,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:33,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:33,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:33,045 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 340 [2025-03-15 02:28:33,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 474 places, 1933 transitions, 87802 flow. Second operand has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:33,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:33,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 340 [2025-03-15 02:28:33,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:28:54,825 INFO L124 PetriNetUnfolderBase]: 12684/45136 cut-off events. [2025-03-15 02:28:54,825 INFO L125 PetriNetUnfolderBase]: For 9692024/10598341 co-relation queries the response was YES. [2025-03-15 02:28:55,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320917 conditions, 45136 events. 12684/45136 cut-off events. For 9692024/10598341 co-relation queries the response was YES. Maximal size of possible extension queue 1222. Compared 594846 event pairs, 607 based on Foata normal form. 3215/44155 useless extension candidates. Maximal degree in co-relation 301339. Up to 13000 conditions per place. [2025-03-15 02:28:55,538 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 912 selfloop transitions, 12 changer transitions 561/1973 dead transitions. [2025-03-15 02:28:55,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 481 places, 1973 transitions, 92496 flow [2025-03-15 02:28:55,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:28:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:28:55,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2489 transitions. [2025-03-15 02:28:55,540 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8133986928104575 [2025-03-15 02:28:55,541 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 156 predicate places. [2025-03-15 02:28:55,541 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 1973 transitions, 92496 flow [2025-03-15 02:28:55,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.0) internal successors, (1644), 6 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:55,541 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:28:55,541 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:28:55,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-15 02:28:55,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-15 02:28:55,742 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:28:55,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:28:55,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1579281488, now seen corresponding path program 1 times [2025-03-15 02:28:55,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:28:55,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915089096] [2025-03-15 02:28:55,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:55,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:28:55,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:28:55,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:28:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915089096] [2025-03-15 02:28:55,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915089096] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:28:55,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [898291354] [2025-03-15 02:28:55,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:28:55,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:28:55,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:28:55,851 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:28:56,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-15 02:28:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:28:56,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:28:56,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:28:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-15 02:28:56,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:28:56,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [898291354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:28:56,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:28:56,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-15 02:28:56,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134286046] [2025-03-15 02:28:56,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:28:56,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:28:56,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:28:56,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:28:56,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:28:56,203 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 340 [2025-03-15 02:28:56,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 1973 transitions, 92496 flow. Second operand has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:28:56,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:28:56,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 340 [2025-03-15 02:28:56,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:19,426 INFO L124 PetriNetUnfolderBase]: 12585/45432 cut-off events. [2025-03-15 02:29:19,427 INFO L125 PetriNetUnfolderBase]: For 10693687/12626526 co-relation queries the response was YES. [2025-03-15 02:29:19,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 334497 conditions, 45432 events. 12585/45432 cut-off events. For 10693687/12626526 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 599477 event pairs, 579 based on Foata normal form. 3215/44520 useless extension candidates. Maximal degree in co-relation 312282. Up to 13145 conditions per place. [2025-03-15 02:29:20,196 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 949 selfloop transitions, 12 changer transitions 561/2010 dead transitions. [2025-03-15 02:29:20,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 2010 transitions, 97550 flow [2025-03-15 02:29:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:29:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:29:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2480 transitions. [2025-03-15 02:29:20,198 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2025-03-15 02:29:20,199 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 163 predicate places. [2025-03-15 02:29:20,199 INFO L471 AbstractCegarLoop]: Abstraction has has 488 places, 2010 transitions, 97550 flow [2025-03-15 02:29:20,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:20,199 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:20,200 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:20,206 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-15 02:29:20,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:20,401 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:29:20,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:20,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1221498330, now seen corresponding path program 1 times [2025-03-15 02:29:20,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:20,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369555210] [2025-03-15 02:29:20,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:20,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:20,538 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:29:20,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369555210] [2025-03-15 02:29:20,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369555210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:20,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526902909] [2025-03-15 02:29:20,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:20,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:20,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:20,541 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:20,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-15 02:29:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:29:20,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:20,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-15 02:29:20,744 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:29:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526902909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:20,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:29:20,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-15 02:29:20,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3238330] [2025-03-15 02:29:20,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:20,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:20,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:20,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:20,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:29:20,746 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 340 [2025-03-15 02:29:20,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 488 places, 2010 transitions, 97550 flow. Second operand has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:20,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:20,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 340 [2025-03-15 02:29:20,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:29:48,769 INFO L124 PetriNetUnfolderBase]: 12445/45108 cut-off events. [2025-03-15 02:29:48,770 INFO L125 PetriNetUnfolderBase]: For 11145573/13076419 co-relation queries the response was YES. [2025-03-15 02:29:49,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348970 conditions, 45108 events. 12445/45108 cut-off events. For 11145573/13076419 co-relation queries the response was YES. Maximal size of possible extension queue 1204. Compared 595596 event pairs, 593 based on Foata normal form. 3175/44335 useless extension candidates. Maximal degree in co-relation 325957. Up to 13109 conditions per place. [2025-03-15 02:29:49,478 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 764 selfloop transitions, 12 changer transitions 993/2274 dead transitions. [2025-03-15 02:29:49,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 2274 transitions, 117484 flow [2025-03-15 02:29:49,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:29:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:29:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2489 transitions. [2025-03-15 02:29:49,481 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8133986928104575 [2025-03-15 02:29:49,481 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 170 predicate places. [2025-03-15 02:29:49,481 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 2274 transitions, 117484 flow [2025-03-15 02:29:49,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.1666666666667) internal successors, (1645), 6 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:49,482 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:29:49,482 INFO L221 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:29:49,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-15 02:29:49,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-15 02:29:49,683 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:29:49,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:29:49,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1528857700, now seen corresponding path program 1 times [2025-03-15 02:29:49,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:29:49,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647537428] [2025-03-15 02:29:49,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:49,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:29:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:49,978 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-15 02:29:49,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:29:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647537428] [2025-03-15 02:29:49,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647537428] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:29:49,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914390098] [2025-03-15 02:29:49,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:29:49,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:29:49,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:29:49,980 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:29:49,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-15 02:29:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:29:50,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-15 02:29:50,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:29:50,137 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-15 02:29:50,138 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:29:50,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914390098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:29:50,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:29:50,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 12 [2025-03-15 02:29:50,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30668875] [2025-03-15 02:29:50,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:29:50,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:29:50,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:29:50,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:29:50,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:29:50,140 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 340 [2025-03-15 02:29:50,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 2274 transitions, 117484 flow. Second operand has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:29:50,141 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:29:50,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 340 [2025-03-15 02:29:50,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:24,175 INFO L124 PetriNetUnfolderBase]: 12305/44790 cut-off events. [2025-03-15 02:30:24,175 INFO L125 PetriNetUnfolderBase]: For 11505939/13455113 co-relation queries the response was YES. [2025-03-15 02:30:24,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 363555 conditions, 44790 events. 12305/44790 cut-off events. For 11505939/13455113 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 591150 event pairs, 593 based on Foata normal form. 3135/44155 useless extension candidates. Maximal degree in co-relation 339740. Up to 14631 conditions per place. [2025-03-15 02:30:24,797 INFO L140 encePairwiseOnDemand]: 330/340 looper letters, 409 selfloop transitions, 12 changer transitions 1659/2567 dead transitions. [2025-03-15 02:30:24,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 502 places, 2567 transitions, 140898 flow [2025-03-15 02:30:24,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:30:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:30:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2480 transitions. [2025-03-15 02:30:24,800 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8104575163398693 [2025-03-15 02:30:24,800 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 177 predicate places. [2025-03-15 02:30:24,800 INFO L471 AbstractCegarLoop]: Abstraction has has 502 places, 2567 transitions, 140898 flow [2025-03-15 02:30:24,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 274.3333333333333) internal successors, (1646), 6 states have internal predecessors, (1646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:24,801 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:24,801 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:24,808 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-15 02:30:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-15 02:30:25,001 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:30:25,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:25,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1317769857, now seen corresponding path program 2 times [2025-03-15 02:30:25,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:25,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732547250] [2025-03-15 02:30:25,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:30:25,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:25,020 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:30:25,020 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:30:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-15 02:30:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732547250] [2025-03-15 02:30:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732547250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:25,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:30:25,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550093911] [2025-03-15 02:30:25,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:25,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:30:25,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:25,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:30:25,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:30:25,073 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 340 [2025-03-15 02:30:25,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 502 places, 2567 transitions, 140898 flow. Second operand has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:25,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:25,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 340 [2025-03-15 02:30:25,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:30:54,637 INFO L124 PetriNetUnfolderBase]: 12304/44770 cut-off events. [2025-03-15 02:30:54,638 INFO L125 PetriNetUnfolderBase]: For 12360406/16130018 co-relation queries the response was YES. [2025-03-15 02:30:55,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373235 conditions, 44770 events. 12304/44770 cut-off events. For 12360406/16130018 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 590781 event pairs, 621 based on Foata normal form. 29381/70395 useless extension candidates. Maximal degree in co-relation 348717. Up to 14630 conditions per place. [2025-03-15 02:30:55,307 INFO L140 encePairwiseOnDemand]: 327/340 looper letters, 412 selfloop transitions, 29 changer transitions 1659/2583 dead transitions. [2025-03-15 02:30:55,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 508 places, 2583 transitions, 146203 flow [2025-03-15 02:30:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:30:55,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:30:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2310 transitions. [2025-03-15 02:30:55,310 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8492647058823529 [2025-03-15 02:30:55,310 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 183 predicate places. [2025-03-15 02:30:55,310 INFO L471 AbstractCegarLoop]: Abstraction has has 508 places, 2583 transitions, 146203 flow [2025-03-15 02:30:55,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 285.3333333333333) internal successors, (1712), 6 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:55,310 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:30:55,311 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:30:55,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-15 02:30:55,311 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 35 more)] === [2025-03-15 02:30:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:30:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1667108822, now seen corresponding path program 2 times [2025-03-15 02:30:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:30:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553879243] [2025-03-15 02:30:55,312 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:30:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:30:55,324 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:30:55,324 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:30:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 185 trivial. 0 not checked. [2025-03-15 02:30:55,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:30:55,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553879243] [2025-03-15 02:30:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553879243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:30:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:30:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:30:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455139416] [2025-03-15 02:30:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:30:55,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:30:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:30:55,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:30:55,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:30:55,391 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 340 [2025-03-15 02:30:55,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 508 places, 2583 transitions, 146203 flow. Second operand has 7 states, 7 states have (on average 277.2857142857143) internal successors, (1941), 7 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:30:55,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:30:55,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 340 [2025-03-15 02:30:55,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:31:33,339 INFO L124 PetriNetUnfolderBase]: 12295/44754 cut-off events. [2025-03-15 02:31:33,339 INFO L125 PetriNetUnfolderBase]: For 8257647/9876410 co-relation queries the response was YES. [2025-03-15 02:31:33,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389084 conditions, 44754 events. 12295/44754 cut-off events. For 8257647/9876410 co-relation queries the response was YES. Maximal size of possible extension queue 1192. Compared 590101 event pairs, 555 based on Foata normal form. 4195/45338 useless extension candidates. Maximal degree in co-relation 363801. Up to 14621 conditions per place. [2025-03-15 02:31:33,857 INFO L140 encePairwiseOnDemand]: 323/340 looper letters, 0 selfloop transitions, 0 changer transitions 2807/2807 dead transitions. [2025-03-15 02:31:33,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 2807 transitions, 166876 flow [2025-03-15 02:31:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-15 02:31:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-15 02:31:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3339 transitions. [2025-03-15 02:31:33,860 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8183823529411764 [2025-03-15 02:31:33,860 INFO L298 CegarLoopForPetriNet]: 325 programPoint places, 193 predicate places. [2025-03-15 02:31:33,860 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 2807 transitions, 166876 flow [2025-03-15 02:31:33,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 277.2857142857143) internal successors, (1941), 7 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:31:33,880 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/chl-name-comparator-symm.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 02:31:34,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 38 remaining) [2025-03-15 02:31:34,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 38 remaining) [2025-03-15 02:31:34,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 38 remaining) [2025-03-15 02:31:34,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 38 remaining) [2025-03-15 02:31:34,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 38 remaining) [2025-03-15 02:31:34,279 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 38 remaining) [2025-03-15 02:31:34,280 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 38 remaining) [2025-03-15 02:31:34,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-15 02:31:34,281 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-15 02:31:34,300 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:31:34,300 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:31:34,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:31:34 BasicIcfg [2025-03-15 02:31:34,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:31:34,318 INFO L158 Benchmark]: Toolchain (without parser) took 236935.68ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 43.9MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 02:31:34,318 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:31:34,318 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.65ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 31.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:31:34,318 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.30ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 29.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:31:34,318 INFO L158 Benchmark]: Boogie Preprocessor took 24.34ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 27.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:31:34,319 INFO L158 Benchmark]: RCFGBuilder took 521.06ms. Allocated memory is still 71.3MB. Free memory was 27.5MB in the beginning and 29.8MB in the end (delta: -2.3MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. [2025-03-15 02:31:34,319 INFO L158 Benchmark]: TraceAbstraction took 236125.02ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 28.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 02:31:34,320 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory was 36.7MB in the beginning and 36.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.65ms. Allocated memory is still 71.3MB. Free memory was 43.8MB in the beginning and 31.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 31.30ms. Allocated memory is still 71.3MB. Free memory was 31.2MB in the beginning and 29.0MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.34ms. Allocated memory is still 71.3MB. Free memory was 29.0MB in the beginning and 27.5MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 521.06ms. Allocated memory is still 71.3MB. Free memory was 27.5MB in the beginning and 29.8MB in the end (delta: -2.3MB). Peak memory consumption was 15.8MB. Max. memory is 8.0GB. * TraceAbstraction took 236125.02ms. Allocated memory was 71.3MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 28.6MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 130]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 81]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 131]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 123]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 112]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 503 locations, 38 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 235.9s, OverallIterations: 34, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 227.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1622 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1622 mSDsluCounter, 1587 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 999 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3492 IncrementalHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 588 mSDtfsCounter, 3492 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2911 GetRequests, 2608 SyntacticMatches, 1 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166876occurred in iteration=34, InterpolantAutomatonStates: 256, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 7360 NumberOfCodeBlocks, 7014 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 8016 ConstructedInterpolants, 0 QuantifiedInterpolants, 14556 SizeOfPredicates, 39 NumberOfNonLiveVariables, 3298 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 51 InterpolantComputations, 29 PerfectInterpolantSequences, 1861/2149 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 02:31:34,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...