/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:54:00,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:54:00,170 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:54:00,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:54:00,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:54:00,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:54:00,197 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:54:00,198 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:54:00,198 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:54:00,199 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:54:00,199 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:54:00,199 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:54:00,199 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:54:00,199 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:54:00,200 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:54:00,200 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:00,201 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:54:00,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:54:00,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:54:00,437 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:54:00,442 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:54:00,444 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:54:00,445 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:54:00,445 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:54:00,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i [2025-03-15 01:54:01,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e165d4a3/b20500b014714b16ad55aabf38b67acb/FLAG320d2fac9 [2025-03-15 01:54:01,913 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:54:01,914 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_12-ptr_nr.i [2025-03-15 01:54:01,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e165d4a3/b20500b014714b16ad55aabf38b67acb/FLAG320d2fac9 [2025-03-15 01:54:01,945 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e165d4a3/b20500b014714b16ad55aabf38b67acb [2025-03-15 01:54:01,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:54:01,949 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:54:01,952 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:01,952 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:54:01,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:54:01,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:01" (1/1) ... [2025-03-15 01:54:01,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c199d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:01, skipping insertion in model container [2025-03-15 01:54:01,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:01" (1/1) ... [2025-03-15 01:54:01,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:54:02,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:02,300 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:54:02,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:02,412 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:54:02,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02 WrapperNode [2025-03-15 01:54:02,412 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:02,414 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:02,414 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:54:02,414 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:54:02,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,430 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,449 INFO L138 Inliner]: procedures = 262, calls = 19, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 90 [2025-03-15 01:54:02,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:02,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:54:02,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:54:02,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:54:02,456 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,459 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,459 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,465 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,466 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,473 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:54:02,478 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:54:02,478 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:54:02,478 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:54:02,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (1/1) ... [2025-03-15 01:54:02,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:02,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:02,510 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:54:02,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:54:02,530 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:54:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:54:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:54:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:54:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:54:02,531 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:54:02,531 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:54:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:54:02,532 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:54:02,532 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:54:02,533 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:54:02,620 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:54:02,621 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:54:02,771 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:54:02,771 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:54:02,794 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:54:02,794 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:54:02,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:02 BoogieIcfgContainer [2025-03-15 01:54:02,794 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:54:02,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:54:02,796 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:54:02,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:54:02,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:54:01" (1/3) ... [2025-03-15 01:54:02,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6fb788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:02, skipping insertion in model container [2025-03-15 01:54:02,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:02" (2/3) ... [2025-03-15 01:54:02,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e6fb788 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:02, skipping insertion in model container [2025-03-15 01:54:02,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:02" (3/3) ... [2025-03-15 01:54:02,804 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_12-ptr_nr.i [2025-03-15 01:54:02,816 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:54:02,817 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_12-ptr_nr.i that has 2 procedures, 111 locations, 1 initial locations, 0 loop locations, and 4 error locations. [2025-03-15 01:54:02,817 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:02,875 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-15 01:54:02,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:02,923 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;@6c4a2dae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:02,923 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-03-15 01:54:02,956 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:02,957 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2025-03-15 01:54:02,959 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:02,959 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:02,960 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:02,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:02,965 INFO L85 PathProgramCache]: Analyzing trace with hash -345129914, now seen corresponding path program 1 times [2025-03-15 01:54:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585066480] [2025-03-15 01:54:02,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:03,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:03,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:03,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:03,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585066480] [2025-03-15 01:54:03,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585066480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:03,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:03,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:54:03,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172572295] [2025-03-15 01:54:03,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:03,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:54:03,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:03,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:54:03,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:54:03,435 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 110 [2025-03-15 01:54:03,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 110 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:03,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:03,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 110 [2025-03-15 01:54:03,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:03,625 INFO L124 PetriNetUnfolderBase]: 38/216 cut-off events. [2025-03-15 01:54:03,626 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-15 01:54:03,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 325 conditions, 216 events. 38/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 570 event pairs, 7 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 229. Up to 51 conditions per place. [2025-03-15 01:54:03,631 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 28 selfloop transitions, 7 changer transitions 15/132 dead transitions. [2025-03-15 01:54:03,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 132 transitions, 362 flow [2025-03-15 01:54:03,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:54:03,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:54:03,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 572 transitions. [2025-03-15 01:54:03,646 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-03-15 01:54:03,648 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 4 predicate places. [2025-03-15 01:54:03,648 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 132 transitions, 362 flow [2025-03-15 01:54:03,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 89.4) internal successors, (447), 5 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:03,649 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:03,649 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:03,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:03,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:03,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:03,650 INFO L85 PathProgramCache]: Analyzing trace with hash -674992744, now seen corresponding path program 1 times [2025-03-15 01:54:03,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:03,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644027930] [2025-03-15 01:54:03,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:03,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:03,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644027930] [2025-03-15 01:54:03,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644027930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:03,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:03,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:03,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478498473] [2025-03-15 01:54:03,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:03,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:03,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:03,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:03,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:03,802 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 110 [2025-03-15 01:54:03,804 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 132 transitions, 362 flow. Second operand has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:03,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:03,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 110 [2025-03-15 01:54:03,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:03,932 INFO L124 PetriNetUnfolderBase]: 63/286 cut-off events. [2025-03-15 01:54:03,932 INFO L125 PetriNetUnfolderBase]: For 45/50 co-relation queries the response was YES. [2025-03-15 01:54:03,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 571 conditions, 286 events. 63/286 cut-off events. For 45/50 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 957 event pairs, 12 based on Foata normal form. 5/283 useless extension candidates. Maximal degree in co-relation 463. Up to 73 conditions per place. [2025-03-15 01:54:03,934 INFO L140 encePairwiseOnDemand]: 103/110 looper letters, 33 selfloop transitions, 7 changer transitions 27/149 dead transitions. [2025-03-15 01:54:03,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 149 transitions, 540 flow [2025-03-15 01:54:03,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:03,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:03,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2025-03-15 01:54:03,935 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8654545454545455 [2025-03-15 01:54:03,936 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 8 predicate places. [2025-03-15 01:54:03,936 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 149 transitions, 540 flow [2025-03-15 01:54:03,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.0) internal successors, (352), 4 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:03,936 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:03,936 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:03,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:54:03,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:03,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:03,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1906873507, now seen corresponding path program 1 times [2025-03-15 01:54:03,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:03,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939911840] [2025-03-15 01:54:03,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:03,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:04,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939911840] [2025-03-15 01:54:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939911840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:04,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345484979] [2025-03-15 01:54:04,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:04,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 01:54:04,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:04,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 01:54:04,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 01:54:04,087 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 110 [2025-03-15 01:54:04,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 149 transitions, 540 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:04,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 110 [2025-03-15 01:54:04,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:04,129 INFO L124 PetriNetUnfolderBase]: 8/143 cut-off events. [2025-03-15 01:54:04,129 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-03-15 01:54:04,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 143 events. 8/143 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 125 event pairs, 0 based on Foata normal form. 12/151 useless extension candidates. Maximal degree in co-relation 147. Up to 25 conditions per place. [2025-03-15 01:54:04,130 INFO L140 encePairwiseOnDemand]: 106/110 looper letters, 7 selfloop transitions, 7 changer transitions 11/127 dead transitions. [2025-03-15 01:54:04,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 127 transitions, 446 flow [2025-03-15 01:54:04,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 01:54:04,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 01:54:04,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2025-03-15 01:54:04,132 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9333333333333333 [2025-03-15 01:54:04,133 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 10 predicate places. [2025-03-15 01:54:04,133 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 446 flow [2025-03-15 01:54:04,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,133 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:04,133 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:04,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:04,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:04,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:04,135 INFO L85 PathProgramCache]: Analyzing trace with hash 564027577, now seen corresponding path program 1 times [2025-03-15 01:54:04,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:04,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554781869] [2025-03-15 01:54:04,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:04,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:04,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:04,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554781869] [2025-03-15 01:54:04,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554781869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:04,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:04,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:54:04,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364096385] [2025-03-15 01:54:04,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:04,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 01:54:04,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:04,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 01:54:04,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:54:04,407 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:04,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 446 flow. Second operand has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:04,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:04,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:04,569 INFO L124 PetriNetUnfolderBase]: 7/164 cut-off events. [2025-03-15 01:54:04,569 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-03-15 01:54:04,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 164 events. 7/164 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 224 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 245. Up to 36 conditions per place. [2025-03-15 01:54:04,570 INFO L140 encePairwiseOnDemand]: 100/110 looper letters, 40 selfloop transitions, 11 changer transitions 17/144 dead transitions. [2025-03-15 01:54:04,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 144 transitions, 669 flow [2025-03-15 01:54:04,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:04,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 782 transitions. [2025-03-15 01:54:04,573 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7898989898989899 [2025-03-15 01:54:04,574 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 18 predicate places. [2025-03-15 01:54:04,574 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 144 transitions, 669 flow [2025-03-15 01:54:04,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 82.85714285714286) internal successors, (580), 7 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,574 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:04,574 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:04,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:54:04,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:04,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:04,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1435722530, now seen corresponding path program 1 times [2025-03-15 01:54:04,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:04,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710476946] [2025-03-15 01:54:04,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:04,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:04,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:04,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:04,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:04,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710476946] [2025-03-15 01:54:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710476946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:04,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:04,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507072103] [2025-03-15 01:54:04,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:04,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:04,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:04,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:04,747 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:04,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 144 transitions, 669 flow. Second operand has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:04,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:04,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:04,882 INFO L124 PetriNetUnfolderBase]: 7/162 cut-off events. [2025-03-15 01:54:04,883 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2025-03-15 01:54:04,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 162 events. 7/162 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 213 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 297. Up to 35 conditions per place. [2025-03-15 01:54:04,883 INFO L140 encePairwiseOnDemand]: 102/110 looper letters, 36 selfloop transitions, 15 changer transitions 17/144 dead transitions. [2025-03-15 01:54:04,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 144 transitions, 803 flow [2025-03-15 01:54:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 01:54:04,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 01:54:04,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 598 transitions. [2025-03-15 01:54:04,885 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7766233766233767 [2025-03-15 01:54:04,885 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 22 predicate places. [2025-03-15 01:54:04,885 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 144 transitions, 803 flow [2025-03-15 01:54:04,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.33333333333333) internal successors, (500), 6 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:04,886 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:04,886 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:04,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:04,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:04,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:04,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1695690085, now seen corresponding path program 1 times [2025-03-15 01:54:04,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:04,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604837395] [2025-03-15 01:54:04,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:04,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604837395] [2025-03-15 01:54:05,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604837395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:05,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:54:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234446473] [2025-03-15 01:54:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 01:54:05,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:05,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 01:54:05,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:54:05,078 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:05,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 803 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:05,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:05,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:05,217 INFO L124 PetriNetUnfolderBase]: 7/161 cut-off events. [2025-03-15 01:54:05,217 INFO L125 PetriNetUnfolderBase]: For 201/201 co-relation queries the response was YES. [2025-03-15 01:54:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 519 conditions, 161 events. 7/161 cut-off events. For 201/201 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 350. Up to 35 conditions per place. [2025-03-15 01:54:05,217 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 32 selfloop transitions, 8 changer transitions 27/143 dead transitions. [2025-03-15 01:54:05,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 143 transitions, 923 flow [2025-03-15 01:54:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 01:54:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 01:54:05,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 856 transitions. [2025-03-15 01:54:05,219 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7781818181818182 [2025-03-15 01:54:05,220 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 31 predicate places. [2025-03-15 01:54:05,220 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 143 transitions, 923 flow [2025-03-15 01:54:05,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,220 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:05,220 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:05,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:54:05,221 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:05,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:05,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1557725275, now seen corresponding path program 1 times [2025-03-15 01:54:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755734550] [2025-03-15 01:54:05,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:05,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:05,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:05,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:05,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755734550] [2025-03-15 01:54:05,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755734550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:05,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:05,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:54:05,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477579461] [2025-03-15 01:54:05,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:05,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 01:54:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:05,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 01:54:05,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:54:05,458 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:05,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 143 transitions, 923 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:05,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:05,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:05,603 INFO L124 PetriNetUnfolderBase]: 7/160 cut-off events. [2025-03-15 01:54:05,603 INFO L125 PetriNetUnfolderBase]: For 282/282 co-relation queries the response was YES. [2025-03-15 01:54:05,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 160 events. 7/160 cut-off events. For 282/282 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 200 event pairs, 0 based on Foata normal form. 0/159 useless extension candidates. Maximal degree in co-relation 401. Up to 34 conditions per place. [2025-03-15 01:54:05,604 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 21 selfloop transitions, 7 changer transitions 42/143 dead transitions. [2025-03-15 01:54:05,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 143 transitions, 1055 flow [2025-03-15 01:54:05,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-15 01:54:05,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-15 01:54:05,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 928 transitions. [2025-03-15 01:54:05,606 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7669421487603306 [2025-03-15 01:54:05,607 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 40 predicate places. [2025-03-15 01:54:05,607 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 143 transitions, 1055 flow [2025-03-15 01:54:05,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,607 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:05,607 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:05,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:05,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1149409445, now seen corresponding path program 2 times [2025-03-15 01:54:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082537237] [2025-03-15 01:54:05,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:54:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:05,626 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:54:05,626 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:05,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:05,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:05,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082537237] [2025-03-15 01:54:05,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082537237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:05,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:05,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:54:05,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939639995] [2025-03-15 01:54:05,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:05,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 01:54:05,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:05,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 01:54:05,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:54:05,797 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:05,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 143 transitions, 1055 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:05,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:05,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:05,967 INFO L124 PetriNetUnfolderBase]: 7/170 cut-off events. [2025-03-15 01:54:05,967 INFO L125 PetriNetUnfolderBase]: For 400/400 co-relation queries the response was YES. [2025-03-15 01:54:05,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718 conditions, 170 events. 7/170 cut-off events. For 400/400 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 268 event pairs, 0 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 521. Up to 42 conditions per place. [2025-03-15 01:54:05,968 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 18 selfloop transitions, 6 changer transitions 54/151 dead transitions. [2025-03-15 01:54:05,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 151 transitions, 1307 flow [2025-03-15 01:54:05,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-15 01:54:05,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-15 01:54:05,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1260 transitions. [2025-03-15 01:54:05,970 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7636363636363637 [2025-03-15 01:54:05,971 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 54 predicate places. [2025-03-15 01:54:05,971 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 151 transitions, 1307 flow [2025-03-15 01:54:05,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:05,971 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:05,971 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:05,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:54:05,972 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-03-15 01:54:05,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:05,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1299377619, now seen corresponding path program 3 times [2025-03-15 01:54:05,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:05,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097165774] [2025-03-15 01:54:05,972 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:54:05,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:05,984 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:54:05,984 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:54:06,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:06,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:06,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097165774] [2025-03-15 01:54:06,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097165774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:06,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:06,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 01:54:06,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224294784] [2025-03-15 01:54:06,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:06,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 01:54:06,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:06,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 01:54:06,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-15 01:54:06,124 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 110 [2025-03-15 01:54:06,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 151 transitions, 1307 flow. Second operand has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:06,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:06,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 110 [2025-03-15 01:54:06,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:06,255 INFO L124 PetriNetUnfolderBase]: 7/168 cut-off events. [2025-03-15 01:54:06,255 INFO L125 PetriNetUnfolderBase]: For 518/518 co-relation queries the response was YES. [2025-03-15 01:54:06,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 168 events. 7/168 cut-off events. For 518/518 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 249 event pairs, 0 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 576. Up to 41 conditions per place. [2025-03-15 01:54:06,255 INFO L140 encePairwiseOnDemand]: 101/110 looper letters, 0 selfloop transitions, 0 changer transitions 151/151 dead transitions. [2025-03-15 01:54:06,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 151 transitions, 1455 flow [2025-03-15 01:54:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1089 transitions. [2025-03-15 01:54:06,257 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7615384615384615 [2025-03-15 01:54:06,258 INFO L298 CegarLoopForPetriNet]: 114 programPoint places, 64 predicate places. [2025-03-15 01:54:06,258 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 151 transitions, 1455 flow [2025-03-15 01:54:06,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 83.0) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 01:54:06,263 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_12-ptr_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 01:54:06,284 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 7 remaining) [2025-03-15 01:54:06,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 7 remaining) [2025-03-15 01:54:06,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2025-03-15 01:54:06,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 7 remaining) [2025-03-15 01:54:06,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 7 remaining) [2025-03-15 01:54:06,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 7 remaining) [2025-03-15 01:54:06,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 7 remaining) [2025-03-15 01:54:06,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:54:06,288 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:06,291 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:54:06,292 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:54:06,295 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:54:06 BasicIcfg [2025-03-15 01:54:06,295 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:54:06,296 INFO L158 Benchmark]: Toolchain (without parser) took 4347.27ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 42.1MB in the beginning and 33.2MB in the end (delta: 8.9MB). Peak memory consumption was 66.1MB. Max. memory is 8.0GB. [2025-03-15 01:54:06,296 INFO L158 Benchmark]: CDTParser took 1.07ms. Allocated memory is still 71.3MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:06,296 INFO L158 Benchmark]: CACSL2BoogieTranslator took 460.86ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:06,296 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.99ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:06,296 INFO L158 Benchmark]: Boogie Preprocessor took 22.03ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 36.4MB in the end (delta: 999.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:06,296 INFO L158 Benchmark]: RCFGBuilder took 316.65ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 21.9MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:54:06,299 INFO L158 Benchmark]: TraceAbstraction took 3499.04ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 21.0MB in the beginning and 33.2MB in the end (delta: -12.2MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2025-03-15 01:54:06,300 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.07ms. Allocated memory is still 71.3MB. Free memory was 34.6MB in the beginning and 34.5MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 460.86ms. Allocated memory is still 71.3MB. Free memory was 42.0MB in the beginning and 39.7MB in the end (delta: 2.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.99ms. Allocated memory is still 71.3MB. Free memory was 39.7MB in the beginning and 37.4MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.03ms. Allocated memory is still 71.3MB. Free memory was 37.4MB in the beginning and 36.4MB in the end (delta: 999.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 316.65ms. Allocated memory is still 71.3MB. Free memory was 36.4MB in the beginning and 21.9MB in the end (delta: 14.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3499.04ms. Allocated memory was 71.3MB in the beginning and 134.2MB in the end (delta: 62.9MB). Free memory was 21.0MB in the beginning and 33.2MB in the end (delta: -12.2MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 931]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 931]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 923]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 128 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 238 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 899 IncrementalHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 74 mSDtfsCounter, 899 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 80 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1455occurred in iteration=9, InterpolantAutomatonStates: 79, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 810 NumberOfCodeBlocks, 810 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 801 ConstructedInterpolants, 0 QuantifiedInterpolants, 4447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:54:06,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...