/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_17-ps_add1_nr.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:54:08,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:54:08,904 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:08,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:54:08,978 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:54:08,978 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:54:08,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:54:08,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:54:08,979 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:54:08,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:08,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:54:08,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:54:08,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:54:08,981 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:54:08,981 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:54:08,981 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:54:08,981 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:09,327 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:54:09,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:54:09,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:54:09,335 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:54:09,335 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:54:09,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_17-ps_add1_nr.i [2025-03-15 01:54:10,452 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3716c0bcc/4318a8d2f6354943bcc59abeb8ab89a8/FLAG2a4a4fbcf [2025-03-15 01:54:10,671 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:54:10,672 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_17-ps_add1_nr.i [2025-03-15 01:54:10,687 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3716c0bcc/4318a8d2f6354943bcc59abeb8ab89a8/FLAG2a4a4fbcf [2025-03-15 01:54:11,040 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3716c0bcc/4318a8d2f6354943bcc59abeb8ab89a8 [2025-03-15 01:54:11,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:54:11,044 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:54:11,045 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:11,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:54:11,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:54:11,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:11" (1/1) ... [2025-03-15 01:54:11,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7635f45c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:11, skipping insertion in model container [2025-03-15 01:54:11,050 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:54:11" (1/1) ... [2025-03-15 01:54:11,084 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:54:11,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:11,407 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:54:11,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:54:11,486 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:54:11,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:11 WrapperNode [2025-03-15 01:54:11,486 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:54:11,487 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:11,487 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:54:11,487 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:54:11,492 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:11" (1/1) ... [2025-03-15 01:54:11,508 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:11" (1/1) ... [2025-03-15 01:54:11,522 INFO L138 Inliner]: procedures = 266, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-03-15 01:54:11,523 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:54:11,523 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:54:11,523 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:54:11,523 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:54:11,528 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:11" (1/1) ... [2025-03-15 01:54:11,528 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:11" (1/1) ... [2025-03-15 01:54:11,532 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:11" (1/1) ... [2025-03-15 01:54:11,535 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:11" (1/1) ... [2025-03-15 01:54:11,538 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:11" (1/1) ... [2025-03-15 01:54:11,538 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:11" (1/1) ... [2025-03-15 01:54:11,542 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:11" (1/1) ... [2025-03-15 01:54:11,543 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:11" (1/1) ... [2025-03-15 01:54:11,544 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:11" (1/1) ... [2025-03-15 01:54:11,546 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:54:11,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:54:11,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:54:11,548 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:54:11,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:11" (1/1) ... [2025-03-15 01:54:11,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:54:11,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:54:11,577 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:11,580 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:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:54:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:54:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:54:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-15 01:54:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-15 01:54:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:54:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:54:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:54:11,602 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:11,704 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:54:11,705 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:54:11,836 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:54:11,836 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:54:11,856 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:54:11,856 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:54:11,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:11 BoogieIcfgContainer [2025-03-15 01:54:11,856 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:54:11,858 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:54:11,858 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:54:11,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:54:11,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:54:11" (1/3) ... [2025-03-15 01:54:11,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e56da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:11, skipping insertion in model container [2025-03-15 01:54:11,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:54:11" (2/3) ... [2025-03-15 01:54:11,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e56da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:54:11, skipping insertion in model container [2025-03-15 01:54:11,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:54:11" (3/3) ... [2025-03-15 01:54:11,875 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_17-ps_add1_nr.i [2025-03-15 01:54:11,886 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:54:11,887 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_17-ps_add1_nr.i that has 2 procedures, 80 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-15 01:54:11,887 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:54:11,929 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-15 01:54:11,957 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:54:11,967 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;@6b794bc8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:54:11,967 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-15 01:54:11,987 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:54:11,987 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-03-15 01:54:11,988 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:54:11,989 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:11,990 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] [2025-03-15 01:54:11,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:11,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 327923113, now seen corresponding path program 1 times [2025-03-15 01:54:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58908448] [2025-03-15 01:54:12,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:12,288 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:12,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:12,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58908448] [2025-03-15 01:54:12,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58908448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:12,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:12,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:12,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506153341] [2025-03-15 01:54:12,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:12,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:12,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:12,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:12,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:12,313 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 83 [2025-03-15 01:54:12,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 83 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have 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:12,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:12,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 83 [2025-03-15 01:54:12,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:12,479 INFO L124 PetriNetUnfolderBase]: 58/314 cut-off events. [2025-03-15 01:54:12,479 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-15 01:54:12,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 314 events. 58/314 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1539 event pairs, 9 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 397. Up to 49 conditions per place. [2025-03-15 01:54:12,491 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 28 selfloop transitions, 6 changer transitions 4/103 dead transitions. [2025-03-15 01:54:12,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 103 transitions, 281 flow [2025-03-15 01:54:12,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:12,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:12,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 380 transitions. [2025-03-15 01:54:12,503 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.9156626506024096 [2025-03-15 01:54:12,506 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 3 predicate places. [2025-03-15 01:54:12,506 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 103 transitions, 281 flow [2025-03-15 01:54:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.25) internal successors, (277), 4 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have 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:12,507 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:12,507 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] [2025-03-15 01:54:12,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:54:12,507 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:12,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:12,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1149166992, now seen corresponding path program 1 times [2025-03-15 01:54:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703769029] [2025-03-15 01:54:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:12,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:12,573 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:12,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:12,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703769029] [2025-03-15 01:54:12,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703769029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:12,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:12,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:12,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823297809] [2025-03-15 01:54:12,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:12,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:12,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:12,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:12,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:12,575 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:12,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 103 transitions, 281 flow. Second operand has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have 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:12,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:12,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:12,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:12,758 INFO L124 PetriNetUnfolderBase]: 149/604 cut-off events. [2025-03-15 01:54:12,758 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-15 01:54:12,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1101 conditions, 604 events. 149/604 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3798 event pairs, 40 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 1069. Up to 160 conditions per place. [2025-03-15 01:54:12,764 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 45 selfloop transitions, 9 changer transitions 4/124 dead transitions. [2025-03-15 01:54:12,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 124 transitions, 451 flow [2025-03-15 01:54:12,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:12,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2025-03-15 01:54:12,768 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7734939759036145 [2025-03-15 01:54:12,768 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-03-15 01:54:12,769 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 124 transitions, 451 flow [2025-03-15 01:54:12,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.75) internal successors, (223), 4 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have 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:12,769 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:12,769 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:12,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:54:12,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:12,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:12,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1285971128, now seen corresponding path program 1 times [2025-03-15 01:54:12,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:12,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933222611] [2025-03-15 01:54:12,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:12,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:12,895 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:12,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:12,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933222611] [2025-03-15 01:54:12,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933222611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:12,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:12,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 01:54:12,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702168599] [2025-03-15 01:54:12,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:12,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 01:54:12,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:12,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 01:54:12,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-15 01:54:12,897 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-03-15 01:54:12,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 124 transitions, 451 flow. Second operand has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:12,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:12,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-03-15 01:54:12,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,052 INFO L124 PetriNetUnfolderBase]: 152/591 cut-off events. [2025-03-15 01:54:13,052 INFO L125 PetriNetUnfolderBase]: For 181/215 co-relation queries the response was YES. [2025-03-15 01:54:13,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1354 conditions, 591 events. 152/591 cut-off events. For 181/215 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3684 event pairs, 31 based on Foata normal form. 2/496 useless extension candidates. Maximal degree in co-relation 1315. Up to 163 conditions per place. [2025-03-15 01:54:13,055 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 48 selfloop transitions, 11 changer transitions 6/128 dead transitions. [2025-03-15 01:54:13,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 128 transitions, 605 flow [2025-03-15 01:54:13,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 01:54:13,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 01:54:13,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 343 transitions. [2025-03-15 01:54:13,058 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6887550200803213 [2025-03-15 01:54:13,058 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 11 predicate places. [2025-03-15 01:54:13,058 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 128 transitions, 605 flow [2025-03-15 01:54:13,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 53.2) internal successors, (266), 5 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have 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:13,059 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,059 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:13,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:54:13,059 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:13,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1264438205, now seen corresponding path program 1 times [2025-03-15 01:54:13,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519078685] [2025-03-15 01:54:13,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,123 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:13,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519078685] [2025-03-15 01:54:13,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519078685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:13,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448640255] [2025-03-15 01:54:13,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:13,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:13,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:13,125 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:13,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 128 transitions, 605 flow. Second operand has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:13,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:13,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,219 INFO L124 PetriNetUnfolderBase]: 150/597 cut-off events. [2025-03-15 01:54:13,219 INFO L125 PetriNetUnfolderBase]: For 392/480 co-relation queries the response was YES. [2025-03-15 01:54:13,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 597 events. 150/597 cut-off events. For 392/480 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3731 event pairs, 22 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 1575. Up to 223 conditions per place. [2025-03-15 01:54:13,222 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 55 selfloop transitions, 7 changer transitions 7/135 dead transitions. [2025-03-15 01:54:13,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 135 transitions, 797 flow [2025-03-15 01:54:13,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:13,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-03-15 01:54:13,223 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7493975903614458 [2025-03-15 01:54:13,224 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-03-15 01:54:13,224 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 135 transitions, 797 flow [2025-03-15 01:54:13,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.0) internal successors, (224), 4 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have 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:13,224 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,224 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:13,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:54:13,224 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:13,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1210399125, now seen corresponding path program 1 times [2025-03-15 01:54:13,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138820768] [2025-03-15 01:54:13,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,313 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:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138820768] [2025-03-15 01:54:13,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138820768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:13,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590412191] [2025-03-15 01:54:13,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:13,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:13,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:13,315 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-03-15 01:54:13,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 135 transitions, 797 flow. Second operand has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:13,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-03-15 01:54:13,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,448 INFO L124 PetriNetUnfolderBase]: 143/579 cut-off events. [2025-03-15 01:54:13,448 INFO L125 PetriNetUnfolderBase]: For 728/1076 co-relation queries the response was YES. [2025-03-15 01:54:13,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1816 conditions, 579 events. 143/579 cut-off events. For 728/1076 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3657 event pairs, 15 based on Foata normal form. 16/502 useless extension candidates. Maximal degree in co-relation 1766. Up to 212 conditions per place. [2025-03-15 01:54:13,452 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 50 selfloop transitions, 17 changer transitions 8/138 dead transitions. [2025-03-15 01:54:13,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 138 transitions, 977 flow [2025-03-15 01:54:13,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:54:13,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:54:13,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 451 transitions. [2025-03-15 01:54:13,453 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6792168674698795 [2025-03-15 01:54:13,454 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-03-15 01:54:13,454 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 138 transitions, 977 flow [2025-03-15 01:54:13,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.0) internal successors, (318), 6 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have 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:13,454 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,454 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] [2025-03-15 01:54:13,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:54:13,454 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:13,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1545258337, now seen corresponding path program 1 times [2025-03-15 01:54:13,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974706799] [2025-03-15 01:54:13,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,529 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:13,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974706799] [2025-03-15 01:54:13,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974706799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:13,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480591143] [2025-03-15 01:54:13,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:13,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:13,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:13,531 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2025-03-15 01:54:13,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 138 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:13,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2025-03-15 01:54:13,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,672 INFO L124 PetriNetUnfolderBase]: 141/566 cut-off events. [2025-03-15 01:54:13,672 INFO L125 PetriNetUnfolderBase]: For 1095/1383 co-relation queries the response was YES. [2025-03-15 01:54:13,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 566 events. 141/566 cut-off events. For 1095/1383 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3558 event pairs, 6 based on Foata normal form. 20/496 useless extension candidates. Maximal degree in co-relation 1972. Up to 212 conditions per place. [2025-03-15 01:54:13,676 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 53 selfloop transitions, 13 changer transitions 8/137 dead transitions. [2025-03-15 01:54:13,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 137 transitions, 1113 flow [2025-03-15 01:54:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 01:54:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 01:54:13,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 450 transitions. [2025-03-15 01:54:13,678 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.677710843373494 [2025-03-15 01:54:13,678 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 25 predicate places. [2025-03-15 01:54:13,678 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 137 transitions, 1113 flow [2025-03-15 01:54:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 53.5) internal successors, (321), 6 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have 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:13,679 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,679 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] [2025-03-15 01:54:13,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:54:13,679 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,679 INFO L85 PathProgramCache]: Analyzing trace with hash -2008928898, now seen corresponding path program 1 times [2025-03-15 01:54:13,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202939102] [2025-03-15 01:54:13,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,735 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:13,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202939102] [2025-03-15 01:54:13,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202939102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703120818] [2025-03-15 01:54:13,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:13,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:13,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:13,737 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 83 [2025-03-15 01:54:13,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 137 transitions, 1113 flow. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:13,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 83 [2025-03-15 01:54:13,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:13,865 INFO L124 PetriNetUnfolderBase]: 192/723 cut-off events. [2025-03-15 01:54:13,866 INFO L125 PetriNetUnfolderBase]: For 2280/2565 co-relation queries the response was YES. [2025-03-15 01:54:13,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 723 events. 192/723 cut-off events. For 2280/2565 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4821 event pairs, 14 based on Foata normal form. 35/650 useless extension candidates. Maximal degree in co-relation 2740. Up to 264 conditions per place. [2025-03-15 01:54:13,870 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 9 changer transitions 18/162 dead transitions. [2025-03-15 01:54:13,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 162 transitions, 1499 flow [2025-03-15 01:54:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:13,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 377 transitions. [2025-03-15 01:54:13,872 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.908433734939759 [2025-03-15 01:54:13,873 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 29 predicate places. [2025-03-15 01:54:13,873 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 162 transitions, 1499 flow [2025-03-15 01:54:13,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 4 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:13,874 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:13,874 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] [2025-03-15 01:54:13,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:54:13,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:13,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:13,875 INFO L85 PathProgramCache]: Analyzing trace with hash -2139094131, now seen corresponding path program 1 times [2025-03-15 01:54:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655898168] [2025-03-15 01:54:13,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:13,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655898168] [2025-03-15 01:54:13,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655898168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:13,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:13,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:13,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233868538] [2025-03-15 01:54:13,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:13,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:13,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:13,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:13,911 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:13,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 162 transitions, 1499 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:13,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:13,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:13,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,023 INFO L124 PetriNetUnfolderBase]: 227/780 cut-off events. [2025-03-15 01:54:14,023 INFO L125 PetriNetUnfolderBase]: For 3883/4164 co-relation queries the response was YES. [2025-03-15 01:54:14,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3518 conditions, 780 events. 227/780 cut-off events. For 3883/4164 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5251 event pairs, 19 based on Foata normal form. 10/683 useless extension candidates. Maximal degree in co-relation 3453. Up to 353 conditions per place. [2025-03-15 01:54:14,028 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 4 changer transitions 24/178 dead transitions. [2025-03-15 01:54:14,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 178 transitions, 1897 flow [2025-03-15 01:54:14,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:14,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:14,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 311 transitions. [2025-03-15 01:54:14,029 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7493975903614458 [2025-03-15 01:54:14,029 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 33 predicate places. [2025-03-15 01:54:14,029 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 178 transitions, 1897 flow [2025-03-15 01:54:14,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:14,030 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:14,030 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] [2025-03-15 01:54:14,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:54:14,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:14,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:14,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1887408429, now seen corresponding path program 1 times [2025-03-15 01:54:14,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:14,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51799368] [2025-03-15 01:54:14,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:14,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:14,056 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:14,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:14,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51799368] [2025-03-15 01:54:14,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51799368] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:14,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:14,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:14,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571578970] [2025-03-15 01:54:14,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:14,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:14,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:14,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:14,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:14,058 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:14,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 178 transitions, 1897 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:14,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:14,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:14,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,198 INFO L124 PetriNetUnfolderBase]: 228/784 cut-off events. [2025-03-15 01:54:14,198 INFO L125 PetriNetUnfolderBase]: For 4731/5086 co-relation queries the response was YES. [2025-03-15 01:54:14,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3970 conditions, 784 events. 228/784 cut-off events. For 4731/5086 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5251 event pairs, 17 based on Foata normal form. 11/690 useless extension candidates. Maximal degree in co-relation 3901. Up to 360 conditions per place. [2025-03-15 01:54:14,203 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 69 selfloop transitions, 5 changer transitions 39/190 dead transitions. [2025-03-15 01:54:14,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 190 transitions, 2339 flow [2025-03-15 01:54:14,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:14,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 315 transitions. [2025-03-15 01:54:14,206 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7590361445783133 [2025-03-15 01:54:14,207 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 37 predicate places. [2025-03-15 01:54:14,207 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 190 transitions, 2339 flow [2025-03-15 01:54:14,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:14,207 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:14,207 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:14,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:54:14,207 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:14,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:14,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2062606319, now seen corresponding path program 1 times [2025-03-15 01:54:14,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:14,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666129815] [2025-03-15 01:54:14,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:14,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:14,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:14,264 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:14,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:14,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666129815] [2025-03-15 01:54:14,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666129815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:14,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:14,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:14,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824706579] [2025-03-15 01:54:14,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:14,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:14,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:14,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:14,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:14,265 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:14,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 190 transitions, 2339 flow. Second operand has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:14,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:14,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:14,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,375 INFO L124 PetriNetUnfolderBase]: 222/743 cut-off events. [2025-03-15 01:54:14,375 INFO L125 PetriNetUnfolderBase]: For 5528/5944 co-relation queries the response was YES. [2025-03-15 01:54:14,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4232 conditions, 743 events. 222/743 cut-off events. For 5528/5944 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 4844 event pairs, 12 based on Foata normal form. 12/668 useless extension candidates. Maximal degree in co-relation 4159. Up to 336 conditions per place. [2025-03-15 01:54:14,379 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 67 selfloop transitions, 11 changer transitions 41/196 dead transitions. [2025-03-15 01:54:14,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 196 transitions, 2707 flow [2025-03-15 01:54:14,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 01:54:14,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 01:54:14,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 306 transitions. [2025-03-15 01:54:14,381 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7373493975903614 [2025-03-15 01:54:14,381 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 39 predicate places. [2025-03-15 01:54:14,381 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 196 transitions, 2707 flow [2025-03-15 01:54:14,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.0) internal successors, (228), 4 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have 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:14,381 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:14,382 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] [2025-03-15 01:54:14,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:54:14,382 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:14,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:14,382 INFO L85 PathProgramCache]: Analyzing trace with hash -389043231, now seen corresponding path program 1 times [2025-03-15 01:54:14,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:14,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405916702] [2025-03-15 01:54:14,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:14,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:14,454 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:14,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:14,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405916702] [2025-03-15 01:54:14,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405916702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:14,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:14,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:14,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144702973] [2025-03-15 01:54:14,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:14,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:14,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:14,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:14,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:14,456 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 83 [2025-03-15 01:54:14,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 196 transitions, 2707 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:14,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:14,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 83 [2025-03-15 01:54:14,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,654 INFO L124 PetriNetUnfolderBase]: 280/888 cut-off events. [2025-03-15 01:54:14,654 INFO L125 PetriNetUnfolderBase]: For 8763/9500 co-relation queries the response was YES. [2025-03-15 01:54:14,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 888 events. 280/888 cut-off events. For 8763/9500 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5809 event pairs, 23 based on Foata normal form. 142/937 useless extension candidates. Maximal degree in co-relation 5396. Up to 410 conditions per place. [2025-03-15 01:54:14,660 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 91 selfloop transitions, 15 changer transitions 66/235 dead transitions. [2025-03-15 01:54:14,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 235 transitions, 3713 flow [2025-03-15 01:54:14,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:14,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:14,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 629 transitions. [2025-03-15 01:54:14,663 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8420348058902276 [2025-03-15 01:54:14,664 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 46 predicate places. [2025-03-15 01:54:14,664 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 235 transitions, 3713 flow [2025-03-15 01:54:14,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:14,664 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:14,664 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] [2025-03-15 01:54:14,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:54:14,664 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:14,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:14,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1702985953, now seen corresponding path program 1 times [2025-03-15 01:54:14,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:14,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193704277] [2025-03-15 01:54:14,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:14,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:14,736 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:14,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:14,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193704277] [2025-03-15 01:54:14,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193704277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:14,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:14,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:14,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023815088] [2025-03-15 01:54:14,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:14,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:14,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:14,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:14,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:14,738 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 83 [2025-03-15 01:54:14,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 235 transitions, 3713 flow. Second operand has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:14,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:14,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 83 [2025-03-15 01:54:14,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:14,975 INFO L124 PetriNetUnfolderBase]: 277/886 cut-off events. [2025-03-15 01:54:14,976 INFO L125 PetriNetUnfolderBase]: For 9294/10104 co-relation queries the response was YES. [2025-03-15 01:54:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5871 conditions, 886 events. 277/886 cut-off events. For 9294/10104 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 5767 event pairs, 2 based on Foata normal form. 66/868 useless extension candidates. Maximal degree in co-relation 5790. Up to 407 conditions per place. [2025-03-15 01:54:14,982 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 96 selfloop transitions, 17 changer transitions 71/247 dead transitions. [2025-03-15 01:54:14,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 247 transitions, 4181 flow [2025-03-15 01:54:14,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 01:54:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 01:54:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 625 transitions. [2025-03-15 01:54:14,983 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8366800535475234 [2025-03-15 01:54:14,984 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 53 predicate places. [2025-03-15 01:54:14,984 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 247 transitions, 4181 flow [2025-03-15 01:54:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.666666666666664) internal successors, (382), 6 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have 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:14,984 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:14,984 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] [2025-03-15 01:54:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:54:14,984 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:14,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:14,985 INFO L85 PathProgramCache]: Analyzing trace with hash -483713359, now seen corresponding path program 1 times [2025-03-15 01:54:14,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:14,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490297264] [2025-03-15 01:54:14,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:14,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:15,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:54:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490297264] [2025-03-15 01:54:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490297264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 01:54:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368565733] [2025-03-15 01:54:15,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:15,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 01:54:15,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:15,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 01:54:15,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 01:54:15,023 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 83 [2025-03-15 01:54:15,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 247 transitions, 4181 flow. Second operand has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:15,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:15,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 83 [2025-03-15 01:54:15,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:15,137 INFO L124 PetriNetUnfolderBase]: 269/855 cut-off events. [2025-03-15 01:54:15,137 INFO L125 PetriNetUnfolderBase]: For 10530/11280 co-relation queries the response was YES. [2025-03-15 01:54:15,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6112 conditions, 855 events. 269/855 cut-off events. For 10530/11280 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5448 event pairs, 2 based on Foata normal form. 19/814 useless extension candidates. Maximal degree in co-relation 6027. Up to 407 conditions per place. [2025-03-15 01:54:15,142 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 62 selfloop transitions, 11 changer transitions 104/242 dead transitions. [2025-03-15 01:54:15,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 242 transitions, 4361 flow [2025-03-15 01:54:15,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 01:54:15,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 01:54:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 248 transitions. [2025-03-15 01:54:15,144 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7469879518072289 [2025-03-15 01:54:15,144 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 55 predicate places. [2025-03-15 01:54:15,144 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 242 transitions, 4361 flow [2025-03-15 01:54:15,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.25) internal successors, (229), 4 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have 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:15,144 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:15,144 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] [2025-03-15 01:54:15,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:54:15,144 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:15,145 INFO L85 PathProgramCache]: Analyzing trace with hash -645234177, now seen corresponding path program 1 times [2025-03-15 01:54:15,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:15,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176147132] [2025-03-15 01:54:15,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:15,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:15,223 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:15,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:15,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176147132] [2025-03-15 01:54:15,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176147132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:15,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:15,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:15,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393531355] [2025-03-15 01:54:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:15,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:15,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:15,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:15,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:15,224 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 83 [2025-03-15 01:54:15,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 242 transitions, 4361 flow. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:15,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:15,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 83 [2025-03-15 01:54:15,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:15,430 INFO L124 PetriNetUnfolderBase]: 264/849 cut-off events. [2025-03-15 01:54:15,430 INFO L125 PetriNetUnfolderBase]: For 11940/13266 co-relation queries the response was YES. [2025-03-15 01:54:15,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6495 conditions, 849 events. 264/849 cut-off events. For 11940/13266 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5416 event pairs, 1 based on Foata normal form. 163/958 useless extension candidates. Maximal degree in co-relation 6406. Up to 406 conditions per place. [2025-03-15 01:54:15,435 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 39 selfloop transitions, 7 changer transitions 140/245 dead transitions. [2025-03-15 01:54:15,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 245 transitions, 4789 flow [2025-03-15 01:54:15,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:15,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 885 transitions. [2025-03-15 01:54:15,438 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8202038924930491 [2025-03-15 01:54:15,438 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 66 predicate places. [2025-03-15 01:54:15,438 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 245 transitions, 4789 flow [2025-03-15 01:54:15,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:15,439 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:54:15,439 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] [2025-03-15 01:54:15,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:54:15,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-15 01:54:15,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:54:15,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1252957225, now seen corresponding path program 1 times [2025-03-15 01:54:15,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:54:15,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692154991] [2025-03-15 01:54:15,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:54:15,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:54:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:54:15,502 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:15,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:54:15,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692154991] [2025-03-15 01:54:15,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692154991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:54:15,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:54:15,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 01:54:15,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992800933] [2025-03-15 01:54:15,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:54:15,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 01:54:15,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:54:15,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 01:54:15,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-15 01:54:15,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 83 [2025-03-15 01:54:15,503 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 245 transitions, 4789 flow. Second operand has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:15,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:54:15,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 83 [2025-03-15 01:54:15,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:54:15,690 INFO L124 PetriNetUnfolderBase]: 274/884 cut-off events. [2025-03-15 01:54:15,691 INFO L125 PetriNetUnfolderBase]: For 14562/16125 co-relation queries the response was YES. [2025-03-15 01:54:15,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7260 conditions, 884 events. 274/884 cut-off events. For 14562/16125 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5821 event pairs, 2 based on Foata normal form. 185/1018 useless extension candidates. Maximal degree in co-relation 7167. Up to 434 conditions per place. [2025-03-15 01:54:15,695 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 0 selfloop transitions, 0 changer transitions 257/257 dead transitions. [2025-03-15 01:54:15,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 257 transitions, 5549 flow [2025-03-15 01:54:15,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-15 01:54:15,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-15 01:54:15,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 881 transitions. [2025-03-15 01:54:15,697 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8164967562557924 [2025-03-15 01:54:15,697 INFO L298 CegarLoopForPetriNet]: 83 programPoint places, 77 predicate places. [2025-03-15 01:54:15,698 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 257 transitions, 5549 flow [2025-03-15 01:54:15,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.833333333333336) internal successors, (383), 6 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:15,702 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/04-mutex_17-ps_add1_nr.i_petrified1_AllErrorsAtOnce [2025-03-15 01:54:15,718 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-15 01:54:15,719 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-15 01:54:15,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-15 01:54:15,720 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:54:15,723 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:54:15,723 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:54:15,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:54:15 BasicIcfg [2025-03-15 01:54:15,726 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:54:15,726 INFO L158 Benchmark]: Toolchain (without parser) took 4683.81ms. Allocated memory was 71.3MB in the beginning and 155.2MB in the end (delta: 83.9MB). Free memory was 41.8MB in the beginning and 76.5MB in the end (delta: -34.7MB). Peak memory consumption was 46.4MB. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: CDTParser took 1.18ms. Allocated memory is still 71.3MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: CACSL2BoogieTranslator took 441.51ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 35.3MB in the end (delta: 6.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.53ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 33.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: Boogie Preprocessor took 23.45ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 32.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: RCFGBuilder took 308.97ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 18.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 01:54:15,727 INFO L158 Benchmark]: TraceAbstraction took 3868.08ms. Allocated memory was 71.3MB in the beginning and 155.2MB in the end (delta: 83.9MB). Free memory was 17.4MB in the beginning and 76.5MB in the end (delta: -59.1MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. [2025-03-15 01:54:15,728 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.18ms. Allocated memory is still 71.3MB. Free memory is still 35.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 441.51ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 35.3MB in the end (delta: 6.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.53ms. Allocated memory is still 71.3MB. Free memory was 35.3MB in the beginning and 33.4MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.45ms. Allocated memory is still 71.3MB. Free memory was 33.4MB in the beginning and 32.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 308.97ms. Allocated memory is still 71.3MB. Free memory was 32.1MB in the beginning and 18.5MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3868.08ms. Allocated memory was 71.3MB in the beginning and 155.2MB in the end (delta: 83.9MB). Free memory was 17.4MB in the beginning and 76.5MB in the end (delta: -59.1MB). Peak memory consumption was 25.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 947]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 948]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 948]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 949]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 951]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 951]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 932]: 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, 96 locations, 13 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.8s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 464 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 464 mSDsluCounter, 420 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 235 mSDsCounter, 40 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 40 mSolverCounterUnsat, 185 mSDtfsCounter, 1058 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5549occurred in iteration=15, InterpolantAutomatonStates: 105, 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, 0.9s InterpolantComputationTime, 589 NumberOfCodeBlocks, 589 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 574 ConstructedInterpolants, 0 QuantifiedInterpolants, 1334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 01:54:15,741 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...