/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:35:35,594 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:35:35,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 02:35:35,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:35:35,717 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:35:35,717 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:35:35,718 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:35:35,718 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:35:35,718 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:35:35,718 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:35:35,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:35:35,720 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:35:35,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:35:35,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:35:35,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:35:35,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:35:35,721 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:35:35,721 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 02:35:35,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:35:35,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:35:35,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:35:35,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:35:35,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:35:35,987 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-03-15 02:35:37,122 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec76aeb2/a70ee7824fae48c0bab25036743e1664/FLAGdf341550f [2025-03-15 02:35:37,356 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:35:37,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-bluetooth.wvr.c [2025-03-15 02:35:37,363 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec76aeb2/a70ee7824fae48c0bab25036743e1664/FLAGdf341550f [2025-03-15 02:35:37,713 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eec76aeb2/a70ee7824fae48c0bab25036743e1664 [2025-03-15 02:35:37,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:35:37,716 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:35:37,717 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:35:37,717 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:35:37,720 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:35:37,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,721 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@106ee75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37, skipping insertion in model container [2025-03-15 02:35:37,721 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,734 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:35:37,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:35:37,863 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:35:37,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:35:37,896 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:35:37,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37 WrapperNode [2025-03-15 02:35:37,897 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:35:37,898 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:35:37,898 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:35:37,898 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:35:37,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,931 INFO L138 Inliner]: procedures = 18, calls = 17, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 119 [2025-03-15 02:35:37,931 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:35:37,932 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:35:37,933 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:35:37,933 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:35:37,939 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,939 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,942 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,942 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,952 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,960 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,961 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,962 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:35:37,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:35:37,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:35:37,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:35:37,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (1/1) ... [2025-03-15 02:35:37,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:35:37,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:35:37,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 02:35:37,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 02:35:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:35:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:35:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:35:38,019 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:35:38,019 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:35:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:35:38,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:35:38,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:35:38,020 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 02:35:38,085 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:35:38,087 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:35:38,301 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:35:38,301 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:35:38,354 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:35:38,354 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 02:35:38,355 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:35:38 BoogieIcfgContainer [2025-03-15 02:35:38,355 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:35:38,357 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:35:38,357 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:35:38,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:35:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:35:37" (1/3) ... [2025-03-15 02:35:38,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56135389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:35:38, skipping insertion in model container [2025-03-15 02:35:38,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:35:37" (2/3) ... [2025-03-15 02:35:38,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56135389 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:35:38, skipping insertion in model container [2025-03-15 02:35:38,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:35:38" (3/3) ... [2025-03-15 02:35:38,366 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-bluetooth.wvr.c [2025-03-15 02:35:38,382 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:35:38,384 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-bluetooth.wvr.c that has 3 procedures, 152 locations, 1 initial locations, 0 loop locations, and 8 error locations. [2025-03-15 02:35:38,385 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:35:38,450 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 02:35:38,487 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:35:38,501 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;@9ea9a98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:35:38,501 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-15 02:35:38,535 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:35:38,536 INFO L124 PetriNetUnfolderBase]: 7/104 cut-off events. [2025-03-15 02:35:38,538 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:35:38,538 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:38,540 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:38,540 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:38,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:38,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1330013027, now seen corresponding path program 1 times [2025-03-15 02:35:38,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:38,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187855571] [2025-03-15 02:35:38,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:38,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:38,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187855571] [2025-03-15 02:35:38,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187855571] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:38,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:38,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:35:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160960321] [2025-03-15 02:35:38,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:38,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:35:38,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:38,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:35:38,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:35:38,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2025-03-15 02:35:38,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 162 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:38,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:38,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2025-03-15 02:35:38,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:39,118 INFO L124 PetriNetUnfolderBase]: 109/357 cut-off events. [2025-03-15 02:35:39,118 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-15 02:35:39,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581 conditions, 357 events. 109/357 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1297 event pairs, 70 based on Foata normal form. 17/262 useless extension candidates. Maximal degree in co-relation 427. Up to 192 conditions per place. [2025-03-15 02:35:39,129 INFO L140 encePairwiseOnDemand]: 149/162 looper letters, 22 selfloop transitions, 3 changer transitions 15/144 dead transitions. [2025-03-15 02:35:39,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 144 transitions, 352 flow [2025-03-15 02:35:39,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:35:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:35:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 536 transitions. [2025-03-15 02:35:39,147 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8271604938271605 [2025-03-15 02:35:39,150 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, -7 predicate places. [2025-03-15 02:35:39,150 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 144 transitions, 352 flow [2025-03-15 02:35:39,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.25) internal successors, (509), 4 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,151 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:39,151 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:39,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:35:39,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:39,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:39,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1330013026, now seen corresponding path program 1 times [2025-03-15 02:35:39,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:39,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156058107] [2025-03-15 02:35:39,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:39,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:39,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156058107] [2025-03-15 02:35:39,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156058107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:39,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:39,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:35:39,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351200334] [2025-03-15 02:35:39,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:39,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:35:39,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:39,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:35:39,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:35:39,419 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2025-03-15 02:35:39,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 144 transitions, 352 flow. Second operand has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:39,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2025-03-15 02:35:39,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:39,570 INFO L124 PetriNetUnfolderBase]: 93/365 cut-off events. [2025-03-15 02:35:39,570 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-03-15 02:35:39,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 792 conditions, 365 events. 93/365 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1337 event pairs, 43 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 561. Up to 182 conditions per place. [2025-03-15 02:35:39,573 INFO L140 encePairwiseOnDemand]: 149/162 looper letters, 54 selfloop transitions, 6 changer transitions 15/148 dead transitions. [2025-03-15 02:35:39,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 148 transitions, 519 flow [2025-03-15 02:35:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:35:39,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:35:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2025-03-15 02:35:39,577 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5874485596707819 [2025-03-15 02:35:39,578 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, -2 predicate places. [2025-03-15 02:35:39,578 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 148 transitions, 519 flow [2025-03-15 02:35:39,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.0) internal successors, (450), 5 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,578 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:39,578 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:39,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:35:39,579 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:39,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:39,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1757750336, now seen corresponding path program 1 times [2025-03-15 02:35:39,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:39,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876737495] [2025-03-15 02:35:39,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:39,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:39,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876737495] [2025-03-15 02:35:39,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876737495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:39,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:39,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:35:39,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084438972] [2025-03-15 02:35:39,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:39,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:35:39,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:39,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:35:39,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:35:39,718 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2025-03-15 02:35:39,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 148 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:39,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2025-03-15 02:35:39,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:39,876 INFO L124 PetriNetUnfolderBase]: 100/494 cut-off events. [2025-03-15 02:35:39,876 INFO L125 PetriNetUnfolderBase]: For 302/328 co-relation queries the response was YES. [2025-03-15 02:35:39,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 494 events. 100/494 cut-off events. For 302/328 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 2477 event pairs, 14 based on Foata normal form. 1/383 useless extension candidates. Maximal degree in co-relation 951. Up to 222 conditions per place. [2025-03-15 02:35:39,881 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 28 selfloop transitions, 15 changer transitions 16/163 dead transitions. [2025-03-15 02:35:39,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 163 transitions, 708 flow [2025-03-15 02:35:39,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:35:39,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:35:39,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2025-03-15 02:35:39,883 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8168724279835391 [2025-03-15 02:35:39,884 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 3 predicate places. [2025-03-15 02:35:39,884 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 163 transitions, 708 flow [2025-03-15 02:35:39,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,884 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:39,884 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:39,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:35:39,885 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:39,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:39,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1757750337, now seen corresponding path program 1 times [2025-03-15 02:35:39,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:39,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570696801] [2025-03-15 02:35:39,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:39,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:39,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:39,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:39,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:39,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570696801] [2025-03-15 02:35:39,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570696801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:39,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:39,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-15 02:35:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765450000] [2025-03-15 02:35:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:39,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-15 02:35:39,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:39,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-15 02:35:39,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-15 02:35:39,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 162 [2025-03-15 02:35:39,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 163 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:39,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:39,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 162 [2025-03-15 02:35:39,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:40,044 INFO L124 PetriNetUnfolderBase]: 65/409 cut-off events. [2025-03-15 02:35:40,045 INFO L125 PetriNetUnfolderBase]: For 402/428 co-relation queries the response was YES. [2025-03-15 02:35:40,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1069 conditions, 409 events. 65/409 cut-off events. For 402/428 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1856 event pairs, 13 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 789. Up to 155 conditions per place. [2025-03-15 02:35:40,048 INFO L140 encePairwiseOnDemand]: 154/162 looper letters, 25 selfloop transitions, 5 changer transitions 19/157 dead transitions. [2025-03-15 02:35:40,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 157 transitions, 730 flow [2025-03-15 02:35:40,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-15 02:35:40,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-15 02:35:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2025-03-15 02:35:40,049 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8559670781893004 [2025-03-15 02:35:40,050 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 2 predicate places. [2025-03-15 02:35:40,050 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 157 transitions, 730 flow [2025-03-15 02:35:40,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,051 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:40,051 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:40,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 02:35:40,051 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:40,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:40,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1414054887, now seen corresponding path program 1 times [2025-03-15 02:35:40,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:40,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002178703] [2025-03-15 02:35:40,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:40,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:40,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:40,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002178703] [2025-03-15 02:35:40,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002178703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:40,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:40,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:35:40,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255293591] [2025-03-15 02:35:40,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:40,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:40,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:40,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:35:40,207 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2025-03-15 02:35:40,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 157 transitions, 730 flow. Second operand has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:40,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2025-03-15 02:35:40,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:40,366 INFO L124 PetriNetUnfolderBase]: 64/444 cut-off events. [2025-03-15 02:35:40,366 INFO L125 PetriNetUnfolderBase]: For 579/589 co-relation queries the response was YES. [2025-03-15 02:35:40,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 444 events. 64/444 cut-off events. For 579/589 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2085 event pairs, 4 based on Foata normal form. 2/382 useless extension candidates. Maximal degree in co-relation 929. Up to 157 conditions per place. [2025-03-15 02:35:40,369 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 56 selfloop transitions, 17 changer transitions 30/176 dead transitions. [2025-03-15 02:35:40,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 176 transitions, 1088 flow [2025-03-15 02:35:40,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:35:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:35:40,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 749 transitions. [2025-03-15 02:35:40,373 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5779320987654321 [2025-03-15 02:35:40,374 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 9 predicate places. [2025-03-15 02:35:40,374 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 176 transitions, 1088 flow [2025-03-15 02:35:40,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.0) internal successors, (534), 6 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,375 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:40,375 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:40,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 02:35:40,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:40,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:40,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1091423425, now seen corresponding path program 1 times [2025-03-15 02:35:40,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:40,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795439191] [2025-03-15 02:35:40,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:40,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:40,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795439191] [2025-03-15 02:35:40,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795439191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:40,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:40,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:35:40,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891641771] [2025-03-15 02:35:40,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:40,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:35:40,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:40,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:35:40,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:35:40,486 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 162 [2025-03-15 02:35:40,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 176 transitions, 1088 flow. Second operand has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:40,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 162 [2025-03-15 02:35:40,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:40,586 INFO L124 PetriNetUnfolderBase]: 60/425 cut-off events. [2025-03-15 02:35:40,586 INFO L125 PetriNetUnfolderBase]: For 811/822 co-relation queries the response was YES. [2025-03-15 02:35:40,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1392 conditions, 425 events. 60/425 cut-off events. For 811/822 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1922 event pairs, 4 based on Foata normal form. 1/369 useless extension candidates. Maximal degree in co-relation 982. Up to 149 conditions per place. [2025-03-15 02:35:40,588 INFO L140 encePairwiseOnDemand]: 152/162 looper letters, 29 selfloop transitions, 10 changer transitions 34/177 dead transitions. [2025-03-15 02:35:40,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 177 transitions, 1207 flow [2025-03-15 02:35:40,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-15 02:35:40,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-15 02:35:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2025-03-15 02:35:40,591 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-03-15 02:35:40,591 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 13 predicate places. [2025-03-15 02:35:40,591 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 177 transitions, 1207 flow [2025-03-15 02:35:40,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,592 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:40,592 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:40,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:35:40,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:40,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:40,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1125551333, now seen corresponding path program 1 times [2025-03-15 02:35:40,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:40,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747847810] [2025-03-15 02:35:40,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:40,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:40,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:40,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:40,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:40,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747847810] [2025-03-15 02:35:40,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747847810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:40,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:40,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-15 02:35:40,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069245435] [2025-03-15 02:35:40,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:40,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:40,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:40,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:40,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:35:40,752 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2025-03-15 02:35:40,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 177 transitions, 1207 flow. Second operand has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:40,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2025-03-15 02:35:40,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:40,859 INFO L124 PetriNetUnfolderBase]: 53/407 cut-off events. [2025-03-15 02:35:40,859 INFO L125 PetriNetUnfolderBase]: For 1047/1064 co-relation queries the response was YES. [2025-03-15 02:35:40,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1456 conditions, 407 events. 53/407 cut-off events. For 1047/1064 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1770 event pairs, 1 based on Foata normal form. 1/361 useless extension candidates. Maximal degree in co-relation 977. Up to 134 conditions per place. [2025-03-15 02:35:40,861 INFO L140 encePairwiseOnDemand]: 149/162 looper letters, 61 selfloop transitions, 11 changer transitions 36/181 dead transitions. [2025-03-15 02:35:40,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 181 transitions, 1480 flow [2025-03-15 02:35:40,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:35:40,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:35:40,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 653 transitions. [2025-03-15 02:35:40,864 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5758377425044092 [2025-03-15 02:35:40,864 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 18 predicate places. [2025-03-15 02:35:40,864 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 181 transitions, 1480 flow [2025-03-15 02:35:40,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.16666666666667) internal successors, (535), 6 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:40,864 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:40,865 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:40,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:35:40,865 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:40,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1194895172, now seen corresponding path program 1 times [2025-03-15 02:35:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:40,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396522674] [2025-03-15 02:35:40,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:40,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:41,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:41,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396522674] [2025-03-15 02:35:41,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396522674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:41,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:41,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:35:41,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412348330] [2025-03-15 02:35:41,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:41,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:35:41,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:41,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:35:41,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:35:41,062 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2025-03-15 02:35:41,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 181 transitions, 1480 flow. Second operand has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:41,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:41,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2025-03-15 02:35:41,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:41,243 INFO L124 PetriNetUnfolderBase]: 58/501 cut-off events. [2025-03-15 02:35:41,244 INFO L125 PetriNetUnfolderBase]: For 1952/2033 co-relation queries the response was YES. [2025-03-15 02:35:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1983 conditions, 501 events. 58/501 cut-off events. For 1952/2033 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2600 event pairs, 4 based on Foata normal form. 5/450 useless extension candidates. Maximal degree in co-relation 1316. Up to 170 conditions per place. [2025-03-15 02:35:41,246 INFO L140 encePairwiseOnDemand]: 145/162 looper letters, 44 selfloop transitions, 13 changer transitions 81/210 dead transitions. [2025-03-15 02:35:41,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 210 transitions, 2122 flow [2025-03-15 02:35:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:35:41,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:35:41,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 841 transitions. [2025-03-15 02:35:41,248 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5768175582990398 [2025-03-15 02:35:41,250 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 26 predicate places. [2025-03-15 02:35:41,250 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 210 transitions, 2122 flow [2025-03-15 02:35:41,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.28571428571429) internal successors, (618), 7 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:41,251 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:41,251 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:41,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:35:41,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:41,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:41,252 INFO L85 PathProgramCache]: Analyzing trace with hash -2051939455, now seen corresponding path program 1 times [2025-03-15 02:35:41,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:41,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840795032] [2025-03-15 02:35:41,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:41,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:41,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:41,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:41,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:41,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840795032] [2025-03-15 02:35:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840795032] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:35:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613753043] [2025-03-15 02:35:41,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:35:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:35:41,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-15 02:35:41,447 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 162 [2025-03-15 02:35:41,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 210 transitions, 2122 flow. Second operand has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:41,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:41,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 162 [2025-03-15 02:35:41,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:41,675 INFO L124 PetriNetUnfolderBase]: 115/931 cut-off events. [2025-03-15 02:35:41,675 INFO L125 PetriNetUnfolderBase]: For 6667/7817 co-relation queries the response was YES. [2025-03-15 02:35:41,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 931 events. 115/931 cut-off events. For 6667/7817 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 6838 event pairs, 17 based on Foata normal form. 14/838 useless extension candidates. Maximal degree in co-relation 2201. Up to 310 conditions per place. [2025-03-15 02:35:41,682 INFO L140 encePairwiseOnDemand]: 151/162 looper letters, 48 selfloop transitions, 6 changer transitions 148/275 dead transitions. [2025-03-15 02:35:41,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 275 transitions, 3377 flow [2025-03-15 02:35:41,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-15 02:35:41,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-15 02:35:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 820 transitions. [2025-03-15 02:35:41,684 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5624142661179699 [2025-03-15 02:35:41,684 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 34 predicate places. [2025-03-15 02:35:41,684 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 275 transitions, 3377 flow [2025-03-15 02:35:41,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.83333333333333) internal successors, (533), 6 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:41,685 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:35:41,685 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:41,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:35:41,685 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-15 02:35:41,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:35:41,686 INFO L85 PathProgramCache]: Analyzing trace with hash 2122520153, now seen corresponding path program 1 times [2025-03-15 02:35:41,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:35:41,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219253158] [2025-03-15 02:35:41,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:35:41,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:35:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:35:41,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:35:41,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:35:41,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219253158] [2025-03-15 02:35:41,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219253158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:35:41,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:35:41,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-15 02:35:41,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516467779] [2025-03-15 02:35:41,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:35:41,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:35:41,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:35:41,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:35:41,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:35:41,822 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 162 [2025-03-15 02:35:41,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 275 transitions, 3377 flow. Second operand has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:41,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:35:41,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 162 [2025-03-15 02:35:41,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:35:42,058 INFO L124 PetriNetUnfolderBase]: 136/1033 cut-off events. [2025-03-15 02:35:42,058 INFO L125 PetriNetUnfolderBase]: For 8020/8877 co-relation queries the response was YES. [2025-03-15 02:35:42,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4803 conditions, 1033 events. 136/1033 cut-off events. For 8020/8877 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7837 event pairs, 18 based on Foata normal form. 45/959 useless extension candidates. Maximal degree in co-relation 3474. Up to 373 conditions per place. [2025-03-15 02:35:42,062 INFO L140 encePairwiseOnDemand]: 147/162 looper letters, 0 selfloop transitions, 0 changer transitions 326/326 dead transitions. [2025-03-15 02:35:42,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 326 transitions, 4676 flow [2025-03-15 02:35:42,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-15 02:35:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-15 02:35:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 922 transitions. [2025-03-15 02:35:42,064 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5691358024691358 [2025-03-15 02:35:42,064 INFO L298 CegarLoopForPetriNet]: 158 programPoint places, 41 predicate places. [2025-03-15 02:35:42,065 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 326 transitions, 4676 flow [2025-03-15 02:35:42,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 88.14285714285714) internal successors, (617), 7 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:35:42,070 INFO L161 wickiGriesTestDumper]: Dumping Owicki-Gries test to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/parallel-bluetooth.wvr.c_petrified1_AllErrorsAtOnce [2025-03-15 02:35:42,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2025-03-15 02:35:42,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2025-03-15 02:35:42,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2025-03-15 02:35:42,093 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2025-03-15 02:35:42,094 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2025-03-15 02:35:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:35:42,094 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:35:42,099 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 02:35:42,099 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 02:35:42,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 02:35:42 BasicIcfg [2025-03-15 02:35:42,105 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 02:35:42,105 INFO L158 Benchmark]: Toolchain (without parser) took 4388.97ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 44.3MB in the beginning and 88.4MB in the end (delta: -44.0MB). Peak memory consumption was 33.1MB. Max. memory is 8.0GB. [2025-03-15 02:35:42,105 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:35:42,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.57ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-03-15 02:35:42,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.78ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 31.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:35:42,106 INFO L158 Benchmark]: Boogie Preprocessor took 30.43ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 02:35:42,106 INFO L158 Benchmark]: RCFGBuilder took 391.31ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 38.8MB in the end (delta: -8.5MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. [2025-03-15 02:35:42,106 INFO L158 Benchmark]: TraceAbstraction took 3747.82ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 37.5MB in the beginning and 88.4MB in the end (delta: -50.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2025-03-15 02:35:42,109 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 71.3MB. Free memory is still 33.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.57ms. Allocated memory is still 71.3MB. Free memory was 44.2MB in the beginning and 32.9MB in the end (delta: 11.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.78ms. Allocated memory is still 71.3MB. Free memory was 32.9MB in the beginning and 31.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 30.43ms. Allocated memory is still 71.3MB. Free memory was 31.3MB in the beginning and 30.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 391.31ms. Allocated memory is still 71.3MB. Free memory was 30.2MB in the beginning and 38.8MB in the end (delta: -8.5MB). Peak memory consumption was 15.2MB. Max. memory is 8.0GB. * TraceAbstraction took 3747.82ms. Allocated memory was 71.3MB in the beginning and 146.8MB in the end (delta: 75.5MB). Free memory was 37.5MB in the beginning and 88.4MB in the end (delta: -50.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 55]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 194 locations, 18 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.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 286 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 286 mSDsluCounter, 706 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 350 mSDsCounter, 95 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 836 IncrementalHoareTripleChecker+Invalid, 931 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 95 mSolverCounterUnsat, 356 mSDtfsCounter, 836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4676occurred in iteration=10, InterpolantAutomatonStates: 68, 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.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 917 NumberOfCodeBlocks, 917 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 907 ConstructedInterpolants, 0 QuantifiedInterpolants, 2283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-15 02:35:42,123 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...