/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-parallel-sum-2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 02:36:43,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 02:36:43,982 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:36:44,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 02:36:44,011 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 02:36:44,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 02:36:44,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 02:36:44,012 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 02:36:44,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 02:36:44,013 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:36:44,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 02:36:44,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 02:36:44,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 02:36:44,014 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:36:44,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 02:36:44,291 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 02:36:44,293 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 02:36:44,295 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 02:36:44,295 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 02:36:44,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-03-15 02:36:46,068 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa325b7/8179cb6bcc6940da96c5e8a5ec45d1d7/FLAG744699023 [2025-03-15 02:36:46,269 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 02:36:46,269 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-parallel-sum-2.wvr.c [2025-03-15 02:36:46,276 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa325b7/8179cb6bcc6940da96c5e8a5ec45d1d7/FLAG744699023 [2025-03-15 02:36:46,293 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52fa325b7/8179cb6bcc6940da96c5e8a5ec45d1d7 [2025-03-15 02:36:46,296 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 02:36:46,298 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 02:36:46,299 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 02:36:46,299 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 02:36:46,303 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 02:36:46,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38f782da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46, skipping insertion in model container [2025-03-15 02:36:46,305 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,322 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 02:36:46,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:36:46,481 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 02:36:46,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 02:36:46,526 INFO L204 MainTranslator]: Completed translation [2025-03-15 02:36:46,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46 WrapperNode [2025-03-15 02:36:46,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 02:36:46,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 02:36:46,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 02:36:46,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 02:36:46,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,571 INFO L138 Inliner]: procedures = 28, calls = 59, calls flagged for inlining = 23, calls inlined = 33, statements flattened = 468 [2025-03-15 02:36:46,571 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 02:36:46,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 02:36:46,572 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 02:36:46,572 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 02:36:46,581 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,599 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,604 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,612 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,628 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 02:36:46,628 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 02:36:46,628 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 02:36:46,629 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 02:36:46,629 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (1/1) ... [2025-03-15 02:36:46,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 02:36:46,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:36:46,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 02:36:46,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 02:36:46,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-15 02:36:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-15 02:36:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-15 02:36:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-15 02:36:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-03-15 02:36:46,683 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-03-15 02:36:46,683 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-03-15 02:36:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-03-15 02:36:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-15 02:36:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-15 02:36:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-15 02:36:46,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 02:36:46,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 02:36:46,685 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 02:36:46,808 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 02:36:46,810 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 02:36:47,362 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 02:36:47,362 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 02:36:47,801 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 02:36:47,801 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-03-15 02:36:47,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:36:47 BoogieIcfgContainer [2025-03-15 02:36:47,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 02:36:47,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 02:36:47,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 02:36:47,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 02:36:47,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 02:36:46" (1/3) ... [2025-03-15 02:36:47,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596cb4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:36:47, skipping insertion in model container [2025-03-15 02:36:47,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 02:36:46" (2/3) ... [2025-03-15 02:36:47,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@596cb4ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 02:36:47, skipping insertion in model container [2025-03-15 02:36:47,809 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 02:36:47" (3/3) ... [2025-03-15 02:36:47,810 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-2.wvr.c [2025-03-15 02:36:47,822 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 02:36:47,824 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-2.wvr.c that has 7 procedures, 305 locations, 1 initial locations, 5 loop locations, and 48 error locations. [2025-03-15 02:36:47,824 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 02:36:48,037 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-03-15 02:36:48,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 02:36:48,086 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;@770d975f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 02:36:48,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 102 error locations. [2025-03-15 02:36:48,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 02:36:48,120 INFO L124 PetriNetUnfolderBase]: 1/80 cut-off events. [2025-03-15 02:36:48,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 02:36:48,122 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:48,122 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] [2025-03-15 02:36:48,123 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:36:48,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:48,128 INFO L85 PathProgramCache]: Analyzing trace with hash 851209745, now seen corresponding path program 1 times [2025-03-15 02:36:48,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:48,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209651622] [2025-03-15 02:36:48,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:48,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:48,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:48,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209651622] [2025-03-15 02:36:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209651622] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:36:48,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848031675] [2025-03-15 02:36:48,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:48,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:36:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:48,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:36:48,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:36:48,419 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 366 [2025-03-15 02:36:48,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 362 transitions, 790 flow. Second operand has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:48,425 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:48,425 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 366 [2025-03-15 02:36:48,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:36:58,121 INFO L124 PetriNetUnfolderBase]: 47677/76353 cut-off events. [2025-03-15 02:36:58,121 INFO L125 PetriNetUnfolderBase]: For 15375/15375 co-relation queries the response was YES. [2025-03-15 02:36:58,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148778 conditions, 76353 events. 47677/76353 cut-off events. For 15375/15375 co-relation queries the response was YES. Maximal size of possible extension queue 5666. Compared 682959 event pairs, 28360 based on Foata normal form. 8684/41014 useless extension candidates. Maximal degree in co-relation 147653. Up to 59289 conditions per place. [2025-03-15 02:36:58,988 INFO L140 encePairwiseOnDemand]: 338/366 looper letters, 67 selfloop transitions, 3 changer transitions 13/287 dead transitions. [2025-03-15 02:36:58,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 287 transitions, 764 flow [2025-03-15 02:36:58,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:36:58,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:36:58,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1068 transitions. [2025-03-15 02:36:58,999 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7295081967213115 [2025-03-15 02:36:59,001 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -59 predicate places. [2025-03-15 02:36:59,002 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 287 transitions, 764 flow [2025-03-15 02:36:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 245.0) internal successors, (980), 4 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:59,002 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:36:59,002 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] [2025-03-15 02:36:59,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 02:36:59,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:36:59,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:36:59,003 INFO L85 PathProgramCache]: Analyzing trace with hash 617699753, now seen corresponding path program 1 times [2025-03-15 02:36:59,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:36:59,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904205871] [2025-03-15 02:36:59,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:36:59,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:36:59,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:36:59,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:36:59,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:36:59,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904205871] [2025-03-15 02:36:59,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904205871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:36:59,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:36:59,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-15 02:36:59,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891600296] [2025-03-15 02:36:59,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:36:59,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-15 02:36:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:36:59,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-15 02:36:59,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-15 02:36:59,193 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 366 [2025-03-15 02:36:59,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 287 transitions, 764 flow. Second operand has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-15 02:36:59,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:36:59,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 366 [2025-03-15 02:36:59,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:04,997 INFO L124 PetriNetUnfolderBase]: 29888/49822 cut-off events. [2025-03-15 02:37:04,997 INFO L125 PetriNetUnfolderBase]: For 17558/55176 co-relation queries the response was YES. [2025-03-15 02:37:05,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135184 conditions, 49822 events. 29888/49822 cut-off events. For 17558/55176 co-relation queries the response was YES. Maximal size of possible extension queue 3345. Compared 439517 event pairs, 18721 based on Foata normal form. 0/23342 useless extension candidates. Maximal degree in co-relation 133906. Up to 37803 conditions per place. [2025-03-15 02:37:05,585 INFO L140 encePairwiseOnDemand]: 356/366 looper letters, 79 selfloop transitions, 5 changer transitions 13/282 dead transitions. [2025-03-15 02:37:05,585 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 299 places, 282 transitions, 936 flow [2025-03-15 02:37:05,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:37:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:37:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1171 transitions. [2025-03-15 02:37:05,588 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6398907103825137 [2025-03-15 02:37:05,589 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -60 predicate places. [2025-03-15 02:37:05,589 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 282 transitions, 936 flow [2025-03-15 02:37:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 216.0) internal successors, (1080), 5 states have internal predecessors, (1080), 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:37:05,589 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:05,590 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:05,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 02:37:05,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:05,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:05,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1187555605, now seen corresponding path program 1 times [2025-03-15 02:37:05,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:05,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62556087] [2025-03-15 02:37:05,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:05,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:05,702 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:37:05,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:05,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62556087] [2025-03-15 02:37:05,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62556087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:05,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:05,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:37:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007116994] [2025-03-15 02:37:05,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:05,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:37:05,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:05,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:37:05,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:37:05,705 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 366 [2025-03-15 02:37:05,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 282 transitions, 936 flow. Second operand has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 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:37:05,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:05,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 366 [2025-03-15 02:37:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:11,930 INFO L124 PetriNetUnfolderBase]: 29889/49834 cut-off events. [2025-03-15 02:37:11,931 INFO L125 PetriNetUnfolderBase]: For 27818/102626 co-relation queries the response was YES. [2025-03-15 02:37:12,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172814 conditions, 49834 events. 29889/49834 cut-off events. For 27818/102626 co-relation queries the response was YES. Maximal size of possible extension queue 3345. Compared 439586 event pairs, 18721 based on Foata normal form. 0/23353 useless extension candidates. Maximal degree in co-relation 171198. Up to 37803 conditions per place. [2025-03-15 02:37:12,722 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 71 selfloop transitions, 5 changer transitions 13/291 dead transitions. [2025-03-15 02:37:12,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 291 transitions, 1108 flow [2025-03-15 02:37:12,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-15 02:37:12,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-15 02:37:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1309 transitions. [2025-03-15 02:37:12,725 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7153005464480874 [2025-03-15 02:37:12,725 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -56 predicate places. [2025-03-15 02:37:12,726 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 1108 flow [2025-03-15 02:37:12,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 247.5) internal successors, (990), 4 states have internal predecessors, (990), 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:37:12,726 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:12,727 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:12,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 02:37:12,730 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:12,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1971281644, now seen corresponding path program 1 times [2025-03-15 02:37:12,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:12,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512570066] [2025-03-15 02:37:12,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:12,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:12,882 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:12,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512570066] [2025-03-15 02:37:12,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512570066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:37:12,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289131269] [2025-03-15 02:37:12,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:12,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:12,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:37:12,890 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:37:12,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-15 02:37:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:13,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:37:13,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:37:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:13,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-15 02:37:13,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1289131269] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:13,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-15 02:37:13,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-15 02:37:13,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139737] [2025-03-15 02:37:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:13,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-15 02:37:13,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:13,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-15 02:37:13,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-15 02:37:13,115 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 366 [2025-03-15 02:37:13,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 1108 flow. Second operand has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 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:37:13,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:13,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 366 [2025-03-15 02:37:13,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:19,306 INFO L124 PetriNetUnfolderBase]: 29889/49833 cut-off events. [2025-03-15 02:37:19,306 INFO L125 PetriNetUnfolderBase]: For 41990/153838 co-relation queries the response was YES. [2025-03-15 02:37:19,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210429 conditions, 49833 events. 29889/49833 cut-off events. For 41990/153838 co-relation queries the response was YES. Maximal size of possible extension queue 3345. Compared 439342 event pairs, 18721 based on Foata normal form. 0/23353 useless extension candidates. Maximal degree in co-relation 208490. Up to 37803 conditions per place. [2025-03-15 02:37:20,196 INFO L140 encePairwiseOnDemand]: 360/366 looper letters, 67 selfloop transitions, 8 changer transitions 13/290 dead transitions. [2025-03-15 02:37:20,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 290 transitions, 1256 flow [2025-03-15 02:37:20,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-15 02:37:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-15 02:37:20,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1799 transitions. [2025-03-15 02:37:20,200 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7021857923497268 [2025-03-15 02:37:20,200 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -51 predicate places. [2025-03-15 02:37:20,200 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 290 transitions, 1256 flow [2025-03-15 02:37:20,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 248.16666666666666) internal successors, (1489), 6 states have internal predecessors, (1489), 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:37:20,201 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:20,201 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-15 02:37:20,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:20,406 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash 980190389, now seen corresponding path program 1 times [2025-03-15 02:37:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117014128] [2025-03-15 02:37:20,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:20,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117014128] [2025-03-15 02:37:20,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117014128] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:37:20,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543456779] [2025-03-15 02:37:20,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:20,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:20,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:37:20,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:37:20,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-15 02:37:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:20,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-15 02:37:20,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:37:20,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:20,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:37:20,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:37:20,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543456779] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:37:20,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:37:20,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-15 02:37:20,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222085443] [2025-03-15 02:37:20,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:37:20,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 02:37:20,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:20,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 02:37:20,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-15 02:37:20,779 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 366 [2025-03-15 02:37:20,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 290 transitions, 1256 flow. Second operand has 12 states, 12 states have (on average 248.83333333333334) internal successors, (2986), 12 states have internal predecessors, (2986), 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:37:20,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:20,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 366 [2025-03-15 02:37:20,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:27,277 INFO L124 PetriNetUnfolderBase]: 29892/49868 cut-off events. [2025-03-15 02:37:27,277 INFO L125 PetriNetUnfolderBase]: For 60092/208980 co-relation queries the response was YES. [2025-03-15 02:37:27,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248159 conditions, 49868 events. 29892/49868 cut-off events. For 60092/208980 co-relation queries the response was YES. Maximal size of possible extension queue 3345. Compared 439839 event pairs, 18721 based on Foata normal form. 0/23385 useless extension candidates. Maximal degree in co-relation 245782. Up to 37803 conditions per place. [2025-03-15 02:37:28,208 INFO L140 encePairwiseOnDemand]: 359/366 looper letters, 83 selfloop transitions, 18 changer transitions 13/316 dead transitions. [2025-03-15 02:37:28,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 1616 flow [2025-03-15 02:37:28,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-15 02:37:28,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-15 02:37:28,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 3549 transitions. [2025-03-15 02:37:28,214 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6926229508196722 [2025-03-15 02:37:28,214 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -38 predicate places. [2025-03-15 02:37:28,215 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 316 transitions, 1616 flow [2025-03-15 02:37:28,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 248.83333333333334) internal successors, (2986), 12 states have internal predecessors, (2986), 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:37:28,216 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:28,216 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:28,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-15 02:37:28,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:37:28,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1309400911, now seen corresponding path program 1 times [2025-03-15 02:37:28,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:28,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289559332] [2025-03-15 02:37:28,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:28,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:28,560 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:37:28,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:28,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289559332] [2025-03-15 02:37:28,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289559332] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:28,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:28,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:37:28,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033379051] [2025-03-15 02:37:28,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:28,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:37:28,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:28,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:37:28,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:37:28,563 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 366 [2025-03-15 02:37:28,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 316 transitions, 1616 flow. Second operand has 4 states, 4 states have (on average 252.5) internal successors, (1010), 4 states have internal predecessors, (1010), 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:37:28,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:28,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 366 [2025-03-15 02:37:28,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:34,120 INFO L124 PetriNetUnfolderBase]: 22965/39178 cut-off events. [2025-03-15 02:37:34,120 INFO L125 PetriNetUnfolderBase]: For 68919/236431 co-relation queries the response was YES. [2025-03-15 02:37:34,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223214 conditions, 39178 events. 22965/39178 cut-off events. For 68919/236431 co-relation queries the response was YES. Maximal size of possible extension queue 2435. Compared 342239 event pairs, 14887 based on Foata normal form. 0/19491 useless extension candidates. Maximal degree in co-relation 220527. Up to 29377 conditions per place. [2025-03-15 02:37:34,692 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 56 selfloop transitions, 3 changer transitions 13/314 dead transitions. [2025-03-15 02:37:34,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 314 transitions, 1712 flow [2025-03-15 02:37:34,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:37:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:37:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1062 transitions. [2025-03-15 02:37:34,694 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7254098360655737 [2025-03-15 02:37:34,695 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -37 predicate places. [2025-03-15 02:37:34,695 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 314 transitions, 1712 flow [2025-03-15 02:37:34,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.5) internal successors, (1010), 4 states have internal predecessors, (1010), 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:37:34,695 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:34,695 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:34,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 02:37:34,696 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:34,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:34,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1936724258, now seen corresponding path program 1 times [2025-03-15 02:37:34,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:34,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821358460] [2025-03-15 02:37:34,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:34,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:34,875 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:37:34,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:34,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821358460] [2025-03-15 02:37:34,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821358460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:34,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:34,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:37:34,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187659519] [2025-03-15 02:37:34,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:34,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:37:34,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:34,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:37:34,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:37:34,877 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 366 [2025-03-15 02:37:34,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 314 transitions, 1712 flow. Second operand has 4 states, 4 states have (on average 254.75) internal successors, (1019), 4 states have internal predecessors, (1019), 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:37:34,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:34,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 366 [2025-03-15 02:37:34,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:39,541 INFO L124 PetriNetUnfolderBase]: 20339/34703 cut-off events. [2025-03-15 02:37:39,541 INFO L125 PetriNetUnfolderBase]: For 82296/259470 co-relation queries the response was YES. [2025-03-15 02:37:39,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223305 conditions, 34703 events. 20339/34703 cut-off events. For 82296/259470 co-relation queries the response was YES. Maximal size of possible extension queue 2155. Compared 297796 event pairs, 12917 based on Foata normal form. 0/17644 useless extension candidates. Maximal degree in co-relation 220308. Up to 25950 conditions per place. [2025-03-15 02:37:40,276 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 53 selfloop transitions, 3 changer transitions 13/312 dead transitions. [2025-03-15 02:37:40,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 312 transitions, 1798 flow [2025-03-15 02:37:40,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:37:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:37:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1067 transitions. [2025-03-15 02:37:40,282 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7288251366120219 [2025-03-15 02:37:40,282 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -36 predicate places. [2025-03-15 02:37:40,282 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 312 transitions, 1798 flow [2025-03-15 02:37:40,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 4 states have internal predecessors, (1019), 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:37:40,283 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:40,283 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:40,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 02:37:40,283 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:40,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1936724259, now seen corresponding path program 1 times [2025-03-15 02:37:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:40,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175416496] [2025-03-15 02:37:40,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:40,426 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:37:40,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:40,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175416496] [2025-03-15 02:37:40,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175416496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:40,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:40,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:37:40,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069435219] [2025-03-15 02:37:40,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:40,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:37:40,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:40,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:37:40,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:37:40,428 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 366 [2025-03-15 02:37:40,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 312 transitions, 1798 flow. Second operand has 4 states, 4 states have (on average 254.75) internal successors, (1019), 4 states have internal predecessors, (1019), 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:37:40,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:40,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 366 [2025-03-15 02:37:40,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:44,790 INFO L124 PetriNetUnfolderBase]: 17713/30228 cut-off events. [2025-03-15 02:37:44,790 INFO L125 PetriNetUnfolderBase]: For 94026/274120 co-relation queries the response was YES. [2025-03-15 02:37:44,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216560 conditions, 30228 events. 17713/30228 cut-off events. For 94026/274120 co-relation queries the response was YES. Maximal size of possible extension queue 1875. Compared 253458 event pairs, 10947 based on Foata normal form. 0/15797 useless extension candidates. Maximal degree in co-relation 213253. Up to 22523 conditions per place. [2025-03-15 02:37:45,316 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 51 selfloop transitions, 3 changer transitions 13/310 dead transitions. [2025-03-15 02:37:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 310 transitions, 1876 flow [2025-03-15 02:37:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:37:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:37:45,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1065 transitions. [2025-03-15 02:37:45,319 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7274590163934426 [2025-03-15 02:37:45,321 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -35 predicate places. [2025-03-15 02:37:45,321 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 310 transitions, 1876 flow [2025-03-15 02:37:45,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 254.75) internal successors, (1019), 4 states have internal predecessors, (1019), 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:37:45,322 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:45,322 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 02:37:45,322 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:45,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:45,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1936724255, now seen corresponding path program 1 times [2025-03-15 02:37:45,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:45,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978075553] [2025-03-15 02:37:45,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:45,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:45,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:45,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 02:37:45,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:45,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978075553] [2025-03-15 02:37:45,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978075553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:45,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:45,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 02:37:45,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338217375] [2025-03-15 02:37:45,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:45,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 02:37:45,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:45,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 02:37:45,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-15 02:37:45,917 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 366 [2025-03-15 02:37:45,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 310 transitions, 1876 flow. Second operand has 11 states, 11 states have (on average 201.1818181818182) internal successors, (2213), 11 states have internal predecessors, (2213), 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:37:45,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:45,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 366 [2025-03-15 02:37:45,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:37:53,950 INFO L124 PetriNetUnfolderBase]: 28852/48967 cut-off events. [2025-03-15 02:37:53,950 INFO L125 PetriNetUnfolderBase]: For 135660/196160 co-relation queries the response was YES. [2025-03-15 02:37:54,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 397869 conditions, 48967 events. 28852/48967 cut-off events. For 135660/196160 co-relation queries the response was YES. Maximal size of possible extension queue 2546. Compared 443512 event pairs, 8064 based on Foata normal form. 548/27433 useless extension candidates. Maximal degree in co-relation 345124. Up to 37721 conditions per place. [2025-03-15 02:37:54,800 INFO L140 encePairwiseOnDemand]: 341/366 looper letters, 223 selfloop transitions, 17 changer transitions 38/456 dead transitions. [2025-03-15 02:37:54,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 456 transitions, 4706 flow [2025-03-15 02:37:54,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-15 02:37:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-15 02:37:54,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3817 transitions. [2025-03-15 02:37:54,805 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5793867638129934 [2025-03-15 02:37:54,805 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -18 predicate places. [2025-03-15 02:37:54,805 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 456 transitions, 4706 flow [2025-03-15 02:37:54,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 201.1818181818182) internal successors, (2213), 11 states have internal predecessors, (2213), 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:37:54,806 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:37:54,807 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:37:54,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 02:37:54,807 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread5Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:37:54,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:37:54,807 INFO L85 PathProgramCache]: Analyzing trace with hash 810667746, now seen corresponding path program 1 times [2025-03-15 02:37:54,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:37:54,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110038513] [2025-03-15 02:37:54,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:37:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:37:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:37:54,866 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:37:54,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:37:54,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110038513] [2025-03-15 02:37:54,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110038513] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:37:54,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:37:54,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-15 02:37:54,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933349847] [2025-03-15 02:37:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:37:54,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-15 02:37:54,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:37:54,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-15 02:37:54,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-15 02:37:54,868 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 366 [2025-03-15 02:37:54,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 456 transitions, 4706 flow. Second operand has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 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:37:54,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:37:54,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 366 [2025-03-15 02:37:54,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:01,419 INFO L124 PetriNetUnfolderBase]: 21868/38443 cut-off events. [2025-03-15 02:38:01,420 INFO L125 PetriNetUnfolderBase]: For 141045/205413 co-relation queries the response was YES. [2025-03-15 02:38:01,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333950 conditions, 38443 events. 21868/38443 cut-off events. For 141045/205413 co-relation queries the response was YES. Maximal size of possible extension queue 1880. Compared 345975 event pairs, 5980 based on Foata normal form. 0/22424 useless extension candidates. Maximal degree in co-relation 289928. Up to 28819 conditions per place. [2025-03-15 02:38:02,220 INFO L140 encePairwiseOnDemand]: 361/366 looper letters, 155 selfloop transitions, 3 changer transitions 38/448 dead transitions. [2025-03-15 02:38:02,220 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 448 transitions, 4870 flow [2025-03-15 02:38:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-15 02:38:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-15 02:38:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1056 transitions. [2025-03-15 02:38:02,222 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7213114754098361 [2025-03-15 02:38:02,223 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -17 predicate places. [2025-03-15 02:38:02,223 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 448 transitions, 4870 flow [2025-03-15 02:38:02,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 252.75) internal successors, (1011), 4 states have internal predecessors, (1011), 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:38:02,223 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:02,223 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:38:02,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 02:38:02,223 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread5Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:38:02,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:02,224 INFO L85 PathProgramCache]: Analyzing trace with hash -639101898, now seen corresponding path program 1 times [2025-03-15 02:38:02,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:02,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057389562] [2025-03-15 02:38:02,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:02,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:02,488 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:38:02,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:02,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057389562] [2025-03-15 02:38:02,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057389562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 02:38:02,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 02:38:02,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 02:38:02,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323139044] [2025-03-15 02:38:02,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 02:38:02,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-15 02:38:02,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:02,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-15 02:38:02,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-15 02:38:02,491 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 366 [2025-03-15 02:38:02,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 448 transitions, 4870 flow. Second operand has 11 states, 11 states have (on average 201.27272727272728) internal successors, (2214), 11 states have internal predecessors, (2214), 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:38:02,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:02,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 366 [2025-03-15 02:38:02,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:08,868 INFO L124 PetriNetUnfolderBase]: 19682/34073 cut-off events. [2025-03-15 02:38:08,868 INFO L125 PetriNetUnfolderBase]: For 146678/220292 co-relation queries the response was YES. [2025-03-15 02:38:08,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322922 conditions, 34073 events. 19682/34073 cut-off events. For 146678/220292 co-relation queries the response was YES. Maximal size of possible extension queue 1692. Compared 294700 event pairs, 5401 based on Foata normal form. 220/19980 useless extension candidates. Maximal degree in co-relation 314971. Up to 25650 conditions per place. [2025-03-15 02:38:09,617 INFO L140 encePairwiseOnDemand]: 345/366 looper letters, 172 selfloop transitions, 16 changer transitions 30/396 dead transitions. [2025-03-15 02:38:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 396 transitions, 4257 flow [2025-03-15 02:38:09,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-15 02:38:09,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-15 02:38:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3550 transitions. [2025-03-15 02:38:09,622 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5705560912889746 [2025-03-15 02:38:09,622 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, -2 predicate places. [2025-03-15 02:38:09,622 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 396 transitions, 4257 flow [2025-03-15 02:38:09,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 201.27272727272728) internal successors, (2214), 11 states have internal predecessors, (2214), 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:38:09,623 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:09,623 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:38:09,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 02:38:09,623 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:38:09,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:09,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1687837758, now seen corresponding path program 1 times [2025-03-15 02:38:09,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:09,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834353626] [2025-03-15 02:38:09,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:09,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:09,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:09,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:09,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834353626] [2025-03-15 02:38:09,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834353626] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:38:09,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958740064] [2025-03-15 02:38:09,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:09,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:09,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:09,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:38:09,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-15 02:38:10,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:10,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:38:10,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:38:10,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:10,353 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:10,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958740064] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:10,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:10,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 30 [2025-03-15 02:38:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638162508] [2025-03-15 02:38:10,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-15 02:38:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:10,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-15 02:38:10,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2025-03-15 02:38:10,590 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 366 [2025-03-15 02:38:10,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 396 transitions, 4257 flow. Second operand has 30 states, 30 states have (on average 196.56666666666666) internal successors, (5897), 30 states have internal predecessors, (5897), 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:38:10,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:10,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 366 [2025-03-15 02:38:10,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:18,224 INFO L124 PetriNetUnfolderBase]: 21987/39016 cut-off events. [2025-03-15 02:38:18,224 INFO L125 PetriNetUnfolderBase]: For 200271/278067 co-relation queries the response was YES. [2025-03-15 02:38:18,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395053 conditions, 39016 events. 21987/39016 cut-off events. For 200271/278067 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 353152 event pairs, 6060 based on Foata normal form. 652/23533 useless extension candidates. Maximal degree in co-relation 340014. Up to 29053 conditions per place. [2025-03-15 02:38:19,133 INFO L140 encePairwiseOnDemand]: 334/366 looper letters, 239 selfloop transitions, 39 changer transitions 47/488 dead transitions. [2025-03-15 02:38:19,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 488 transitions, 6794 flow [2025-03-15 02:38:19,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-15 02:38:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-15 02:38:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 5454 transitions. [2025-03-15 02:38:19,138 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5519125683060109 [2025-03-15 02:38:19,139 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, 24 predicate places. [2025-03-15 02:38:19,139 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 488 transitions, 6794 flow [2025-03-15 02:38:19,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 196.56666666666666) internal successors, (5897), 30 states have internal predecessors, (5897), 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:38:19,141 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:19,141 INFO L221 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:38:19,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-15 02:38:19,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:19,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:38:19,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -805630830, now seen corresponding path program 2 times [2025-03-15 02:38:19,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:19,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927870911] [2025-03-15 02:38:19,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:38:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:19,356 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:38:19,356 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:38:19,406 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:38:19,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927870911] [2025-03-15 02:38:19,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927870911] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:38:19,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255206923] [2025-03-15 02:38:19,407 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 02:38:19,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:19,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:19,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:38:19,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-15 02:38:19,512 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 02:38:19,512 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 02:38:19,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-15 02:38:19,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:38:19,597 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:38:19,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:19,678 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-15 02:38:19,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255206923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:19,678 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:19,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-03-15 02:38:19,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662855061] [2025-03-15 02:38:19,678 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:19,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-15 02:38:19,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:19,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-15 02:38:19,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-15 02:38:19,682 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 366 [2025-03-15 02:38:19,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 488 transitions, 6794 flow. Second operand has 7 states, 7 states have (on average 232.42857142857142) internal successors, (1627), 7 states have internal predecessors, (1627), 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:38:19,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:19,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 366 [2025-03-15 02:38:19,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:27,358 INFO L124 PetriNetUnfolderBase]: 21987/39015 cut-off events. [2025-03-15 02:38:27,358 INFO L125 PetriNetUnfolderBase]: For 231760/315608 co-relation queries the response was YES. [2025-03-15 02:38:27,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 424087 conditions, 39015 events. 21987/39015 cut-off events. For 231760/315608 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 353266 event pairs, 6060 based on Foata normal form. 0/22881 useless extension candidates. Maximal degree in co-relation 365057. Up to 29053 conditions per place. [2025-03-15 02:38:28,385 INFO L140 encePairwiseOnDemand]: 352/366 looper letters, 208 selfloop transitions, 31 changer transitions 47/487 dead transitions. [2025-03-15 02:38:28,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 487 transitions, 7272 flow [2025-03-15 02:38:28,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-15 02:38:28,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-15 02:38:28,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1907 transitions. [2025-03-15 02:38:28,387 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.6512978142076503 [2025-03-15 02:38:28,387 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, 30 predicate places. [2025-03-15 02:38:28,387 INFO L471 AbstractCegarLoop]: Abstraction has has 389 places, 487 transitions, 7272 flow [2025-03-15 02:38:28,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 232.42857142857142) internal successors, (1627), 7 states have internal predecessors, (1627), 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:38:28,388 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:28,388 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 02:38:28,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-15 02:38:28,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:28,593 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread5Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:38:28,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:28,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1630581739, now seen corresponding path program 1 times [2025-03-15 02:38:28,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:28,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154548098] [2025-03-15 02:38:28,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:28,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:28,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154548098] [2025-03-15 02:38:28,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154548098] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:38:28,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [705275681] [2025-03-15 02:38:28,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:28,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:28,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:28,897 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:38:28,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-15 02:38:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:29,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-15 02:38:29,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:38:29,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:29,257 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:29,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [705275681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:29,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:29,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 27 [2025-03-15 02:38:29,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104287146] [2025-03-15 02:38:29,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:29,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-15 02:38:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:29,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-15 02:38:29,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2025-03-15 02:38:29,448 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 366 [2025-03-15 02:38:29,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 389 places, 487 transitions, 7272 flow. Second operand has 27 states, 27 states have (on average 196.85185185185185) internal successors, (5315), 27 states have internal predecessors, (5315), 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:38:29,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:29,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 366 [2025-03-15 02:38:29,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 02:38:36,934 INFO L124 PetriNetUnfolderBase]: 19801/34645 cut-off events. [2025-03-15 02:38:36,935 INFO L125 PetriNetUnfolderBase]: For 234438/327452 co-relation queries the response was YES. [2025-03-15 02:38:37,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 403809 conditions, 34645 events. 19801/34645 cut-off events. For 234438/327452 co-relation queries the response was YES. Maximal size of possible extension queue 1705. Compared 301473 event pairs, 5481 based on Foata normal form. 220/20437 useless extension candidates. Maximal degree in co-relation 390100. Up to 25884 conditions per place. [2025-03-15 02:38:37,871 INFO L140 encePairwiseOnDemand]: 334/366 looper letters, 195 selfloop transitions, 38 changer transitions 39/435 dead transitions. [2025-03-15 02:38:37,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 435 transitions, 6469 flow [2025-03-15 02:38:37,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-15 02:38:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-03-15 02:38:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 4823 transitions. [2025-03-15 02:38:37,876 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5490664845173042 [2025-03-15 02:38:37,876 INFO L298 CegarLoopForPetriNet]: 359 programPoint places, 50 predicate places. [2025-03-15 02:38:37,876 INFO L471 AbstractCegarLoop]: Abstraction has has 409 places, 435 transitions, 6469 flow [2025-03-15 02:38:37,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 196.85185185185185) internal successors, (5315), 27 states have internal predecessors, (5315), 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:38:37,878 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 02:38:37,878 INFO L221 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-15 02:38:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-15 02:38:38,079 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 99 more)] === [2025-03-15 02:38:38,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 02:38:38,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1901366430, now seen corresponding path program 1 times [2025-03-15 02:38:38,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 02:38:38,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502588762] [2025-03-15 02:38:38,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 02:38:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 02:38:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502588762] [2025-03-15 02:38:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502588762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-15 02:38:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794393210] [2025-03-15 02:38:39,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 02:38:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-15 02:38:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 02:38:39,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-15 02:38:39,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-15 02:38:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 02:38:39,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-15 02:38:39,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-15 02:38:39,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-15 02:38:39,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-03-15 02:38:39,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:39,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-15 02:38:39,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-03-15 02:38:39,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-15 02:38:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 02:38:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794393210] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-15 02:38:40,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-15 02:38:40,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14, 13] total 45 [2025-03-15 02:38:40,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171712590] [2025-03-15 02:38:40,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-15 02:38:40,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-15 02:38:40,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 02:38:40,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-15 02:38:40,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1904, Unknown=0, NotChecked=0, Total=2070 [2025-03-15 02:38:40,032 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 366 [2025-03-15 02:38:40,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 409 places, 435 transitions, 6469 flow. Second operand has 46 states, 46 states have (on average 179.7608695652174) internal successors, (8269), 46 states have internal predecessors, (8269), 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:38:40,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 02:38:40,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 366 [2025-03-15 02:38:40,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand