/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/parallel-misc-4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:35:58,046 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:35:58,165 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:35:58,194 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:35:58,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:35:58,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:35:58,195 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:35:58,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:35:58,196 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:35:58,197 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:35:58,197 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:35:58,197 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:35:58,198 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:35:58,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:35:58,471 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:35:58,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:35:58,477 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:35:58,478 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:35:58,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-03-15 02:35:59,693 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9200ed9/d487bee504ad4c20a0fe56b506977036/FLAG351152bdc [2025-03-15 02:35:59,902 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:35:59,903 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-4.wvr.c [2025-03-15 02:35:59,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9200ed9/d487bee504ad4c20a0fe56b506977036/FLAG351152bdc [2025-03-15 02:35:59,926 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc9200ed9/d487bee504ad4c20a0fe56b506977036 [2025-03-15 02:35:59,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:35:59,930 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:35:59,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:35:59,931 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:35:59,934 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:35:59,935 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:59" (1/1) ... [2025-03-15 02:35:59,935 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505ec86a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:59, skipping insertion in model container [2025-03-15 02:35:59,936 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:59" (1/1) ... [2025-03-15 02:35:59,949 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:36:00,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:36:00,088 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:36:00,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:36:00,118 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:36:00,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00 WrapperNode [2025-03-15 02:36:00,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:36:00,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:36:00,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:36:00,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:36:00,123 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:36:00" (1/1) ... [2025-03-15 02:36:00,129 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:36:00" (1/1) ... [2025-03-15 02:36:00,139 INFO L138 Inliner]: procedures = 19, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-03-15 02:36:00,139 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:36:00,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:36:00,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:36:00,140 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:36:00,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,146 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,146 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,148 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,149 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,152 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,152 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:36:00,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:36:00,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:36:00,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:36:00,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (1/1) ... [2025-03-15 02:36:00,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:36:00,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:00,183 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:36:00,189 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:36:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:36:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:36:00,206 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:36:00,206 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:36:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:36:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 02:36:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 02:36:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:36:00,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:36:00,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:36:00,208 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:36:00,272 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:36:00,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:36:00,432 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:36:00,432 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:36:00,460 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:36:00,460 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:36:00,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:36:00 BoogieIcfgContainer [2025-03-15 02:36:00,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:36:00,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:36:00,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:36:00,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:36:00,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:35:59" (1/3) ... [2025-03-15 02:36:00,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6861c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:36:00, skipping insertion in model container [2025-03-15 02:36:00,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:00" (2/3) ... [2025-03-15 02:36:00,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a6861c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:36:00, skipping insertion in model container [2025-03-15 02:36:00,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:36:00" (3/3) ... [2025-03-15 02:36:00,469 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-4.wvr.c [2025-03-15 02:36:00,481 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:36:00,483 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-4.wvr.c that has 4 procedures, 101 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-15 02:36:00,484 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:36:00,548 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-15 02:36:00,581 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:36:00,595 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;@21de411f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:36:00,595 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-15 02:36:00,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:36:00,633 INFO L124 PetriNetUnfolderBase]: 1/53 cut-off events. [2025-03-15 02:36:00,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:36:00,635 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:00,636 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:00,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:00,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash 261940048, now seen corresponding path program 1 times [2025-03-15 02:36:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564774587] [2025-03-15 02:36:00,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:00,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:00,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:00,918 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:36:00,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:00,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564774587] [2025-03-15 02:36:00,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564774587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:00,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:00,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:00,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310264551] [2025-03-15 02:36:00,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:00,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:00,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:00,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:00,948 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 105 [2025-03-15 02:36:00,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 231 flow. Second operand has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:36:00,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:00,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 105 [2025-03-15 02:36:00,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:01,149 INFO L124 PetriNetUnfolderBase]: 324/662 cut-off events. [2025-03-15 02:36:01,149 INFO L125 PetriNetUnfolderBase]: For 108/108 co-relation queries the response was YES. [2025-03-15 02:36:01,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1196 conditions, 662 events. 324/662 cut-off events. For 108/108 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3096 event pairs, 137 based on Foata normal form. 2/399 useless extension candidates. Maximal degree in co-relation 1079. Up to 428 conditions per place. [2025-03-15 02:36:01,167 INFO L140 encePairwiseOnDemand]: 98/105 looper letters, 19 selfloop transitions, 3 changer transitions 4/92 dead transitions. [2025-03-15 02:36:01,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 92 transitions, 250 flow [2025-03-15 02:36:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:01,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:01,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2025-03-15 02:36:01,177 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2025-03-15 02:36:01,180 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, -9 predicate places. [2025-03-15 02:36:01,181 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 92 transitions, 250 flow [2025-03-15 02:36:01,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.25) internal successors, (313), 4 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have 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:36:01,181 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:01,181 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:01,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:36:01,181 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:01,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:01,182 INFO L85 PathProgramCache]: Analyzing trace with hash 261940049, now seen corresponding path program 1 times [2025-03-15 02:36:01,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:01,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016628310] [2025-03-15 02:36:01,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:01,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:01,354 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:36:01,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:01,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016628310] [2025-03-15 02:36:01,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016628310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:01,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:01,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621353870] [2025-03-15 02:36:01,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:01,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:01,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:01,358 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:01,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 92 transitions, 250 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:36:01,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:01,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:01,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:01,538 INFO L124 PetriNetUnfolderBase]: 467/938 cut-off events. [2025-03-15 02:36:01,538 INFO L125 PetriNetUnfolderBase]: For 350/474 co-relation queries the response was YES. [2025-03-15 02:36:01,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2316 conditions, 938 events. 467/938 cut-off events. For 350/474 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4912 event pairs, 60 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 2125. Up to 612 conditions per place. [2025-03-15 02:36:01,546 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 24 selfloop transitions, 9 changer transitions 6/104 dead transitions. [2025-03-15 02:36:01,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 104 transitions, 389 flow [2025-03-15 02:36:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:36:01,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:36:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2025-03-15 02:36:01,549 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7942857142857143 [2025-03-15 02:36:01,549 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, -5 predicate places. [2025-03-15 02:36:01,549 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 104 transitions, 389 flow [2025-03-15 02:36:01,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:36:01,550 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:01,550 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:01,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:36:01,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:01,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:01,551 INFO L85 PathProgramCache]: Analyzing trace with hash 261940082, now seen corresponding path program 1 times [2025-03-15 02:36:01,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:01,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054069688] [2025-03-15 02:36:01,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:01,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:01,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:01,674 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:36:01,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:01,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054069688] [2025-03-15 02:36:01,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054069688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:01,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:01,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:01,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731402052] [2025-03-15 02:36:01,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:01,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:01,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:01,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:01,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:01,676 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2025-03-15 02:36:01,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 104 transitions, 389 flow. Second operand has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:36:01,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:01,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2025-03-15 02:36:01,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:01,862 INFO L124 PetriNetUnfolderBase]: 442/968 cut-off events. [2025-03-15 02:36:01,862 INFO L125 PetriNetUnfolderBase]: For 796/1062 co-relation queries the response was YES. [2025-03-15 02:36:01,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 968 events. 442/968 cut-off events. For 796/1062 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 5872 event pairs, 68 based on Foata normal form. 0/642 useless extension candidates. Maximal degree in co-relation 2385. Up to 570 conditions per place. [2025-03-15 02:36:01,871 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 45 selfloop transitions, 5 changer transitions 8/122 dead transitions. [2025-03-15 02:36:01,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 122 transitions, 627 flow [2025-03-15 02:36:01,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:36:01,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:36:01,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 406 transitions. [2025-03-15 02:36:01,873 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7733333333333333 [2025-03-15 02:36:01,875 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, -1 predicate places. [2025-03-15 02:36:01,875 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 122 transitions, 627 flow [2025-03-15 02:36:01,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.2) internal successors, (376), 5 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have 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:36:01,875 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:01,875 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:01,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:36:01,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:01,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:01,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836057, now seen corresponding path program 1 times [2025-03-15 02:36:01,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:01,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464270557] [2025-03-15 02:36:01,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:01,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:01,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:02,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:02,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:02,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464270557] [2025-03-15 02:36:02,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464270557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:02,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:02,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:02,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60382818] [2025-03-15 02:36:02,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:02,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:02,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:02,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:02,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:02,036 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2025-03-15 02:36:02,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 122 transitions, 627 flow. Second operand has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have 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:36:02,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:02,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2025-03-15 02:36:02,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:02,250 INFO L124 PetriNetUnfolderBase]: 520/1236 cut-off events. [2025-03-15 02:36:02,250 INFO L125 PetriNetUnfolderBase]: For 1773/2499 co-relation queries the response was YES. [2025-03-15 02:36:02,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4234 conditions, 1236 events. 520/1236 cut-off events. For 1773/2499 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 8053 event pairs, 98 based on Foata normal form. 13/861 useless extension candidates. Maximal degree in co-relation 3380. Up to 688 conditions per place. [2025-03-15 02:36:02,261 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 61 selfloop transitions, 5 changer transitions 10/145 dead transitions. [2025-03-15 02:36:02,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 145 transitions, 989 flow [2025-03-15 02:36:02,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:02,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2025-03-15 02:36:02,263 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2025-03-15 02:36:02,263 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 2 predicate places. [2025-03-15 02:36:02,263 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 145 transitions, 989 flow [2025-03-15 02:36:02,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.25) internal successors, (325), 4 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have 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:36:02,263 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:02,264 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:02,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:36:02,264 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:02,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836090, now seen corresponding path program 1 times [2025-03-15 02:36:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:02,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701144178] [2025-03-15 02:36:02,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:02,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:02,321 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:02,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:02,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701144178] [2025-03-15 02:36:02,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701144178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:02,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:02,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:02,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670474155] [2025-03-15 02:36:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:02,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:02,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:02,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:02,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:02,323 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 105 [2025-03-15 02:36:02,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 145 transitions, 989 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:36:02,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:02,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 105 [2025-03-15 02:36:02,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:02,547 INFO L124 PetriNetUnfolderBase]: 734/1771 cut-off events. [2025-03-15 02:36:02,547 INFO L125 PetriNetUnfolderBase]: For 3468/4804 co-relation queries the response was YES. [2025-03-15 02:36:02,552 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6867 conditions, 1771 events. 734/1771 cut-off events. For 3468/4804 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12661 event pairs, 79 based on Foata normal form. 28/1255 useless extension candidates. Maximal degree in co-relation 5535. Up to 948 conditions per place. [2025-03-15 02:36:02,561 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 81 selfloop transitions, 29 changer transitions 16/194 dead transitions. [2025-03-15 02:36:02,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 194 transitions, 1782 flow [2025-03-15 02:36:02,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:02,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:02,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 496 transitions. [2025-03-15 02:36:02,564 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7873015873015873 [2025-03-15 02:36:02,565 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 7 predicate places. [2025-03-15 02:36:02,565 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 194 transitions, 1782 flow [2025-03-15 02:36:02,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have 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:36:02,566 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:02,566 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:02,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:36:02,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:02,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:02,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836091, now seen corresponding path program 1 times [2025-03-15 02:36:02,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630520083] [2025-03-15 02:36:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:02,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:02,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630520083] [2025-03-15 02:36:02,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630520083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:02,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:02,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:36:02,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039254128] [2025-03-15 02:36:02,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:02,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:36:02,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:02,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:36:02,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:36:02,622 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2025-03-15 02:36:02,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 194 transitions, 1782 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:36:02,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:02,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2025-03-15 02:36:02,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:02,779 INFO L124 PetriNetUnfolderBase]: 568/1495 cut-off events. [2025-03-15 02:36:02,779 INFO L125 PetriNetUnfolderBase]: For 4708/6219 co-relation queries the response was YES. [2025-03-15 02:36:02,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6221 conditions, 1495 events. 568/1495 cut-off events. For 4708/6219 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10644 event pairs, 24 based on Foata normal form. 60/1163 useless extension candidates. Maximal degree in co-relation 4788. Up to 736 conditions per place. [2025-03-15 02:36:02,793 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 98 selfloop transitions, 9 changer transitions 18/197 dead transitions. [2025-03-15 02:36:02,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 197 transitions, 2075 flow [2025-03-15 02:36:02,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:36:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:36:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2025-03-15 02:36:02,795 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-15 02:36:02,796 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 7 predicate places. [2025-03-15 02:36:02,796 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 197 transitions, 2075 flow [2025-03-15 02:36:02,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have 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:36:02,796 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:02,796 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:02,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:36:02,796 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:02,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:02,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1552756238, now seen corresponding path program 1 times [2025-03-15 02:36:02,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:02,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502710167] [2025-03-15 02:36:02,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:02,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:02,889 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:36:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502710167] [2025-03-15 02:36:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502710167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:02,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:02,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:02,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160960321] [2025-03-15 02:36:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:02,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:02,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:02,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:02,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:02,891 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:02,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 197 transitions, 2075 flow. Second operand has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:36:02,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:02,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:02,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:03,134 INFO L124 PetriNetUnfolderBase]: 675/1689 cut-off events. [2025-03-15 02:36:03,134 INFO L125 PetriNetUnfolderBase]: For 7475/8229 co-relation queries the response was YES. [2025-03-15 02:36:03,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8222 conditions, 1689 events. 675/1689 cut-off events. For 7475/8229 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12068 event pairs, 48 based on Foata normal form. 43/1310 useless extension candidates. Maximal degree in co-relation 6297. Up to 879 conditions per place. [2025-03-15 02:36:03,151 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 111 selfloop transitions, 21 changer transitions 22/221 dead transitions. [2025-03-15 02:36:03,152 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 221 transitions, 2752 flow [2025-03-15 02:36:03,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:36:03,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:36:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 412 transitions. [2025-03-15 02:36:03,154 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7847619047619048 [2025-03-15 02:36:03,154 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 11 predicate places. [2025-03-15 02:36:03,154 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 221 transitions, 2752 flow [2025-03-15 02:36:03,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.2) internal successors, (386), 5 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:36:03,154 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:03,154 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:03,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:36:03,155 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:03,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1471052120, now seen corresponding path program 1 times [2025-03-15 02:36:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:03,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131106511] [2025-03-15 02:36:03,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:03,273 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:36:03,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:03,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131106511] [2025-03-15 02:36:03,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131106511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:03,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:03,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:03,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675456078] [2025-03-15 02:36:03,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:03,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:03,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:03,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:03,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:03,275 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:03,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 221 transitions, 2752 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:36:03,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:03,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:03,525 INFO L124 PetriNetUnfolderBase]: 750/1936 cut-off events. [2025-03-15 02:36:03,525 INFO L125 PetriNetUnfolderBase]: For 12484/13236 co-relation queries the response was YES. [2025-03-15 02:36:03,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10166 conditions, 1936 events. 750/1936 cut-off events. For 12484/13236 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14517 event pairs, 34 based on Foata normal form. 57/1532 useless extension candidates. Maximal degree in co-relation 7638. Up to 975 conditions per place. [2025-03-15 02:36:03,543 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 132 selfloop transitions, 38 changer transitions 30/267 dead transitions. [2025-03-15 02:36:03,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 267 transitions, 3931 flow [2025-03-15 02:36:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:03,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:03,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 498 transitions. [2025-03-15 02:36:03,545 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7904761904761904 [2025-03-15 02:36:03,546 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 16 predicate places. [2025-03-15 02:36:03,546 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 267 transitions, 3931 flow [2025-03-15 02:36:03,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:36:03,547 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:03,547 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:03,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:36:03,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:03,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:03,548 INFO L85 PathProgramCache]: Analyzing trace with hash 665660056, now seen corresponding path program 1 times [2025-03-15 02:36:03,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:03,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476689926] [2025-03-15 02:36:03,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:03,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:03,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:03,641 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:36:03,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:03,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476689926] [2025-03-15 02:36:03,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476689926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:03,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:03,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:03,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824096899] [2025-03-15 02:36:03,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:03,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:03,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:03,643 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:03,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 267 transitions, 3931 flow. Second operand has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:36:03,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:03,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:03,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:03,988 INFO L124 PetriNetUnfolderBase]: 1240/3158 cut-off events. [2025-03-15 02:36:03,988 INFO L125 PetriNetUnfolderBase]: For 25815/26418 co-relation queries the response was YES. [2025-03-15 02:36:03,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17974 conditions, 3158 events. 1240/3158 cut-off events. For 25815/26418 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 26042 event pairs, 19 based on Foata normal form. 120/2557 useless extension candidates. Maximal degree in co-relation 16415. Up to 1571 conditions per place. [2025-03-15 02:36:04,051 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 201 selfloop transitions, 85 changer transitions 54/407 dead transitions. [2025-03-15 02:36:04,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 407 transitions, 7281 flow [2025-03-15 02:36:04,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:04,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:04,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 501 transitions. [2025-03-15 02:36:04,053 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7952380952380952 [2025-03-15 02:36:04,054 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 21 predicate places. [2025-03-15 02:36:04,054 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 407 transitions, 7281 flow [2025-03-15 02:36:04,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.0) internal successors, (462), 6 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have 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:36:04,054 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:04,054 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:04,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:36:04,054 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:04,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:04,055 INFO L85 PathProgramCache]: Analyzing trace with hash 697939630, now seen corresponding path program 1 times [2025-03-15 02:36:04,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:04,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732815099] [2025-03-15 02:36:04,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:04,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:04,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:04,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732815099] [2025-03-15 02:36:04,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732815099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:04,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:04,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:04,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990499129] [2025-03-15 02:36:04,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:04,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:04,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:04,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:04,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:04,151 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2025-03-15 02:36:04,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 407 transitions, 7281 flow. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:04,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:04,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2025-03-15 02:36:04,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:04,799 INFO L124 PetriNetUnfolderBase]: 2083/5182 cut-off events. [2025-03-15 02:36:04,802 INFO L125 PetriNetUnfolderBase]: For 72877/75338 co-relation queries the response was YES. [2025-03-15 02:36:04,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32342 conditions, 5182 events. 2083/5182 cut-off events. For 72877/75338 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 49346 event pairs, 158 based on Foata normal form. 185/4406 useless extension candidates. Maximal degree in co-relation 27765. Up to 2541 conditions per place. [2025-03-15 02:36:04,898 INFO L140 encePairwiseOnDemand]: 100/105 looper letters, 391 selfloop transitions, 5 changer transitions 74/555 dead transitions. [2025-03-15 02:36:04,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 555 transitions, 11453 flow [2025-03-15 02:36:04,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:04,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:04,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 359 transitions. [2025-03-15 02:36:04,902 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8547619047619047 [2025-03-15 02:36:04,903 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 24 predicate places. [2025-03-15 02:36:04,904 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 555 transitions, 11453 flow [2025-03-15 02:36:04,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 4 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:04,904 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:04,904 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:04,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:36:04,905 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:04,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:04,906 INFO L85 PathProgramCache]: Analyzing trace with hash -550551934, now seen corresponding path program 1 times [2025-03-15 02:36:04,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:04,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348866241] [2025-03-15 02:36:04,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:04,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348866241] [2025-03-15 02:36:05,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348866241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:05,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:05,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:05,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725563737] [2025-03-15 02:36:05,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:05,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:05,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:05,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:05,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:05,012 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 105 [2025-03-15 02:36:05,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 555 transitions, 11453 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:36:05,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:05,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 105 [2025-03-15 02:36:05,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:05,698 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([271] L43-->thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (and (<= 0 (+ 2147483649 |v_thread1Thread1of1ForFork2_#t~post1_3|)) (= |v_thread1Thread1of1ForFork2_#t~post1_3| v_~pos~0_65) (< 2147483646 |v_thread1Thread1of1ForFork2_#t~post1_3|)) InVars {~pos~0=v_~pos~0_65} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_3|, ~pos~0=v_~pos~0_65} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1][318], [130#(<= 1 (mod ~d1~0 256)), 164#true, 104#L88-4true, 148#(<= ~pos~0 2147483647), thread2Thread1of1ForFork0InUse, 153#(<= 0 ~pos~0), 174#(= (mod ~d2~0 256) 0), thread3Thread1of1ForFork1InUse, 87#thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 81#L69-1true, 119#true, thread1Thread1of1ForFork2InUse, 34#L60true, 116#(<= 0 (+ ~pos~0 2147483648)), 156#true, 179#(and (<= (mod ~d2~0 256) 0) (<= 0 ~d2~0)), 141#(<= 0 (+ 2147483647 ~pos~0)), 135#(not (= (mod ~d1~0 256) 0))]) [2025-03-15 02:36:05,698 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 02:36:05,698 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,698 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([272] L43-->L43-4: Formula: (and (<= 0 (+ 2147483649 |v_thread1Thread1of1ForFork2_#t~post1_5|)) (= |v_thread1Thread1of1ForFork2_#t~post1_5| v_~pos~0_68) (= v_~pos~0_67 (+ |v_thread1Thread1of1ForFork2_#t~post1_5| 1)) (<= |v_thread1Thread1of1ForFork2_#t~post1_5| 2147483646)) InVars {~pos~0=v_~pos~0_68} OutVars{thread1Thread1of1ForFork2_#t~post1=|v_thread1Thread1of1ForFork2_#t~post1_5|, ~pos~0=v_~pos~0_67} AuxVars[] AssignedVars[thread1Thread1of1ForFork2_#t~post1, ~pos~0][319], [130#(<= 1 (mod ~d1~0 256)), 32#L43-4true, 164#true, 104#L88-4true, 148#(<= ~pos~0 2147483647), 149#true, thread2Thread1of1ForFork0InUse, thread3Thread1of1ForFork1InUse, 174#(= (mod ~d2~0 256) 0), 81#L69-1true, 119#true, thread1Thread1of1ForFork2InUse, 34#L60true, 116#(<= 0 (+ ~pos~0 2147483648)), 156#true, 179#(and (<= (mod ~d2~0 256) 0) (<= 0 ~d2~0)), 141#(<= 0 (+ 2147483647 ~pos~0)), 135#(not (= (mod ~d1~0 256) 0))]) [2025-03-15 02:36:05,699 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([289] L60-->thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~pos~0_53 2147483646) 0) InVars {~pos~0=v_~pos~0_53} OutVars{~pos~0=v_~pos~0_53} AuxVars[] AssignedVars[][272], [130#(<= 1 (mod ~d1~0 256)), 26#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 104#L88-4true, 148#(<= ~pos~0 2147483647), thread2Thread1of1ForFork0InUse, 149#true, thread3Thread1of1ForFork1InUse, 174#(= (mod ~d2~0 256) 0), 81#L69-1true, thread1Thread1of1ForFork2InUse, 116#(<= 0 (+ ~pos~0 2147483648)), 179#(and (<= (mod ~d2~0 256) 0) (<= 0 ~d2~0)), 141#(<= 0 (+ 2147483647 ~pos~0)), 160#(<= ~pos~0 0), 123#(<= ~pos~0 0), 135#(not (= (mod ~d1~0 256) 0)), 103#L43true, 168#(<= ~pos~0 0)]) [2025-03-15 02:36:05,699 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([291] L60-->L60-4: Formula: (and (= (+ 2 v_~pos~0_57) v_~pos~0_58) (<= 0 (+ v_~pos~0_58 2147483646)) (<= v_~pos~0_58 2147483649)) InVars {~pos~0=v_~pos~0_58} OutVars{~pos~0=v_~pos~0_57} AuxVars[] AssignedVars[~pos~0][273], [130#(<= 1 (mod ~d1~0 256)), 164#true, 104#L88-4true, 148#(<= ~pos~0 2147483647), 149#true, thread2Thread1of1ForFork0InUse, 174#(= (mod ~d2~0 256) 0), thread3Thread1of1ForFork1InUse, 81#L69-1true, thread1Thread1of1ForFork2InUse, 119#true, 116#(<= 0 (+ ~pos~0 2147483648)), 25#L60-4true, 140#(<= 0 (+ ~pos~0 2147483648)), 179#(and (<= (mod ~d2~0 256) 0) (<= 0 ~d2~0)), 156#true, 135#(not (= (mod ~d1~0 256) 0)), 103#L43true]) [2025-03-15 02:36:05,699 INFO L294 olderBase$Statistics]: this new event has 80 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,699 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,700 INFO L297 olderBase$Statistics]: existing Event has 76 ancestors and is cut-off event [2025-03-15 02:36:05,814 INFO L124 PetriNetUnfolderBase]: 1741/4678 cut-off events. [2025-03-15 02:36:05,814 INFO L125 PetriNetUnfolderBase]: For 70845/73913 co-relation queries the response was YES. [2025-03-15 02:36:05,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30661 conditions, 4678 events. 1741/4678 cut-off events. For 70845/73913 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 45397 event pairs, 73 based on Foata normal form. 363/4363 useless extension candidates. Maximal degree in co-relation 22824. Up to 2195 conditions per place. [2025-03-15 02:36:05,911 INFO L140 encePairwiseOnDemand]: 101/105 looper letters, 452 selfloop transitions, 7 changer transitions 68/612 dead transitions. [2025-03-15 02:36:05,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 612 transitions, 13868 flow [2025-03-15 02:36:05,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:05,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2025-03-15 02:36:05,913 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8523809523809524 [2025-03-15 02:36:05,913 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 27 predicate places. [2025-03-15 02:36:05,913 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 612 transitions, 13868 flow [2025-03-15 02:36:05,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:36:05,914 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:05,914 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:05,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:36:05,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:05,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:05,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1037517240, now seen corresponding path program 1 times [2025-03-15 02:36:05,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:05,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154641354] [2025-03-15 02:36:05,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:05,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:05,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154641354] [2025-03-15 02:36:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154641354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:05,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:05,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:05,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089325883] [2025-03-15 02:36:05,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:05,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:05,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:05,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:05,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:05,962 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2025-03-15 02:36:05,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 612 transitions, 13868 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have 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:36:05,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:05,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2025-03-15 02:36:05,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:06,573 INFO L124 PetriNetUnfolderBase]: 1777/4855 cut-off events. [2025-03-15 02:36:06,573 INFO L125 PetriNetUnfolderBase]: For 88659/91331 co-relation queries the response was YES. [2025-03-15 02:36:06,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33611 conditions, 4855 events. 1777/4855 cut-off events. For 88659/91331 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 47707 event pairs, 65 based on Foata normal form. 125/4339 useless extension candidates. Maximal degree in co-relation 24666. Up to 2236 conditions per place. [2025-03-15 02:36:06,629 INFO L140 encePairwiseOnDemand]: 96/105 looper letters, 393 selfloop transitions, 77 changer transitions 102/651 dead transitions. [2025-03-15 02:36:06,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 651 transitions, 16007 flow [2025-03-15 02:36:06,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:06,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2025-03-15 02:36:06,631 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8642857142857143 [2025-03-15 02:36:06,631 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 30 predicate places. [2025-03-15 02:36:06,631 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 651 transitions, 16007 flow [2025-03-15 02:36:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have 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:36:06,631 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:06,632 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:06,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 02:36:06,632 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:06,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:06,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1741102813, now seen corresponding path program 1 times [2025-03-15 02:36:06,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:06,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446206173] [2025-03-15 02:36:06,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:06,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:06,775 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:36:06,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:06,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446206173] [2025-03-15 02:36:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446206173] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:06,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454588225] [2025-03-15 02:36:06,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:06,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:06,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:06,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:06,776 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:06,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 651 transitions, 16007 flow. Second operand has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:36:06,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:06,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:06,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:07,516 INFO L124 PetriNetUnfolderBase]: 1797/4858 cut-off events. [2025-03-15 02:36:07,517 INFO L125 PetriNetUnfolderBase]: For 110905/114279 co-relation queries the response was YES. [2025-03-15 02:36:07,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36101 conditions, 4858 events. 1797/4858 cut-off events. For 110905/114279 co-relation queries the response was YES. Maximal size of possible extension queue 345. Compared 47058 event pairs, 86 based on Foata normal form. 183/4390 useless extension candidates. Maximal degree in co-relation 26437. Up to 2252 conditions per place. [2025-03-15 02:36:07,564 INFO L140 encePairwiseOnDemand]: 93/105 looper letters, 431 selfloop transitions, 85 changer transitions 103/693 dead transitions. [2025-03-15 02:36:07,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 693 transitions, 18362 flow [2025-03-15 02:36:07,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:07,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:07,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 497 transitions. [2025-03-15 02:36:07,566 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7888888888888889 [2025-03-15 02:36:07,566 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 35 predicate places. [2025-03-15 02:36:07,566 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 693 transitions, 18362 flow [2025-03-15 02:36:07,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.16666666666667) internal successors, (463), 6 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have 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:36:07,567 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:07,567 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:07,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 02:36:07,567 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:07,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:07,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1592986127, now seen corresponding path program 1 times [2025-03-15 02:36:07,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:07,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628733267] [2025-03-15 02:36:07,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:07,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:07,740 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:36:07,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:07,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628733267] [2025-03-15 02:36:07,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628733267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:07,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:07,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:36:07,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542560128] [2025-03-15 02:36:07,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:07,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:07,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:07,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:07,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:07,742 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 105 [2025-03-15 02:36:07,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 693 transitions, 18362 flow. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have 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:36:07,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:07,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 105 [2025-03-15 02:36:07,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:08,793 INFO L124 PetriNetUnfolderBase]: 2219/5913 cut-off events. [2025-03-15 02:36:08,793 INFO L125 PetriNetUnfolderBase]: For 110450/111251 co-relation queries the response was YES. [2025-03-15 02:36:08,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41837 conditions, 5913 events. 2219/5913 cut-off events. For 110450/111251 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 59264 event pairs, 149 based on Foata normal form. 42/5243 useless extension candidates. Maximal degree in co-relation 39169. Up to 2776 conditions per place. [2025-03-15 02:36:08,859 INFO L140 encePairwiseOnDemand]: 95/105 looper letters, 632 selfloop transitions, 15 changer transitions 102/831 dead transitions. [2025-03-15 02:36:08,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 831 transitions, 23516 flow [2025-03-15 02:36:08,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:08,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 465 transitions. [2025-03-15 02:36:08,861 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7380952380952381 [2025-03-15 02:36:08,861 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 40 predicate places. [2025-03-15 02:36:08,861 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 831 transitions, 23516 flow [2025-03-15 02:36:08,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have 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:36:08,861 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:08,861 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:08,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 02:36:08,861 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:08,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:08,862 INFO L85 PathProgramCache]: Analyzing trace with hash -1005696335, now seen corresponding path program 2 times [2025-03-15 02:36:08,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:08,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033821486] [2025-03-15 02:36:08,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:08,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:08,876 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:36:08,876 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-15 02:36:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033821486] [2025-03-15 02:36:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033821486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:36:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445582852] [2025-03-15 02:36:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:08,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:08,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:08,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:08,952 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 105 [2025-03-15 02:36:08,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 831 transitions, 23516 flow. Second operand has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:36:08,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:08,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 105 [2025-03-15 02:36:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:09,613 INFO L124 PetriNetUnfolderBase]: 1343/3720 cut-off events. [2025-03-15 02:36:09,613 INFO L125 PetriNetUnfolderBase]: For 75104/75468 co-relation queries the response was YES. [2025-03-15 02:36:09,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28256 conditions, 3720 events. 1343/3720 cut-off events. For 75104/75468 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 33896 event pairs, 85 based on Foata normal form. 14/3304 useless extension candidates. Maximal degree in co-relation 26256. Up to 1733 conditions per place. [2025-03-15 02:36:09,642 INFO L140 encePairwiseOnDemand]: 99/105 looper letters, 449 selfloop transitions, 10 changer transitions 58/609 dead transitions. [2025-03-15 02:36:09,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 609 transitions, 17686 flow [2025-03-15 02:36:09,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:36:09,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:36:09,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 402 transitions. [2025-03-15 02:36:09,644 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7657142857142857 [2025-03-15 02:36:09,644 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 44 predicate places. [2025-03-15 02:36:09,644 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 609 transitions, 17686 flow [2025-03-15 02:36:09,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.8) internal successors, (379), 5 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:36:09,644 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:09,644 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:09,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 02:36:09,644 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:09,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:09,645 INFO L85 PathProgramCache]: Analyzing trace with hash 434618606, now seen corresponding path program 1 times [2025-03-15 02:36:09,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:09,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859751028] [2025-03-15 02:36:09,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:09,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:09,678 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:09,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:09,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859751028] [2025-03-15 02:36:09,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859751028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:09,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:09,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:09,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412412121] [2025-03-15 02:36:09,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:09,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:09,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:09,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:09,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:09,680 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2025-03-15 02:36:09,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 609 transitions, 17686 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:36:09,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:09,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2025-03-15 02:36:09,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:10,163 INFO L124 PetriNetUnfolderBase]: 1380/3856 cut-off events. [2025-03-15 02:36:10,163 INFO L125 PetriNetUnfolderBase]: For 91195/91787 co-relation queries the response was YES. [2025-03-15 02:36:10,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30505 conditions, 3856 events. 1380/3856 cut-off events. For 91195/91787 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 35116 event pairs, 91 based on Foata normal form. 18/3439 useless extension candidates. Maximal degree in co-relation 28321. Up to 1800 conditions per place. [2025-03-15 02:36:10,198 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 381 selfloop transitions, 62 changer transitions 102/634 dead transitions. [2025-03-15 02:36:10,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 634 transitions, 19611 flow [2025-03-15 02:36:10,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2025-03-15 02:36:10,199 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-03-15 02:36:10,200 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 47 predicate places. [2025-03-15 02:36:10,200 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 634 transitions, 19611 flow [2025-03-15 02:36:10,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:36:10,200 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:10,200 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-15 02:36:10,200 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:10,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:10,200 INFO L85 PathProgramCache]: Analyzing trace with hash -920185673, now seen corresponding path program 1 times [2025-03-15 02:36:10,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411617431] [2025-03-15 02:36:10,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:10,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:10,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:10,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:10,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411617431] [2025-03-15 02:36:10,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411617431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:10,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:10,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:10,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281939433] [2025-03-15 02:36:10,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:10,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:10,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:10,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:10,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:10,233 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2025-03-15 02:36:10,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 634 transitions, 19611 flow. Second operand has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:36:10,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:10,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2025-03-15 02:36:10,234 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:10,780 INFO L124 PetriNetUnfolderBase]: 1339/3794 cut-off events. [2025-03-15 02:36:10,780 INFO L125 PetriNetUnfolderBase]: For 104236/104662 co-relation queries the response was YES. [2025-03-15 02:36:10,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31013 conditions, 3794 events. 1339/3794 cut-off events. For 104236/104662 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 34765 event pairs, 88 based on Foata normal form. 18/3419 useless extension candidates. Maximal degree in co-relation 28711. Up to 1753 conditions per place. [2025-03-15 02:36:10,817 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 311 selfloop transitions, 125 changer transitions 102/627 dead transitions. [2025-03-15 02:36:10,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 627 transitions, 20439 flow [2025-03-15 02:36:10,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:10,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 363 transitions. [2025-03-15 02:36:10,818 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8642857142857143 [2025-03-15 02:36:10,818 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 50 predicate places. [2025-03-15 02:36:10,818 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 627 transitions, 20439 flow [2025-03-15 02:36:10,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.25) internal successors, (333), 4 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:36:10,819 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:10,819 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:10,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-15 02:36:10,819 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:10,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1648710167, now seen corresponding path program 1 times [2025-03-15 02:36:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546667805] [2025-03-15 02:36:10,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:10,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:10,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:10,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546667805] [2025-03-15 02:36:10,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546667805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:10,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085193355] [2025-03-15 02:36:10,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:10,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:10,872 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:36:10,874 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:36:10,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:10,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:36:10,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:10,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:10,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:11,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:11,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085193355] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:11,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:11,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-15 02:36:11,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119278943] [2025-03-15 02:36:11,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:11,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:11,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:11,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:11,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:11,067 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 105 [2025-03-15 02:36:11,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 627 transitions, 20439 flow. Second operand has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:36:11,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:11,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 105 [2025-03-15 02:36:11,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:11,786 INFO L124 PetriNetUnfolderBase]: 1653/4654 cut-off events. [2025-03-15 02:36:11,786 INFO L125 PetriNetUnfolderBase]: For 146514/147850 co-relation queries the response was YES. [2025-03-15 02:36:11,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39788 conditions, 4654 events. 1653/4654 cut-off events. For 146514/147850 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 44556 event pairs, 123 based on Foata normal form. 72/4253 useless extension candidates. Maximal degree in co-relation 30954. Up to 2173 conditions per place. [2025-03-15 02:36:11,834 INFO L140 encePairwiseOnDemand]: 94/105 looper letters, 363 selfloop transitions, 180 changer transitions 123/751 dead transitions. [2025-03-15 02:36:11,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 751 transitions, 26384 flow [2025-03-15 02:36:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:36:11,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:36:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 575 transitions. [2025-03-15 02:36:11,843 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.782312925170068 [2025-03-15 02:36:11,843 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 56 predicate places. [2025-03-15 02:36:11,843 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 751 transitions, 26384 flow [2025-03-15 02:36:11,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.16666666666667) internal successors, (469), 6 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have 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:36:11,844 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:11,844 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:11,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 02:36:12,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-15 02:36:12,046 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:12,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:12,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2079461207, now seen corresponding path program 2 times [2025-03-15 02:36:12,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:12,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005268989] [2025-03-15 02:36:12,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:12,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:12,061 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:36:12,061 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:12,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005268989] [2025-03-15 02:36:12,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005268989] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:12,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624248247] [2025-03-15 02:36:12,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:12,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:12,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:12,167 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:36:12,169 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:36:12,215 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:36:12,216 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:12,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-15 02:36:12,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:12,304 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:12,304 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:12,394 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:12,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624248247] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:12,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:12,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2025-03-15 02:36:12,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927961758] [2025-03-15 02:36:12,395 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:12,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-15 02:36:12,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:12,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-15 02:36:12,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2025-03-15 02:36:12,396 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 105 [2025-03-15 02:36:12,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 751 transitions, 26384 flow. Second operand has 13 states, 13 states have (on average 72.53846153846153) internal successors, (943), 13 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have 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:36:12,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:12,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 105 [2025-03-15 02:36:12,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:13,021 INFO L124 PetriNetUnfolderBase]: 1534/4261 cut-off events. [2025-03-15 02:36:13,021 INFO L125 PetriNetUnfolderBase]: For 155488/156119 co-relation queries the response was YES. [2025-03-15 02:36:13,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37584 conditions, 4261 events. 1534/4261 cut-off events. For 155488/156119 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 40317 event pairs, 122 based on Foata normal form. 31/3909 useless extension candidates. Maximal degree in co-relation 34638. Up to 2007 conditions per place. [2025-03-15 02:36:13,136 INFO L140 encePairwiseOnDemand]: 90/105 looper letters, 306 selfloop transitions, 213 changer transitions 129/728 dead transitions. [2025-03-15 02:36:13,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 728 transitions, 26819 flow [2025-03-15 02:36:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 02:36:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 02:36:13,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 821 transitions. [2025-03-15 02:36:13,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7108225108225108 [2025-03-15 02:36:13,139 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 64 predicate places. [2025-03-15 02:36:13,139 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 728 transitions, 26819 flow [2025-03-15 02:36:13,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 72.53846153846153) internal successors, (943), 13 states have internal predecessors, (943), 0 states have call successors, (0), 0 states have 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:36:13,139 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:13,139 INFO L221 CegarLoopForPetriNet]: trace histogram [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] [2025-03-15 02:36:13,145 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:36:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:13,344 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:13,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:13,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1513110537, now seen corresponding path program 2 times [2025-03-15 02:36:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282525008] [2025-03-15 02:36:13,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:13,359 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:36:13,359 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:13,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:13,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282525008] [2025-03-15 02:36:13,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282525008] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:13,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561647569] [2025-03-15 02:36:13,451 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:36:13,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:13,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:13,453 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:36:13,455 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:36:13,495 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-15 02:36:13,496 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:36:13,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:36:13,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:13,614 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:13,614 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:13,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561647569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:13,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:13,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 14 [2025-03-15 02:36:13,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754503345] [2025-03-15 02:36:13,703 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:13,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-15 02:36:13,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:13,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-15 02:36:13,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-15 02:36:13,704 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 105 [2025-03-15 02:36:13,705 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 728 transitions, 26819 flow. Second operand has 15 states, 15 states have (on average 77.33333333333333) internal successors, (1160), 15 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have 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:36:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 105 [2025-03-15 02:36:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:15,009 INFO L124 PetriNetUnfolderBase]: 2633/7372 cut-off events. [2025-03-15 02:36:15,009 INFO L125 PetriNetUnfolderBase]: For 301681/302632 co-relation queries the response was YES. [2025-03-15 02:36:15,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65821 conditions, 7372 events. 2633/7372 cut-off events. For 301681/302632 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 74057 event pairs, 267 based on Foata normal form. 61/6801 useless extension candidates. Maximal degree in co-relation 50636. Up to 3530 conditions per place. [2025-03-15 02:36:15,105 INFO L140 encePairwiseOnDemand]: 92/105 looper letters, 651 selfloop transitions, 180 changer transitions 217/1132 dead transitions. [2025-03-15 02:36:15,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 1132 transitions, 45529 flow [2025-03-15 02:36:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 02:36:15,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 02:36:15,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1059 transitions. [2025-03-15 02:36:15,107 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7758241758241758 [2025-03-15 02:36:15,108 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 76 predicate places. [2025-03-15 02:36:15,108 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 1132 transitions, 45529 flow [2025-03-15 02:36:15,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 77.33333333333333) internal successors, (1160), 15 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have 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:36:15,108 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:15,108 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 3, 3, 3, 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] [2025-03-15 02:36:15,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 02:36:15,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:15,309 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-15 02:36:15,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:15,310 INFO L85 PathProgramCache]: Analyzing trace with hash 2070078230, now seen corresponding path program 1 times [2025-03-15 02:36:15,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:15,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857537441] [2025-03-15 02:36:15,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:15,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:15,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 02:36:15,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:15,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857537441] [2025-03-15 02:36:15,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857537441] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:36:15,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418285215] [2025-03-15 02:36:15,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:15,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:15,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:15,415 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:36:15,416 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:36:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:15,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-15 02:36:15,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:36:15,509 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 02:36:15,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:36:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-15 02:36:15,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418285215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:36:15,573 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:36:15,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-03-15 02:36:15,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566134020] [2025-03-15 02:36:15,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:36:15,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:36:15,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:15,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:36:15,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:36:15,576 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 105 [2025-03-15 02:36:15,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 1132 transitions, 45529 flow. Second operand has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have 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:36:15,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:15,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 105 [2025-03-15 02:36:15,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:16,809 INFO L124 PetriNetUnfolderBase]: 2546/7141 cut-off events. [2025-03-15 02:36:16,810 INFO L125 PetriNetUnfolderBase]: For 330175/330682 co-relation queries the response was YES. [2025-03-15 02:36:16,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65363 conditions, 7141 events. 2546/7141 cut-off events. For 330175/330682 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 72445 event pairs, 259 based on Foata normal form. 19/6577 useless extension candidates. Maximal degree in co-relation 60411. Up to 3398 conditions per place. [2025-03-15 02:36:16,881 INFO L140 encePairwiseOnDemand]: 97/105 looper letters, 0 selfloop transitions, 0 changer transitions 1088/1088 dead transitions. [2025-03-15 02:36:16,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 1088 transitions, 45666 flow [2025-03-15 02:36:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:36:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:36:16,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 536 transitions. [2025-03-15 02:36:16,882 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8507936507936508 [2025-03-15 02:36:16,882 INFO L298 CegarLoopForPetriNet]: 110 programPoint places, 79 predicate places. [2025-03-15 02:36:16,882 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 1088 transitions, 45666 flow [2025-03-15 02:36:16,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.5) internal successors, (501), 6 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have 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:36:16,887 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-misc-4.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 19 remaining) [2025-03-15 02:36:16,916 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-15 02:36:16,917 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-15 02:36:16,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 02:36:17,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:36:17,120 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:36:17,125 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:36:17,125 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:36:17,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:36:17 BasicIcfg [2025-03-15 02:36:17,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:36:17,130 INFO L158 Benchmark]: Toolchain (without parser) took 17200.85ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 44.8MB in the beginning and 406.7MB in the end (delta: -361.8MB). Peak memory consumption was 746.7MB. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: CDTParser took 1.33ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.89ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 33.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.05ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 32.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: Boogie Preprocessor took 13.79ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 31.0MB in the end (delta: 952.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: RCFGBuilder took 306.52ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 41.8MB in the end (delta: -10.8MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2025-03-15 02:36:17,131 INFO L158 Benchmark]: TraceAbstraction took 16667.04ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 40.9MB in the beginning and 406.7MB in the end (delta: -365.8MB). Peak memory consumption was 740.0MB. Max. memory is 8.0GB. [2025-03-15 02:36:17,132 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.33ms. Allocated memory is still 71.3MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 187.89ms. Allocated memory is still 71.3MB. Free memory was 44.7MB in the beginning and 33.2MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.05ms. Allocated memory is still 71.3MB. Free memory was 33.2MB in the beginning and 32.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 13.79ms. Allocated memory is still 71.3MB. Free memory was 32.0MB in the beginning and 31.0MB in the end (delta: 952.1kB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 306.52ms. Allocated memory is still 71.3MB. Free memory was 31.0MB in the beginning and 41.8MB in the end (delta: -10.8MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * TraceAbstraction took 16667.04ms. Allocated memory was 71.3MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 40.9MB in the beginning and 406.7MB in the end (delta: -365.8MB). Peak memory consumption was 740.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 137 locations, 19 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: 16.5s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 592 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 592 mSDsluCounter, 157 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1674 IncrementalHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 116 mSDtfsCounter, 1674 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 680 GetRequests, 565 SyntacticMatches, 17 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45666occurred in iteration=21, InterpolantAutomatonStates: 118, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1495 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1750 ConstructedInterpolants, 0 QuantifiedInterpolants, 4290 SizeOfPredicates, 15 NumberOfNonLiveVariables, 587 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 29 InterpolantComputations, 17 PerfectInterpolantSequences, 107/122 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 02:36:17,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...