/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 ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:35:42,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:35:42,101 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:35:42,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:35:42,108 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:35:42,128 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:35:42,129 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:35:42,129 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:35:42,129 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:35:42,129 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:35:42,129 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:35:42,129 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:35:42,129 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:35:42,129 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:35:42,129 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:35:42,130 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:35:42,130 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:35:42,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:42,131 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:42,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:35:42,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:35:42,132 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:35:42,132 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:35:42,342 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:35:42,349 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:35:42,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:35:42,352 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:35:42,352 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:35:42,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-04-13 19:35:43,653 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68060463c/55807a4e688d48cebc49fafd353f715e/FLAGcfa9b8a28 [2025-04-13 19:35:43,873 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:35:43,874 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-04-13 19:35:43,883 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68060463c/55807a4e688d48cebc49fafd353f715e/FLAGcfa9b8a28 [2025-04-13 19:35:45,755 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68060463c/55807a4e688d48cebc49fafd353f715e [2025-04-13 19:35:45,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:35:45,758 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:35:45,760 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:35:45,760 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:35:45,763 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:35:45,764 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:35:45" (1/1) ... [2025-04-13 19:35:45,764 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17308f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:45, skipping insertion in model container [2025-04-13 19:35:45,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:35:45" (1/1) ... [2025-04-13 19:35:45,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:35:45,973 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2025-04-13 19:35:46,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:35:46,173 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:35:46,188 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2025-04-13 19:35:46,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:35:46,254 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:35:46,256 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46 WrapperNode [2025-04-13 19:35:46,256 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:35:46,257 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:35:46,257 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:35:46,257 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:35:46,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,281 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,319 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-04-13 19:35:46,320 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:35:46,320 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:35:46,320 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:35:46,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:35:46,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,340 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,365 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 19:35:46,366 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,366 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,381 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,382 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,383 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,390 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:35:46,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:35:46,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:35:46,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:35:46,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (1/1) ... [2025-04-13 19:35:46,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:35:46,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:35:46,431 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:35:46,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:35:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:35:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:35:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:35:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:35:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:35:46,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:35:46,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:35:46,454 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:35:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:35:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:35:46,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:35:46,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:35:46,455 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:35:46,573 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:35:46,574 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:35:46,811 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:35:46,812 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:35:46,812 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:35:47,009 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:35:47,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:35:47 BoogieIcfgContainer [2025-04-13 19:35:47,009 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:35:47,011 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:35:47,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:35:47,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:35:47,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:35:45" (1/3) ... [2025-04-13 19:35:47,016 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e593f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:35:47, skipping insertion in model container [2025-04-13 19:35:47,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:35:46" (2/3) ... [2025-04-13 19:35:47,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e593f75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:35:47, skipping insertion in model container [2025-04-13 19:35:47,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:35:47" (3/3) ... [2025-04-13 19:35:47,017 INFO L128 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2025-04-13 19:35:47,029 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:35:47,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i that has 4 procedures, 36 locations, 32 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:35:47,030 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:35:47,071 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:35:47,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 19:35:47,124 INFO L116 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-04-13 19:35:47,125 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:35:47,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 32 events. 0/32 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 67 event pairs, 0 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:35:47,128 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 35 transitions, 82 flow [2025-04-13 19:35:47,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 42 places, 32 transitions, 73 flow [2025-04-13 19:35:47,139 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:35:47,149 INFO L340 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=LoopHeads, 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;@78683bcf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:35:47,149 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:35:47,154 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:35:47,154 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 19:35:47,154 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:35:47,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:47,154 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-13 19:35:47,155 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:47,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:47,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1965749108, now seen corresponding path program 1 times [2025-04-13 19:35:47,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:47,165 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655412036] [2025-04-13 19:35:47,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:47,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:47,231 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-13 19:35:47,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-13 19:35:47,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:47,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:47,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:47,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655412036] [2025-04-13 19:35:47,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655412036] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:47,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:47,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:35:47,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124632836] [2025-04-13 19:35:47,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:47,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:35:47,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:47,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:35:47,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:35:47,583 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-04-13 19:35:47,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-13 19:35:47,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:47,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-04-13 19:35:47,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:47,887 INFO L116 PetriNetUnfolderBase]: 528/977 cut-off events. [2025-04-13 19:35:47,888 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-13 19:35:47,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1825 conditions, 977 events. 528/977 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 5892 event pairs, 84 based on Foata normal form. 0/923 useless extension candidates. Maximal degree in co-relation 1814. Up to 652 conditions per place. [2025-04-13 19:35:47,901 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 27 selfloop transitions, 2 changer transitions 2/43 dead transitions. [2025-04-13 19:35:47,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 43 transitions, 160 flow [2025-04-13 19:35:47,903 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:35:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:35:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-04-13 19:35:47,912 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2025-04-13 19:35:47,913 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 73 flow. Second operand 3 states and 77 transitions. [2025-04-13 19:35:47,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 43 transitions, 160 flow [2025-04-13 19:35:47,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 43 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:47,921 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 70 flow [2025-04-13 19:35:47,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2025-04-13 19:35:47,925 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, -2 predicate places. [2025-04-13 19:35:47,925 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 70 flow [2025-04-13 19:35:47,925 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-04-13 19:35:47,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:47,925 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:47,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:35:47,926 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:47,927 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:47,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1120391222, now seen corresponding path program 1 times [2025-04-13 19:35:47,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:47,927 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329469919] [2025-04-13 19:35:47,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:47,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:35:47,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:35:47,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:47,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:48,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:48,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:48,243 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329469919] [2025-04-13 19:35:48,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329469919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:48,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:48,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:35:48,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071111394] [2025-04-13 19:35:48,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:48,244 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:48,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:48,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:48,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:48,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-13 19:35:48,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04-13 19:35:48,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:48,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-13 19:35:48,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:48,508 INFO L116 PetriNetUnfolderBase]: 834/1403 cut-off events. [2025-04-13 19:35:48,509 INFO L117 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2025-04-13 19:35:48,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2808 conditions, 1403 events. 834/1403 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8346 event pairs, 257 based on Foata normal form. 60/1448 useless extension candidates. Maximal degree in co-relation 2798. Up to 1057 conditions per place. [2025-04-13 19:35:48,517 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 27 selfloop transitions, 3 changer transitions 15/55 dead transitions. [2025-04-13 19:35:48,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 55 transitions, 218 flow [2025-04-13 19:35:48,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:48,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2025-04-13 19:35:48,520 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.64 [2025-04-13 19:35:48,520 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 70 flow. Second operand 5 states and 112 transitions. [2025-04-13 19:35:48,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 55 transitions, 218 flow [2025-04-13 19:35:48,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:48,523 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 93 flow [2025-04-13 19:35:48,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=93, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-04-13 19:35:48,524 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 2 predicate places. [2025-04-13 19:35:48,524 INFO L485 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 93 flow [2025-04-13 19:35:48,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-04-13 19:35:48,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:48,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:48,524 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:35:48,524 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:48,525 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:48,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1979073927, now seen corresponding path program 1 times [2025-04-13 19:35:48,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:48,525 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552871561] [2025-04-13 19:35:48,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:48,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:48,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:35:48,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:35:48,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:48,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:49,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:49,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:49,005 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552871561] [2025-04-13 19:35:49,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552871561] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:49,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:49,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:35:49,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958400002] [2025-04-13 19:35:49,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:49,006 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:49,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:49,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:49,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:49,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:49,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 19:35:49,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:49,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:49,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:49,517 INFO L116 PetriNetUnfolderBase]: 1832/2930 cut-off events. [2025-04-13 19:35:49,518 INFO L117 PetriNetUnfolderBase]: For 874/874 co-relation queries the response was YES. [2025-04-13 19:35:49,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6751 conditions, 2930 events. 1832/2930 cut-off events. For 874/874 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 17216 event pairs, 713 based on Foata normal form. 86/3010 useless extension candidates. Maximal degree in co-relation 6738. Up to 2046 conditions per place. [2025-04-13 19:35:49,535 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 32 selfloop transitions, 12 changer transitions 19/71 dead transitions. [2025-04-13 19:35:49,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 325 flow [2025-04-13 19:35:49,535 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:49,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:49,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-04-13 19:35:49,536 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2025-04-13 19:35:49,536 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 93 flow. Second operand 5 states and 117 transitions. [2025-04-13 19:35:49,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 325 flow [2025-04-13 19:35:49,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 316 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-13 19:35:49,544 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 202 flow [2025-04-13 19:35:49,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2025-04-13 19:35:49,545 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 6 predicate places. [2025-04-13 19:35:49,545 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 202 flow [2025-04-13 19:35:49,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 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-04-13 19:35:49,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:49,546 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:49,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:35:49,546 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:49,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:49,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1471781183, now seen corresponding path program 2 times [2025-04-13 19:35:49,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:49,547 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262347449] [2025-04-13 19:35:49,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:49,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:49,557 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:35:49,572 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:35:49,572 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:49,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:49,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:49,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:49,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262347449] [2025-04-13 19:35:49,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262347449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:49,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:49,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:35:49,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277934954] [2025-04-13 19:35:49,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:49,720 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:49,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:49,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:49,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:49,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-04-13 19:35:49,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04-13 19:35:49,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:49,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-04-13 19:35:49,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:50,109 INFO L116 PetriNetUnfolderBase]: 1914/3231 cut-off events. [2025-04-13 19:35:50,110 INFO L117 PetriNetUnfolderBase]: For 3748/3782 co-relation queries the response was YES. [2025-04-13 19:35:50,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10083 conditions, 3231 events. 1914/3231 cut-off events. For 3748/3782 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 21203 event pairs, 502 based on Foata normal form. 123/3312 useless extension candidates. Maximal degree in co-relation 10066. Up to 1590 conditions per place. [2025-04-13 19:35:50,129 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 39 selfloop transitions, 5 changer transitions 17/73 dead transitions. [2025-04-13 19:35:50,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 73 transitions, 468 flow [2025-04-13 19:35:50,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:50,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 114 transitions. [2025-04-13 19:35:50,132 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6514285714285715 [2025-04-13 19:35:50,132 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 202 flow. Second operand 5 states and 114 transitions. [2025-04-13 19:35:50,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 73 transitions, 468 flow [2025-04-13 19:35:50,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 420 flow, removed 7 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:50,147 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 191 flow [2025-04-13 19:35:50,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2025-04-13 19:35:50,148 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 8 predicate places. [2025-04-13 19:35:50,148 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 191 flow [2025-04-13 19:35:50,149 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-04-13 19:35:50,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:50,149 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:50,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:35:50,149 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:50,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash 305016400, now seen corresponding path program 1 times [2025-04-13 19:35:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:50,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025769847] [2025-04-13 19:35:50,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:50,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:50,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 19:35:50,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 19:35:50,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:50,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:50,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:50,307 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025769847] [2025-04-13 19:35:50,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025769847] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:50,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:50,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 19:35:50,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847025698] [2025-04-13 19:35:50,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:50,307 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:50,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:50,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:50,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:50,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-13 19:35:50,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-13 19:35:50,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:50,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-13 19:35:50,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:50,670 INFO L116 PetriNetUnfolderBase]: 1719/2960 cut-off events. [2025-04-13 19:35:50,670 INFO L117 PetriNetUnfolderBase]: For 4276/4411 co-relation queries the response was YES. [2025-04-13 19:35:50,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8844 conditions, 2960 events. 1719/2960 cut-off events. For 4276/4411 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 19248 event pairs, 642 based on Foata normal form. 135/3001 useless extension candidates. Maximal degree in co-relation 8826. Up to 1880 conditions per place. [2025-04-13 19:35:50,687 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 37 selfloop transitions, 3 changer transitions 21/78 dead transitions. [2025-04-13 19:35:50,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 455 flow [2025-04-13 19:35:50,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:50,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:50,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 117 transitions. [2025-04-13 19:35:50,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2025-04-13 19:35:50,690 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 191 flow. Second operand 5 states and 117 transitions. [2025-04-13 19:35:50,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 455 flow [2025-04-13 19:35:50,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 442 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:50,696 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 193 flow [2025-04-13 19:35:50,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=193, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-04-13 19:35:50,698 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2025-04-13 19:35:50,699 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 193 flow [2025-04-13 19:35:50,699 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 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-04-13 19:35:50,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:50,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:50,699 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:35:50,699 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:50,699 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:50,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1879739693, now seen corresponding path program 1 times [2025-04-13 19:35:50,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:50,700 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250647001] [2025-04-13 19:35:50,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:50,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:50,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:35:50,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:35:50,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:50,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:50,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:50,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:50,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250647001] [2025-04-13 19:35:50,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250647001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:50,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:50,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:35:50,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803581078] [2025-04-13 19:35:50,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:50,878 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:35:50,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:50,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:35:50,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:35:50,885 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-04-13 19:35:50,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 193 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-04-13 19:35:50,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:50,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-04-13 19:35:50,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:51,331 INFO L116 PetriNetUnfolderBase]: 2619/4473 cut-off events. [2025-04-13 19:35:51,331 INFO L117 PetriNetUnfolderBase]: For 5292/5316 co-relation queries the response was YES. [2025-04-13 19:35:51,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 4473 events. 2619/4473 cut-off events. For 5292/5316 co-relation queries the response was YES. Maximal size of possible extension queue 285. Compared 31231 event pairs, 392 based on Foata normal form. 103/4527 useless extension candidates. Maximal degree in co-relation 13463. Up to 2080 conditions per place. [2025-04-13 19:35:51,355 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 7 changer transitions 22/85 dead transitions. [2025-04-13 19:35:51,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 85 transitions, 535 flow [2025-04-13 19:35:51,356 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2025-04-13 19:35:51,357 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6628571428571428 [2025-04-13 19:35:51,357 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 193 flow. Second operand 5 states and 116 transitions. [2025-04-13 19:35:51,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 85 transitions, 535 flow [2025-04-13 19:35:51,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 521 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-13 19:35:51,363 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 207 flow [2025-04-13 19:35:51,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=207, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2025-04-13 19:35:51,364 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 10 predicate places. [2025-04-13 19:35:51,364 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 207 flow [2025-04-13 19:35:51,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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-04-13 19:35:51,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:51,364 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:51,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:35:51,364 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:51,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:51,365 INFO L85 PathProgramCache]: Analyzing trace with hash 385280011, now seen corresponding path program 2 times [2025-04-13 19:35:51,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:51,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411007302] [2025-04-13 19:35:51,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:51,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:51,372 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 1 equivalence classes. [2025-04-13 19:35:51,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:35:51,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:51,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:51,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-04-13 19:35:51,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:51,702 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411007302] [2025-04-13 19:35:51,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411007302] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:51,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:51,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:35:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121644001] [2025-04-13 19:35:51,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:51,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:35:51,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:51,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:35:51,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:35:51,720 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:51,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 207 flow. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-04-13 19:35:51,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:51,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:51,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:52,071 INFO L116 PetriNetUnfolderBase]: 1822/3098 cut-off events. [2025-04-13 19:35:52,071 INFO L117 PetriNetUnfolderBase]: For 3570/3570 co-relation queries the response was YES. [2025-04-13 19:35:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9739 conditions, 3098 events. 1822/3098 cut-off events. For 3570/3570 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 20257 event pairs, 469 based on Foata normal form. 80/3168 useless extension candidates. Maximal degree in co-relation 9719. Up to 1606 conditions per place. [2025-04-13 19:35:52,085 INFO L140 encePairwiseOnDemand]: 25/35 looper letters, 41 selfloop transitions, 9 changer transitions 25/83 dead transitions. [2025-04-13 19:35:52,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 83 transitions, 533 flow [2025-04-13 19:35:52,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:35:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:35:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2025-04-13 19:35:52,086 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6047619047619047 [2025-04-13 19:35:52,086 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 207 flow. Second operand 6 states and 127 transitions. [2025-04-13 19:35:52,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 83 transitions, 533 flow [2025-04-13 19:35:52,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 505 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-04-13 19:35:52,094 INFO L231 Difference]: Finished difference. Result has 55 places, 40 transitions, 204 flow [2025-04-13 19:35:52,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=55, PETRI_TRANSITIONS=40} [2025-04-13 19:35:52,094 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 13 predicate places. [2025-04-13 19:35:52,094 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 40 transitions, 204 flow [2025-04-13 19:35:52,095 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 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-04-13 19:35:52,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:52,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:52,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:35:52,095 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:52,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:52,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1486576892, now seen corresponding path program 1 times [2025-04-13 19:35:52,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:52,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708268707] [2025-04-13 19:35:52,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:52,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:52,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:52,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:52,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:52,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:52,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708268707] [2025-04-13 19:35:52,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708268707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:52,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:52,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:35:52,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170893382] [2025-04-13 19:35:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:52,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:35:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:52,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:35:52,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:35:52,383 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:52,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 40 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04-13 19:35:52,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:52,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:52,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:52,664 INFO L116 PetriNetUnfolderBase]: 965/1645 cut-off events. [2025-04-13 19:35:52,664 INFO L117 PetriNetUnfolderBase]: For 1888/1888 co-relation queries the response was YES. [2025-04-13 19:35:52,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5260 conditions, 1645 events. 965/1645 cut-off events. For 1888/1888 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 9418 event pairs, 257 based on Foata normal form. 27/1665 useless extension candidates. Maximal degree in co-relation 5239. Up to 747 conditions per place. [2025-04-13 19:35:52,670 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 35 selfloop transitions, 6 changer transitions 34/83 dead transitions. [2025-04-13 19:35:52,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 537 flow [2025-04-13 19:35:52,670 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:52,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-04-13 19:35:52,671 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2025-04-13 19:35:52,671 INFO L175 Difference]: Start difference. First operand has 55 places, 40 transitions, 204 flow. Second operand 7 states and 141 transitions. [2025-04-13 19:35:52,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 537 flow [2025-04-13 19:35:52,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 501 flow, removed 6 selfloop flow, removed 8 redundant places. [2025-04-13 19:35:52,675 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 188 flow [2025-04-13 19:35:52,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=188, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2025-04-13 19:35:52,676 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-04-13 19:35:52,676 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 188 flow [2025-04-13 19:35:52,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-04-13 19:35:52,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:52,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:52,676 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:35:52,676 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:52,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:52,677 INFO L85 PathProgramCache]: Analyzing trace with hash -250470110, now seen corresponding path program 2 times [2025-04-13 19:35:52,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:52,677 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233164439] [2025-04-13 19:35:52,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:52,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:52,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:35:52,696 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:35:52,696 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:52,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:53,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:53,062 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233164439] [2025-04-13 19:35:53,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233164439] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:53,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:53,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:35:53,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433632772] [2025-04-13 19:35:53,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:53,063 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:35:53,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:35:53,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:35:53,064 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-13 19:35:53,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 38 transitions, 188 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-04-13 19:35:53,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:53,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-13 19:35:53,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:53,257 INFO L116 PetriNetUnfolderBase]: 532/938 cut-off events. [2025-04-13 19:35:53,257 INFO L117 PetriNetUnfolderBase]: For 964/974 co-relation queries the response was YES. [2025-04-13 19:35:53,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2791 conditions, 938 events. 532/938 cut-off events. For 964/974 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4694 event pairs, 270 based on Foata normal form. 37/954 useless extension candidates. Maximal degree in co-relation 2771. Up to 715 conditions per place. [2025-04-13 19:35:53,261 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 30 selfloop transitions, 8 changer transitions 11/62 dead transitions. [2025-04-13 19:35:53,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 380 flow [2025-04-13 19:35:53,262 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:35:53,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:35:53,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 129 transitions. [2025-04-13 19:35:53,262 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6142857142857143 [2025-04-13 19:35:53,262 INFO L175 Difference]: Start difference. First operand has 56 places, 38 transitions, 188 flow. Second operand 6 states and 129 transitions. [2025-04-13 19:35:53,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 380 flow [2025-04-13 19:35:53,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 356 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-13 19:35:53,266 INFO L231 Difference]: Finished difference. Result has 56 places, 41 transitions, 223 flow [2025-04-13 19:35:53,266 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=223, PETRI_PLACES=56, PETRI_TRANSITIONS=41} [2025-04-13 19:35:53,266 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 14 predicate places. [2025-04-13 19:35:53,266 INFO L485 AbstractCegarLoop]: Abstraction has has 56 places, 41 transitions, 223 flow [2025-04-13 19:35:53,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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-04-13 19:35:53,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:53,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:53,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:35:53,266 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:53,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1025832688, now seen corresponding path program 1 times [2025-04-13 19:35:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:53,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093214112] [2025-04-13 19:35:53,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:53,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 19:35:53,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 19:35:53,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:53,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:53,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093214112] [2025-04-13 19:35:53,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093214112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:53,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:53,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:35:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340106429] [2025-04-13 19:35:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:53,384 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:35:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:53,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:35:53,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:35:53,393 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:53,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 41 transitions, 223 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-04-13 19:35:53,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:53,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:53,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:53,579 INFO L116 PetriNetUnfolderBase]: 1310/1997 cut-off events. [2025-04-13 19:35:53,579 INFO L117 PetriNetUnfolderBase]: For 3882/4035 co-relation queries the response was YES. [2025-04-13 19:35:53,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6491 conditions, 1997 events. 1310/1997 cut-off events. For 3882/4035 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 9334 event pairs, 377 based on Foata normal form. 103/1967 useless extension candidates. Maximal degree in co-relation 6470. Up to 1146 conditions per place. [2025-04-13 19:35:53,587 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 41 selfloop transitions, 5 changer transitions 0/57 dead transitions. [2025-04-13 19:35:53,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 57 transitions, 374 flow [2025-04-13 19:35:53,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:35:53,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:35:53,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-04-13 19:35:53,588 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-04-13 19:35:53,589 INFO L175 Difference]: Start difference. First operand has 56 places, 41 transitions, 223 flow. Second operand 4 states and 87 transitions. [2025-04-13 19:35:53,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 57 transitions, 374 flow [2025-04-13 19:35:53,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 57 transitions, 358 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-04-13 19:35:53,591 INFO L231 Difference]: Finished difference. Result has 54 places, 42 transitions, 224 flow [2025-04-13 19:35:53,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=54, PETRI_TRANSITIONS=42} [2025-04-13 19:35:53,592 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 12 predicate places. [2025-04-13 19:35:53,592 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 42 transitions, 224 flow [2025-04-13 19:35:53,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 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-04-13 19:35:53,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:53,592 INFO L206 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] [2025-04-13 19:35:53,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:35:53,592 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:53,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:53,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1001435447, now seen corresponding path program 1 times [2025-04-13 19:35:53,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:53,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058422132] [2025-04-13 19:35:53,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:53,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:53,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:35:53,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:35:53,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:53,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:53,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058422132] [2025-04-13 19:35:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058422132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:35:53,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352917166] [2025-04-13 19:35:53,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:53,718 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:35:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:35:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:35:53,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:53,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-04-13 19:35:53,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:53,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:53,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:53,977 INFO L116 PetriNetUnfolderBase]: 984/1563 cut-off events. [2025-04-13 19:35:53,977 INFO L117 PetriNetUnfolderBase]: For 3209/3302 co-relation queries the response was YES. [2025-04-13 19:35:53,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5409 conditions, 1563 events. 984/1563 cut-off events. For 3209/3302 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 7238 event pairs, 115 based on Foata normal form. 82/1541 useless extension candidates. Maximal degree in co-relation 5389. Up to 537 conditions per place. [2025-04-13 19:35:53,984 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 48 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2025-04-13 19:35:53,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 459 flow [2025-04-13 19:35:53,985 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:35:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:35:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2025-04-13 19:35:53,986 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6228571428571429 [2025-04-13 19:35:53,986 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 224 flow. Second operand 5 states and 109 transitions. [2025-04-13 19:35:53,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 459 flow [2025-04-13 19:35:53,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 67 transitions, 456 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:35:53,990 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 270 flow [2025-04-13 19:35:53,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-04-13 19:35:53,990 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 17 predicate places. [2025-04-13 19:35:53,991 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 270 flow [2025-04-13 19:35:53,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 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-04-13 19:35:53,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:53,991 INFO L206 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] [2025-04-13 19:35:53,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:35:53,991 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:53,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:53,991 INFO L85 PathProgramCache]: Analyzing trace with hash -961573786, now seen corresponding path program 1 times [2025-04-13 19:35:53,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:53,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017596052] [2025-04-13 19:35:53,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:53,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:54,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-13 19:35:54,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-13 19:35:54,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:54,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:54,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:54,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017596052] [2025-04-13 19:35:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017596052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:35:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751674060] [2025-04-13 19:35:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:54,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:35:54,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:54,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:35:54,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:35:54,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 35 [2025-04-13 19:35:54,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 270 flow. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-04-13 19:35:54,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:54,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 35 [2025-04-13 19:35:54,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:54,350 INFO L116 PetriNetUnfolderBase]: 752/1219 cut-off events. [2025-04-13 19:35:54,350 INFO L117 PetriNetUnfolderBase]: For 3796/3889 co-relation queries the response was YES. [2025-04-13 19:35:54,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4661 conditions, 1219 events. 752/1219 cut-off events. For 3796/3889 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5597 event pairs, 99 based on Foata normal form. 44/1163 useless extension candidates. Maximal degree in co-relation 4638. Up to 432 conditions per place. [2025-04-13 19:35:54,354 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 44 selfloop transitions, 11 changer transitions 0/66 dead transitions. [2025-04-13 19:35:54,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 66 transitions, 469 flow [2025-04-13 19:35:54,354 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:35:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:35:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2025-04-13 19:35:54,355 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-04-13 19:35:54,355 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 270 flow. Second operand 6 states and 119 transitions. [2025-04-13 19:35:54,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 66 transitions, 469 flow [2025-04-13 19:35:54,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 66 transitions, 442 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:54,357 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 288 flow [2025-04-13 19:35:54,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=288, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-04-13 19:35:54,357 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 21 predicate places. [2025-04-13 19:35:54,357 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 288 flow [2025-04-13 19:35:54,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-04-13 19:35:54,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:54,358 INFO L206 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] [2025-04-13 19:35:54,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:35:54,358 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:54,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:54,358 INFO L85 PathProgramCache]: Analyzing trace with hash -497598553, now seen corresponding path program 1 times [2025-04-13 19:35:54,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:54,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704300787] [2025-04-13 19:35:54,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:35:54,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:54,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:35:54,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:35:54,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:54,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:54,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704300787] [2025-04-13 19:35:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704300787] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:54,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:54,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:35:54,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70832256] [2025-04-13 19:35:54,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:54,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:35:54,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:54,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:35:54,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:35:54,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-13 19:35:54,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 288 flow. Second operand has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 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-04-13 19:35:54,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:54,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-13 19:35:54,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:55,138 INFO L116 PetriNetUnfolderBase]: 534/1112 cut-off events. [2025-04-13 19:35:55,138 INFO L117 PetriNetUnfolderBase]: For 2621/2774 co-relation queries the response was YES. [2025-04-13 19:35:55,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 1112 events. 534/1112 cut-off events. For 2621/2774 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 6777 event pairs, 141 based on Foata normal form. 23/1029 useless extension candidates. Maximal degree in co-relation 3743. Up to 483 conditions per place. [2025-04-13 19:35:55,142 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 28 selfloop transitions, 13 changer transitions 6/69 dead transitions. [2025-04-13 19:35:55,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 69 transitions, 480 flow [2025-04-13 19:35:55,143 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:55,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 142 transitions. [2025-04-13 19:35:55,143 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5795918367346938 [2025-04-13 19:35:55,143 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 288 flow. Second operand 7 states and 142 transitions. [2025-04-13 19:35:55,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 69 transitions, 480 flow [2025-04-13 19:35:55,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 69 transitions, 420 flow, removed 24 selfloop flow, removed 5 redundant places. [2025-04-13 19:35:55,147 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 324 flow [2025-04-13 19:35:55,148 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=324, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2025-04-13 19:35:55,148 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 25 predicate places. [2025-04-13 19:35:55,148 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 324 flow [2025-04-13 19:35:55,148 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.0) internal successors, (128), 8 states have internal predecessors, (128), 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-04-13 19:35:55,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:55,148 INFO L206 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] [2025-04-13 19:35:55,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:35:55,148 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:55,149 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:55,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1012976267, now seen corresponding path program 2 times [2025-04-13 19:35:55,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:55,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755377542] [2025-04-13 19:35:55,149 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:35:55,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:55,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:35:55,174 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:35:55,175 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:35:55,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:35:56,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:35:56,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:35:56,245 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755377542] [2025-04-13 19:35:56,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755377542] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:35:56,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:35:56,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:35:56,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369733411] [2025-04-13 19:35:56,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:35:56,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:35:56,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:35:56,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:35:56,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:35:56,246 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-04-13 19:35:56,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 51 transitions, 324 flow. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-04-13 19:35:56,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:35:56,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-04-13 19:35:56,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:35:56,520 INFO L116 PetriNetUnfolderBase]: 663/1397 cut-off events. [2025-04-13 19:35:56,521 INFO L117 PetriNetUnfolderBase]: For 2022/2124 co-relation queries the response was YES. [2025-04-13 19:35:56,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4374 conditions, 1397 events. 663/1397 cut-off events. For 2022/2124 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 9193 event pairs, 182 based on Foata normal form. 26/1291 useless extension candidates. Maximal degree in co-relation 4349. Up to 431 conditions per place. [2025-04-13 19:35:56,527 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 28 selfloop transitions, 5 changer transitions 22/75 dead transitions. [2025-04-13 19:35:56,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 75 transitions, 529 flow [2025-04-13 19:35:56,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:35:56,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:35:56,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-04-13 19:35:56,528 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5755102040816327 [2025-04-13 19:35:56,528 INFO L175 Difference]: Start difference. First operand has 67 places, 51 transitions, 324 flow. Second operand 7 states and 141 transitions. [2025-04-13 19:35:56,528 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 75 transitions, 529 flow [2025-04-13 19:35:56,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 75 transitions, 500 flow, removed 13 selfloop flow, removed 3 redundant places. [2025-04-13 19:35:56,535 INFO L231 Difference]: Finished difference. Result has 72 places, 46 transitions, 279 flow [2025-04-13 19:35:56,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=279, PETRI_PLACES=72, PETRI_TRANSITIONS=46} [2025-04-13 19:35:56,536 INFO L279 CegarLoopForPetriNet]: 42 programPoint places, 30 predicate places. [2025-04-13 19:35:56,536 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 46 transitions, 279 flow [2025-04-13 19:35:56,536 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 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-04-13 19:35:56,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:35:56,536 INFO L206 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] [2025-04-13 19:35:56,536 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:35:56,536 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:35:56,537 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:35:56,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1019846381, now seen corresponding path program 3 times [2025-04-13 19:35:56,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:35:56,537 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564030191] [2025-04-13 19:35:56,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:35:56,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:35:56,544 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:35:56,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:35:56,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:35:56,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:35:56,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:35:56,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 19:35:56,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 19:35:56,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:35:56,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:35:56,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:35:56,668 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:35:56,669 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:35:56,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:35:56,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:35:56,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 19:35:56,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 19:35:56,670 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:35:56,670 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:35:56,671 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-13 19:35:56,749 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:35:56,749 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:35:56,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:35:56 BasicIcfg [2025-04-13 19:35:56,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:35:56,756 INFO L158 Benchmark]: Toolchain (without parser) took 10998.12ms. Allocated memory was 155.2MB in the beginning and 541.1MB in the end (delta: 385.9MB). Free memory was 105.5MB in the beginning and 297.0MB in the end (delta: -191.5MB). Peak memory consumption was 195.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,757 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:35:56,757 INFO L158 Benchmark]: CACSL2BoogieTranslator took 496.30ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 79.3MB in the end (delta: 26.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,758 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.91ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 76.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:35:56,759 INFO L158 Benchmark]: Boogie Preprocessor took 69.62ms. Allocated memory is still 155.2MB. Free memory was 76.0MB in the beginning and 73.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,759 INFO L158 Benchmark]: RCFGBuilder took 614.55ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 87.5MB in the end (delta: -14.4MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L158 Benchmark]: TraceAbstraction took 9744.61ms. Allocated memory was 155.2MB in the beginning and 541.1MB in the end (delta: 385.9MB). Free memory was 87.5MB in the beginning and 297.0MB in the end (delta: -209.5MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. [2025-04-13 19:35:56,760 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 159.4MB. Free memory is still 85.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 496.30ms. Allocated memory is still 155.2MB. Free memory was 105.5MB in the beginning and 79.3MB in the end (delta: 26.2MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 62.91ms. Allocated memory is still 155.2MB. Free memory was 79.3MB in the beginning and 76.0MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 69.62ms. Allocated memory is still 155.2MB. Free memory was 76.0MB in the beginning and 73.1MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 614.55ms. Allocated memory is still 155.2MB. Free memory was 73.1MB in the beginning and 87.5MB in the end (delta: -14.4MB). Peak memory consumption was 57.4MB. Max. memory is 8.0GB. * TraceAbstraction took 9744.61ms. Allocated memory was 155.2MB in the beginning and 541.1MB in the end (delta: 385.9MB). Free memory was 87.5MB in the beginning and 297.0MB in the end (delta: -209.5MB). Peak memory consumption was 175.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=3, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=3, t1805=4, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1804=3, t1805=4, t1806=5, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L773] 2 y = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L793] 3 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2] [L744] 1 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=3, t1805=4, t1806=5, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=3, t1805=4, t1806=5, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804=3, t1805=4, t1806=5, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=2] - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 61 locations, 57 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 518 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 478 mSDsluCounter, 101 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1268 IncrementalHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 34 mSDtfsCounter, 1268 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=13, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 1938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-13 19:35:56,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...