/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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:37:40,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:37:40,657 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:37:40,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:37:40,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:37:40,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:37:40,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:37:40,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:37:40,688 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:37:40,688 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:37:40,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:37:40,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:37:40,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:37:40,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:37:40,688 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:37:40,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:37:40,689 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:37:40,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:40,690 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:40,690 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:37:40,690 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:37:40,691 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:37:40,691 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:37:40,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:37:40,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:37:40,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:37:40,917 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:37:40,918 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:37:40,919 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 19:37:42,206 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8921ed8/fc7fa7198b94416984667505f733e0c0/FLAG84489014d [2025-04-13 19:37:42,495 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:37:42,495 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 19:37:42,506 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8921ed8/fc7fa7198b94416984667505f733e0c0/FLAG84489014d [2025-04-13 19:37:43,207 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe8921ed8/fc7fa7198b94416984667505f733e0c0 [2025-04-13 19:37:43,209 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:37:43,210 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:37:43,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:43,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:37:43,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:37:43,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386b281c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43, skipping insertion in model container [2025-04-13 19:37:43,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,249 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:37:43,447 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-13 19:37:43,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:43,657 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:37:43,676 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/safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[1039,1052] [2025-04-13 19:37:43,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:37:43,783 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:37:43,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43 WrapperNode [2025-04-13 19:37:43,784 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:37:43,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:43,788 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:37:43,788 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:37:43,795 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:37:43" (1/1) ... [2025-04-13 19:37:43,813 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:37:43" (1/1) ... [2025-04-13 19:37:43,832 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 133 [2025-04-13 19:37:43,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:37:43,833 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:37:43,833 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:37:43,833 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:37:43,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,844 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,859 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:37:43,860 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,860 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,872 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,878 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,884 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:37:43,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:37:43,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:37:43,898 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:37:43,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (1/1) ... [2025-04-13 19:37:43,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:37:43,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:37:43,934 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:37:43,940 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:37:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 19:37:43,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2025-04-13 19:37:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2025-04-13 19:37:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2025-04-13 19:37:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 19:37:43,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:37:43,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:37:43,962 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:37:44,096 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:37:44,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:37:44,445 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:37:44,446 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:37:44,446 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:37:44,718 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:37:44,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:44 BoogieIcfgContainer [2025-04-13 19:37:44,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:37:44,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:37:44,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:37:44,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:37:44,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:37:43" (1/3) ... [2025-04-13 19:37:44,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8365bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:44, skipping insertion in model container [2025-04-13 19:37:44,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:37:43" (2/3) ... [2025-04-13 19:37:44,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f8365bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:37:44, skipping insertion in model container [2025-04-13 19:37:44,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:37:44" (3/3) ... [2025-04-13 19:37:44,729 INFO L128 eAbstractionObserver]: Analyzing ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2025-04-13 19:37:44,741 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:37:44,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG safe032_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i that has 4 procedures, 38 locations, 34 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-13 19:37:44,742 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:37:44,791 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 19:37:44,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 47 places, 37 transitions, 86 flow [2025-04-13 19:37:44,865 INFO L116 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-04-13 19:37:44,867 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:44,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 34 events. 0/34 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 75 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-13 19:37:44,869 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 37 transitions, 86 flow [2025-04-13 19:37:44,871 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 34 transitions, 77 flow [2025-04-13 19:37:44,880 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:37:44,892 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;@7fac1e58, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:37:44,893 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 19:37:44,898 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:37:44,899 INFO L116 PetriNetUnfolderBase]: 0/16 cut-off events. [2025-04-13 19:37:44,899 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:37:44,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:44,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:44,901 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:44,905 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:44,906 INFO L85 PathProgramCache]: Analyzing trace with hash 537593601, now seen corresponding path program 1 times [2025-04-13 19:37:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:44,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435566929] [2025-04-13 19:37:44,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:44,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:44,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-13 19:37:44,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-13 19:37:44,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:44,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:45,342 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:37:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:45,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435566929] [2025-04-13 19:37:45,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435566929] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:45,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:45,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:37:45,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772651014] [2025-04-13 19:37:45,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:45,351 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:37:45,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:45,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:37:45,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:37:45,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-04-13 19:37:45,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:37:45,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:45,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-04-13 19:37:45,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:45,791 INFO L116 PetriNetUnfolderBase]: 920/1625 cut-off events. [2025-04-13 19:37:45,791 INFO L117 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-04-13 19:37:45,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3045 conditions, 1625 events. 920/1625 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10424 event pairs, 188 based on Foata normal form. 0/1554 useless extension candidates. Maximal degree in co-relation 3034. Up to 1048 conditions per place. [2025-04-13 19:37:45,807 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 29 selfloop transitions, 2 changer transitions 2/45 dead transitions. [2025-04-13 19:37:45,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 45 transitions, 165 flow [2025-04-13 19:37:45,809 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:37:45,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:37:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-04-13 19:37:45,819 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7117117117117117 [2025-04-13 19:37:45,820 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 77 flow. Second operand 3 states and 79 transitions. [2025-04-13 19:37:45,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 45 transitions, 165 flow [2025-04-13 19:37:45,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 45 transitions, 162 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:45,826 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 74 flow [2025-04-13 19:37:45,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2025-04-13 19:37:45,832 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2025-04-13 19:37:45,832 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 74 flow [2025-04-13 19:37:45,832 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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:37:45,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:45,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:45,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:37:45,834 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:45,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:45,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1494231423, now seen corresponding path program 1 times [2025-04-13 19:37:45,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:45,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769982001] [2025-04-13 19:37:45,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:45,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:45,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:37:45,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:37:45,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:45,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:46,369 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:37:46,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:46,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769982001] [2025-04-13 19:37:46,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769982001] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:46,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:46,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:46,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691696293] [2025-04-13 19:37:46,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:46,371 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:46,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:46,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:46,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:46,379 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-04-13 19:37:46,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 74 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:37:46,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:46,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-04-13 19:37:46,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:47,051 INFO L116 PetriNetUnfolderBase]: 1751/2843 cut-off events. [2025-04-13 19:37:47,051 INFO L117 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-04-13 19:37:47,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5633 conditions, 2843 events. 1751/2843 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 17429 event pairs, 677 based on Foata normal form. 119/2956 useless extension candidates. Maximal degree in co-relation 5623. Up to 1973 conditions per place. [2025-04-13 19:37:47,064 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 37 selfloop transitions, 11 changer transitions 28/86 dead transitions. [2025-04-13 19:37:47,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 344 flow [2025-04-13 19:37:47,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 170 transitions. [2025-04-13 19:37:47,066 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6563706563706564 [2025-04-13 19:37:47,066 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 74 flow. Second operand 7 states and 170 transitions. [2025-04-13 19:37:47,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 344 flow [2025-04-13 19:37:47,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 86 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:47,068 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 156 flow [2025-04-13 19:37:47,068 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2025-04-13 19:37:47,068 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2025-04-13 19:37:47,069 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 156 flow [2025-04-13 19:37:47,069 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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:37:47,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:47,069 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:47,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:37:47,069 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:47,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1438377216, now seen corresponding path program 1 times [2025-04-13 19:37:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:47,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138896822] [2025-04-13 19:37:47,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:47,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:47,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:37:47,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:37:47,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:47,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:47,422 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:37:47,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:47,423 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138896822] [2025-04-13 19:37:47,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138896822] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:47,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:47,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:47,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679467497] [2025-04-13 19:37:47,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:47,423 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:47,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:47,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:47,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:47,431 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-04-13 19:37:47,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:37:47,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:47,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-04-13 19:37:47,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:47,961 INFO L116 PetriNetUnfolderBase]: 1526/2464 cut-off events. [2025-04-13 19:37:47,961 INFO L117 PetriNetUnfolderBase]: For 1906/1906 co-relation queries the response was YES. [2025-04-13 19:37:47,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7373 conditions, 2464 events. 1526/2464 cut-off events. For 1906/1906 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14876 event pairs, 359 based on Foata normal form. 105/2559 useless extension candidates. Maximal degree in co-relation 7358. Up to 1281 conditions per place. [2025-04-13 19:37:47,974 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 44 selfloop transitions, 10 changer transitions 28/92 dead transitions. [2025-04-13 19:37:47,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 92 transitions, 527 flow [2025-04-13 19:37:47,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:37:47,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:37:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 162 transitions. [2025-04-13 19:37:47,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6254826254826255 [2025-04-13 19:37:47,976 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 156 flow. Second operand 7 states and 162 transitions. [2025-04-13 19:37:47,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 92 transitions, 527 flow [2025-04-13 19:37:47,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 519 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:47,983 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 249 flow [2025-04-13 19:37:47,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=249, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2025-04-13 19:37:47,984 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 13 predicate places. [2025-04-13 19:37:47,984 INFO L485 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 249 flow [2025-04-13 19:37:47,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 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:37:47,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:47,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:47,984 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:37:47,984 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:47,985 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:47,985 INFO L85 PathProgramCache]: Analyzing trace with hash 439061676, now seen corresponding path program 1 times [2025-04-13 19:37:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:47,985 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900377160] [2025-04-13 19:37:47,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:47,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:47,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:48,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:48,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:48,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:48,610 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:37:48,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:48,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900377160] [2025-04-13 19:37:48,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900377160] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:48,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:48,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402290294] [2025-04-13 19:37:48,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:48,611 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:48,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:48,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:48,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:48,617 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:37:48,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 249 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:37:48,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:48,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:37:48,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:49,031 INFO L116 PetriNetUnfolderBase]: 1372/2328 cut-off events. [2025-04-13 19:37:49,031 INFO L117 PetriNetUnfolderBase]: For 3372/3420 co-relation queries the response was YES. [2025-04-13 19:37:49,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7565 conditions, 2328 events. 1372/2328 cut-off events. For 3372/3420 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 14336 event pairs, 212 based on Foata normal form. 91/2394 useless extension candidates. Maximal degree in co-relation 7544. Up to 1506 conditions per place. [2025-04-13 19:37:49,044 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 46 selfloop transitions, 9 changer transitions 15/87 dead transitions. [2025-04-13 19:37:49,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 87 transitions, 570 flow [2025-04-13 19:37:49,045 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:49,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:49,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 144 transitions. [2025-04-13 19:37:49,047 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2025-04-13 19:37:49,047 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 249 flow. Second operand 6 states and 144 transitions. [2025-04-13 19:37:49,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 87 transitions, 570 flow [2025-04-13 19:37:49,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 87 transitions, 554 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:49,059 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 326 flow [2025-04-13 19:37:49,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=326, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2025-04-13 19:37:49,060 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2025-04-13 19:37:49,060 INFO L485 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 326 flow [2025-04-13 19:37:49,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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:37:49,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:49,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:49,061 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 19:37:49,061 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:49,061 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:49,061 INFO L85 PathProgramCache]: Analyzing trace with hash 273310210, now seen corresponding path program 2 times [2025-04-13 19:37:49,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:49,062 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138401803] [2025-04-13 19:37:49,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:37:49,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:49,071 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 1 equivalence classes. [2025-04-13 19:37:49,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-13 19:37:49,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:37:49,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:49,887 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:37:49,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:49,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138401803] [2025-04-13 19:37:49,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138401803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:49,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:49,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:37:49,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455875243] [2025-04-13 19:37:49,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:49,888 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:37:49,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:49,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:37:49,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:37:49,892 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:37:49,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 326 flow. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:37:49,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:49,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:37:49,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:50,484 INFO L116 PetriNetUnfolderBase]: 1336/2254 cut-off events. [2025-04-13 19:37:50,484 INFO L117 PetriNetUnfolderBase]: For 4047/4086 co-relation queries the response was YES. [2025-04-13 19:37:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8329 conditions, 2254 events. 1336/2254 cut-off events. For 4047/4086 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 13807 event pairs, 254 based on Foata normal form. 82/2311 useless extension candidates. Maximal degree in co-relation 8304. Up to 1488 conditions per place. [2025-04-13 19:37:50,500 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 45 selfloop transitions, 9 changer transitions 15/86 dead transitions. [2025-04-13 19:37:50,500 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 631 flow [2025-04-13 19:37:50,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-04-13 19:37:50,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2025-04-13 19:37:50,504 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 326 flow. Second operand 6 states and 138 transitions. [2025-04-13 19:37:50,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 631 flow [2025-04-13 19:37:50,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 86 transitions, 596 flow, removed 15 selfloop flow, removed 5 redundant places. [2025-04-13 19:37:50,519 INFO L231 Difference]: Finished difference. Result has 63 places, 58 transitions, 363 flow [2025-04-13 19:37:50,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=363, PETRI_PLACES=63, PETRI_TRANSITIONS=58} [2025-04-13 19:37:50,521 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 19 predicate places. [2025-04-13 19:37:50,521 INFO L485 AbstractCegarLoop]: Abstraction has has 63 places, 58 transitions, 363 flow [2025-04-13 19:37:50,521 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 8 states have internal predecessors, (126), 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:37:50,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:50,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:37:50,521 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 19:37:50,521 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:50,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:50,521 INFO L85 PathProgramCache]: Analyzing trace with hash -768975882, now seen corresponding path program 1 times [2025-04-13 19:37:50,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:50,522 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498635356] [2025-04-13 19:37:50,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:50,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:50,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 19:37:50,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 19:37:50,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:50,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:50,835 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:37:50,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:50,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498635356] [2025-04-13 19:37:50,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498635356] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:50,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:50,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:50,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924225043] [2025-04-13 19:37:50,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:50,836 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:50,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:50,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:50,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:50,843 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 37 [2025-04-13 19:37:50,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 58 transitions, 363 flow. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:37:50,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:50,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 37 [2025-04-13 19:37:50,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:51,351 INFO L116 PetriNetUnfolderBase]: 2000/3463 cut-off events. [2025-04-13 19:37:51,351 INFO L117 PetriNetUnfolderBase]: For 6068/6098 co-relation queries the response was YES. [2025-04-13 19:37:51,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12143 conditions, 3463 events. 2000/3463 cut-off events. For 6068/6098 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 23132 event pairs, 369 based on Foata normal form. 72/3488 useless extension candidates. Maximal degree in co-relation 12117. Up to 1581 conditions per place. [2025-04-13 19:37:51,375 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 56 selfloop transitions, 14 changer transitions 14/96 dead transitions. [2025-04-13 19:37:51,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 96 transitions, 731 flow [2025-04-13 19:37:51,376 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2025-04-13 19:37:51,377 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6261261261261262 [2025-04-13 19:37:51,377 INFO L175 Difference]: Start difference. First operand has 63 places, 58 transitions, 363 flow. Second operand 6 states and 139 transitions. [2025-04-13 19:37:51,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 96 transitions, 731 flow [2025-04-13 19:37:51,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 96 transitions, 717 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:51,388 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 460 flow [2025-04-13 19:37:51,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-04-13 19:37:51,390 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 23 predicate places. [2025-04-13 19:37:51,390 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 460 flow [2025-04-13 19:37:51,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 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:37:51,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:51,390 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:37:51,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 19:37:51,390 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:51,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:51,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1159162812, now seen corresponding path program 1 times [2025-04-13 19:37:51,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:51,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048331780] [2025-04-13 19:37:51,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:51,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:51,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:51,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:51,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:51,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:52,250 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:37:52,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:52,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048331780] [2025-04-13 19:37:52,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048331780] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:52,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:52,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:37:52,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638574662] [2025-04-13 19:37:52,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:52,251 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:37:52,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:52,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:37:52,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:37:52,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:37:52,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 460 flow. Second operand has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 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:37:52,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:52,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:37:52,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:53,058 INFO L116 PetriNetUnfolderBase]: 2399/4202 cut-off events. [2025-04-13 19:37:53,059 INFO L117 PetriNetUnfolderBase]: For 9611/9726 co-relation queries the response was YES. [2025-04-13 19:37:53,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15716 conditions, 4202 events. 2399/4202 cut-off events. For 9611/9726 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 28944 event pairs, 230 based on Foata normal form. 180/4320 useless extension candidates. Maximal degree in co-relation 15687. Up to 2472 conditions per place. [2025-04-13 19:37:53,077 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 71 selfloop transitions, 30 changer transitions 32/151 dead transitions. [2025-04-13 19:37:53,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 151 transitions, 1270 flow [2025-04-13 19:37:53,077 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:37:53,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:37:53,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 224 transitions. [2025-04-13 19:37:53,078 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2025-04-13 19:37:53,078 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 460 flow. Second operand 10 states and 224 transitions. [2025-04-13 19:37:53,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 151 transitions, 1270 flow [2025-04-13 19:37:53,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 151 transitions, 1252 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-13 19:37:53,097 INFO L231 Difference]: Finished difference. Result has 77 places, 84 transitions, 738 flow [2025-04-13 19:37:53,097 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=738, PETRI_PLACES=77, PETRI_TRANSITIONS=84} [2025-04-13 19:37:53,097 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2025-04-13 19:37:53,097 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 84 transitions, 738 flow [2025-04-13 19:37:53,098 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.666666666666666) internal successors, (141), 9 states have internal predecessors, (141), 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:37:53,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:53,098 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:37:53,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 19:37:53,098 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:53,098 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:53,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1772547794, now seen corresponding path program 2 times [2025-04-13 19:37:53,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:53,098 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848872511] [2025-04-13 19:37:53,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:37:53,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:53,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 19:37:53,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 19:37:53,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:37:53,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:53,216 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:37:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:53,216 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848872511] [2025-04-13 19:37:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848872511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:53,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:53,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:37:53,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475037307] [2025-04-13 19:37:53,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:53,217 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 19:37:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:53,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 19:37:53,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 19:37:53,226 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-13 19:37:53,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 84 transitions, 738 flow. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:37:53,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:53,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-13 19:37:53,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:53,916 INFO L116 PetriNetUnfolderBase]: 4531/6927 cut-off events. [2025-04-13 19:37:53,916 INFO L117 PetriNetUnfolderBase]: For 40122/40621 co-relation queries the response was YES. [2025-04-13 19:37:53,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30615 conditions, 6927 events. 4531/6927 cut-off events. For 40122/40621 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 43108 event pairs, 465 based on Foata normal form. 780/7629 useless extension candidates. Maximal degree in co-relation 30581. Up to 3376 conditions per place. [2025-04-13 19:37:53,948 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 115 selfloop transitions, 5 changer transitions 29/166 dead transitions. [2025-04-13 19:37:53,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 166 transitions, 1817 flow [2025-04-13 19:37:53,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 19:37:53,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 19:37:53,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-04-13 19:37:53,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6554054054054054 [2025-04-13 19:37:53,949 INFO L175 Difference]: Start difference. First operand has 77 places, 84 transitions, 738 flow. Second operand 4 states and 97 transitions. [2025-04-13 19:37:53,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 166 transitions, 1817 flow [2025-04-13 19:37:53,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 166 transitions, 1733 flow, removed 42 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:53,988 INFO L231 Difference]: Finished difference. Result has 77 places, 85 transitions, 713 flow [2025-04-13 19:37:53,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=713, PETRI_PLACES=77, PETRI_TRANSITIONS=85} [2025-04-13 19:37:53,989 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 33 predicate places. [2025-04-13 19:37:53,989 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 85 transitions, 713 flow [2025-04-13 19:37:53,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:37:53,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:53,989 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:37:53,989 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 19:37:53,989 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:53,989 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:53,989 INFO L85 PathProgramCache]: Analyzing trace with hash 484038201, now seen corresponding path program 1 times [2025-04-13 19:37:53,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:53,989 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111552104] [2025-04-13 19:37:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:53,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:37:54,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:37:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:55,044 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:37:55,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:55,045 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111552104] [2025-04-13 19:37:55,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111552104] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:55,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:55,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:37:55,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130374005] [2025-04-13 19:37:55,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:55,045 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:37:55,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:55,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:37:55,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:37:55,053 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:37:55,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 85 transitions, 713 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:37:55,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:55,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:37:55,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:56,004 INFO L116 PetriNetUnfolderBase]: 3369/5924 cut-off events. [2025-04-13 19:37:56,004 INFO L117 PetriNetUnfolderBase]: For 23111/23590 co-relation queries the response was YES. [2025-04-13 19:37:56,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25901 conditions, 5924 events. 3369/5924 cut-off events. For 23111/23590 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 43281 event pairs, 614 based on Foata normal form. 273/5934 useless extension candidates. Maximal degree in co-relation 25865. Up to 3369 conditions per place. [2025-04-13 19:37:56,033 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 73 selfloop transitions, 55 changer transitions 48/198 dead transitions. [2025-04-13 19:37:56,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 198 transitions, 1983 flow [2025-04-13 19:37:56,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:37:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:37:56,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 255 transitions. [2025-04-13 19:37:56,035 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6265356265356266 [2025-04-13 19:37:56,035 INFO L175 Difference]: Start difference. First operand has 77 places, 85 transitions, 713 flow. Second operand 11 states and 255 transitions. [2025-04-13 19:37:56,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 198 transitions, 1983 flow [2025-04-13 19:37:56,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 198 transitions, 1981 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:37:56,072 INFO L231 Difference]: Finished difference. Result has 90 places, 114 transitions, 1243 flow [2025-04-13 19:37:56,073 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1243, PETRI_PLACES=90, PETRI_TRANSITIONS=114} [2025-04-13 19:37:56,073 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 46 predicate places. [2025-04-13 19:37:56,073 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 114 transitions, 1243 flow [2025-04-13 19:37:56,073 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:37:56,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:56,073 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:37:56,073 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 19:37:56,073 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:56,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:56,074 INFO L85 PathProgramCache]: Analyzing trace with hash -2006641315, now seen corresponding path program 2 times [2025-04-13 19:37:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:56,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958939453] [2025-04-13 19:37:56,074 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:37:56,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:56,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:37:56,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:37:56,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:37:56,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:57,094 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:37:57,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:57,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958939453] [2025-04-13 19:37:57,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958939453] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:57,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:57,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:37:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522703759] [2025-04-13 19:37:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:57,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:37:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:57,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:37:57,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:37:57,105 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:37:57,105 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 114 transitions, 1243 flow. Second operand has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 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:37:57,105 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:57,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:37:57,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:57,986 INFO L116 PetriNetUnfolderBase]: 2961/5367 cut-off events. [2025-04-13 19:37:57,986 INFO L117 PetriNetUnfolderBase]: For 30078/30377 co-relation queries the response was YES. [2025-04-13 19:37:58,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26142 conditions, 5367 events. 2961/5367 cut-off events. For 30078/30377 co-relation queries the response was YES. Maximal size of possible extension queue 356. Compared 39969 event pairs, 997 based on Foata normal form. 158/5184 useless extension candidates. Maximal degree in co-relation 26101. Up to 3557 conditions per place. [2025-04-13 19:37:58,011 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 66 selfloop transitions, 49 changer transitions 34/171 dead transitions. [2025-04-13 19:37:58,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 171 transitions, 2048 flow [2025-04-13 19:37:58,011 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:37:58,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:37:58,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 197 transitions. [2025-04-13 19:37:58,012 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5915915915915916 [2025-04-13 19:37:58,012 INFO L175 Difference]: Start difference. First operand has 90 places, 114 transitions, 1243 flow. Second operand 9 states and 197 transitions. [2025-04-13 19:37:58,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 171 transitions, 2048 flow [2025-04-13 19:37:58,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 171 transitions, 1964 flow, removed 42 selfloop flow, removed 2 redundant places. [2025-04-13 19:37:58,066 INFO L231 Difference]: Finished difference. Result has 97 places, 115 transitions, 1351 flow [2025-04-13 19:37:58,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1351, PETRI_PLACES=97, PETRI_TRANSITIONS=115} [2025-04-13 19:37:58,066 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-04-13 19:37:58,066 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 115 transitions, 1351 flow [2025-04-13 19:37:58,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.777777777777779) internal successors, (142), 9 states have internal predecessors, (142), 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:37:58,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:58,067 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:37:58,067 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-13 19:37:58,067 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:58,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:58,067 INFO L85 PathProgramCache]: Analyzing trace with hash -575015815, now seen corresponding path program 3 times [2025-04-13 19:37:58,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:58,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181577295] [2025-04-13 19:37:58,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:37:58,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:58,073 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 1 equivalence classes. [2025-04-13 19:37:58,104 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 19:37:58,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:37:58,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:58,218 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:37:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:58,218 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181577295] [2025-04-13 19:37:58,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181577295] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:58,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:58,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-13 19:37:58,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065270315] [2025-04-13 19:37:58,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:58,218 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 19:37:58,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:58,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 19:37:58,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-13 19:37:58,236 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-13 19:37:58,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 115 transitions, 1351 flow. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:37:58,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:58,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-13 19:37:58,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,059 INFO L116 PetriNetUnfolderBase]: 3438/5583 cut-off events. [2025-04-13 19:37:59,060 INFO L117 PetriNetUnfolderBase]: For 51827/52048 co-relation queries the response was YES. [2025-04-13 19:37:59,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28544 conditions, 5583 events. 3438/5583 cut-off events. For 51827/52048 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 35677 event pairs, 370 based on Foata normal form. 486/5996 useless extension candidates. Maximal degree in co-relation 28499. Up to 2036 conditions per place. [2025-04-13 19:37:59,093 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 135 selfloop transitions, 8 changer transitions 18/179 dead transitions. [2025-04-13 19:37:59,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 179 transitions, 2395 flow [2025-04-13 19:37:59,094 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 19:37:59,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 19:37:59,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 124 transitions. [2025-04-13 19:37:59,095 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6702702702702703 [2025-04-13 19:37:59,095 INFO L175 Difference]: Start difference. First operand has 97 places, 115 transitions, 1351 flow. Second operand 5 states and 124 transitions. [2025-04-13 19:37:59,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 179 transitions, 2395 flow [2025-04-13 19:37:59,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 179 transitions, 2267 flow, removed 35 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:59,158 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 1187 flow [2025-04-13 19:37:59,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1187, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-04-13 19:37:59,159 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-04-13 19:37:59,159 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 1187 flow [2025-04-13 19:37:59,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 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:37:59,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,159 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] [2025-04-13 19:37:59,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 19:37:59,159 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:59,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,159 INFO L85 PathProgramCache]: Analyzing trace with hash 144566575, now seen corresponding path program 1 times [2025-04-13 19:37:59,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,159 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532624527] [2025-04-13 19:37:59,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 19:37:59,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 19:37:59,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:37:59,323 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:37:59,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:37:59,323 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532624527] [2025-04-13 19:37:59,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532624527] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:37:59,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:37:59,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:37:59,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261226635] [2025-04-13 19:37:59,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:37:59,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:37:59,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:37:59,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:37:59,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:37:59,330 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 37 [2025-04-13 19:37:59,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 1187 flow. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:37:59,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:37:59,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 37 [2025-04-13 19:37:59,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:37:59,892 INFO L116 PetriNetUnfolderBase]: 2910/4795 cut-off events. [2025-04-13 19:37:59,892 INFO L117 PetriNetUnfolderBase]: For 46603/46816 co-relation queries the response was YES. [2025-04-13 19:37:59,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25257 conditions, 4795 events. 2910/4795 cut-off events. For 46603/46816 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 31004 event pairs, 370 based on Foata normal form. 296/5018 useless extension candidates. Maximal degree in co-relation 25211. Up to 2004 conditions per place. [2025-04-13 19:37:59,917 INFO L140 encePairwiseOnDemand]: 31/37 looper letters, 102 selfloop transitions, 11 changer transitions 38/164 dead transitions. [2025-04-13 19:37:59,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 164 transitions, 2024 flow [2025-04-13 19:37:59,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:37:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:37:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2025-04-13 19:37:59,918 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5900900900900901 [2025-04-13 19:37:59,918 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 1187 flow. Second operand 6 states and 131 transitions. [2025-04-13 19:37:59,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 164 transitions, 2024 flow [2025-04-13 19:37:59,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 164 transitions, 1926 flow, removed 40 selfloop flow, removed 4 redundant places. [2025-04-13 19:37:59,955 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 924 flow [2025-04-13 19:37:59,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1119, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=924, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-04-13 19:37:59,956 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2025-04-13 19:37:59,956 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 924 flow [2025-04-13 19:37:59,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 6 states have internal predecessors, (85), 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:37:59,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:37:59,956 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, 1, 1] [2025-04-13 19:37:59,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 19:37:59,956 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:37:59,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:37:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1629257671, now seen corresponding path program 1 times [2025-04-13 19:37:59,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:37:59,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997659972] [2025-04-13 19:37:59,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:37:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:37:59,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:37:59,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:37:59,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:37:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:00,635 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:38:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:00,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997659972] [2025-04-13 19:38:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997659972] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070727663] [2025-04-13 19:38:00,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:00,636 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 19:38:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:00,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 19:38:00,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 19:38:00,640 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:00,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 924 flow. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:38:00,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:00,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:00,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:01,064 INFO L116 PetriNetUnfolderBase]: 1146/2364 cut-off events. [2025-04-13 19:38:01,064 INFO L117 PetriNetUnfolderBase]: For 13092/13564 co-relation queries the response was YES. [2025-04-13 19:38:01,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9990 conditions, 2364 events. 1146/2364 cut-off events. For 13092/13564 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 16915 event pairs, 317 based on Foata normal form. 61/2185 useless extension candidates. Maximal degree in co-relation 9944. Up to 897 conditions per place. [2025-04-13 19:38:01,076 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 51 selfloop transitions, 19 changer transitions 36/129 dead transitions. [2025-04-13 19:38:01,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 129 transitions, 1378 flow [2025-04-13 19:38:01,076 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:38:01,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:38:01,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 178 transitions. [2025-04-13 19:38:01,077 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6013513513513513 [2025-04-13 19:38:01,077 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 924 flow. Second operand 8 states and 178 transitions. [2025-04-13 19:38:01,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 129 transitions, 1378 flow [2025-04-13 19:38:01,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 129 transitions, 1226 flow, removed 46 selfloop flow, removed 15 redundant places. [2025-04-13 19:38:01,094 INFO L231 Difference]: Finished difference. Result has 95 places, 88 transitions, 825 flow [2025-04-13 19:38:01,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=818, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=825, PETRI_PLACES=95, PETRI_TRANSITIONS=88} [2025-04-13 19:38:01,094 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2025-04-13 19:38:01,094 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 88 transitions, 825 flow [2025-04-13 19:38:01,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 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:38:01,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:01,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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:38:01,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 19:38:01,095 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:01,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1311795929, now seen corresponding path program 2 times [2025-04-13 19:38:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:01,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860419736] [2025-04-13 19:38:01,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:01,101 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:01,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:01,134 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:01,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:02,179 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:38:02,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:02,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860419736] [2025-04-13 19:38:02,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860419736] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:02,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:02,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:02,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401034211] [2025-04-13 19:38:02,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:02,180 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:02,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:02,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:02,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:02,190 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:02,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 88 transitions, 825 flow. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:02,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:02,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:02,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:02,586 INFO L116 PetriNetUnfolderBase]: 876/1862 cut-off events. [2025-04-13 19:38:02,586 INFO L117 PetriNetUnfolderBase]: For 6437/6700 co-relation queries the response was YES. [2025-04-13 19:38:02,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6927 conditions, 1862 events. 876/1862 cut-off events. For 6437/6700 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12730 event pairs, 197 based on Foata normal form. 64/1738 useless extension candidates. Maximal degree in co-relation 6887. Up to 621 conditions per place. [2025-04-13 19:38:02,596 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 63 selfloop transitions, 15 changer transitions 22/123 dead transitions. [2025-04-13 19:38:02,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 1167 flow [2025-04-13 19:38:02,597 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:02,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 220 transitions. [2025-04-13 19:38:02,597 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5405405405405406 [2025-04-13 19:38:02,597 INFO L175 Difference]: Start difference. First operand has 95 places, 88 transitions, 825 flow. Second operand 11 states and 220 transitions. [2025-04-13 19:38:02,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 1167 flow [2025-04-13 19:38:02,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 123 transitions, 1114 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-04-13 19:38:02,606 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 786 flow [2025-04-13 19:38:02,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=786, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2025-04-13 19:38:02,606 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 54 predicate places. [2025-04-13 19:38:02,606 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 786 flow [2025-04-13 19:38:02,606 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:02,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:02,606 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, 1, 1] [2025-04-13 19:38:02,607 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-13 19:38:02,607 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:02,607 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1848890255, now seen corresponding path program 3 times [2025-04-13 19:38:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:02,607 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413142636] [2025-04-13 19:38:02,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:02,615 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:02,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:02,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:03,277 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:38:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:03,277 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413142636] [2025-04-13 19:38:03,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413142636] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:03,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:03,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932733564] [2025-04-13 19:38:03,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:03,278 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:03,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:03,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:03,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:03,284 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:03,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 786 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:03,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:03,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:03,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:03,757 INFO L116 PetriNetUnfolderBase]: 1283/2612 cut-off events. [2025-04-13 19:38:03,758 INFO L117 PetriNetUnfolderBase]: For 8567/8979 co-relation queries the response was YES. [2025-04-13 19:38:03,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9400 conditions, 2612 events. 1283/2612 cut-off events. For 8567/8979 co-relation queries the response was YES. Maximal size of possible extension queue 224. Compared 19110 event pairs, 196 based on Foata normal form. 71/2428 useless extension candidates. Maximal degree in co-relation 9360. Up to 872 conditions per place. [2025-04-13 19:38:03,771 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 44 selfloop transitions, 36 changer transitions 21/124 dead transitions. [2025-04-13 19:38:03,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 124 transitions, 1212 flow [2025-04-13 19:38:03,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 196 transitions. [2025-04-13 19:38:03,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5885885885885885 [2025-04-13 19:38:03,772 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 786 flow. Second operand 9 states and 196 transitions. [2025-04-13 19:38:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 124 transitions, 1212 flow [2025-04-13 19:38:03,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 124 transitions, 1148 flow, removed 13 selfloop flow, removed 12 redundant places. [2025-04-13 19:38:03,784 INFO L231 Difference]: Finished difference. Result has 96 places, 91 transitions, 910 flow [2025-04-13 19:38:03,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=741, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=910, PETRI_PLACES=96, PETRI_TRANSITIONS=91} [2025-04-13 19:38:03,784 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 52 predicate places. [2025-04-13 19:38:03,784 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 91 transitions, 910 flow [2025-04-13 19:38:03,785 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:03,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:03,785 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, 1, 1] [2025-04-13 19:38:03,785 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 19:38:03,785 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:03,785 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:03,785 INFO L85 PathProgramCache]: Analyzing trace with hash 394922205, now seen corresponding path program 4 times [2025-04-13 19:38:03,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:03,785 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725594937] [2025-04-13 19:38:03,785 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:03,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:03,792 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 19:38:03,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:03,808 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:03,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:04,316 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:38:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:04,316 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725594937] [2025-04-13 19:38:04,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725594937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:04,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:04,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922666210] [2025-04-13 19:38:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:04,317 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:04,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:04,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:04,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:04,325 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:04,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 91 transitions, 910 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:04,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:04,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:04,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:04,721 INFO L116 PetriNetUnfolderBase]: 1021/2053 cut-off events. [2025-04-13 19:38:04,721 INFO L117 PetriNetUnfolderBase]: For 7711/8014 co-relation queries the response was YES. [2025-04-13 19:38:04,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7920 conditions, 2053 events. 1021/2053 cut-off events. For 7711/8014 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 14211 event pairs, 223 based on Foata normal form. 81/1922 useless extension candidates. Maximal degree in co-relation 7880. Up to 823 conditions per place. [2025-04-13 19:38:04,732 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 55 selfloop transitions, 29 changer transitions 19/126 dead transitions. [2025-04-13 19:38:04,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 126 transitions, 1312 flow [2025-04-13 19:38:04,732 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:04,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 218 transitions. [2025-04-13 19:38:04,733 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5356265356265356 [2025-04-13 19:38:04,733 INFO L175 Difference]: Start difference. First operand has 96 places, 91 transitions, 910 flow. Second operand 11 states and 218 transitions. [2025-04-13 19:38:04,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 126 transitions, 1312 flow [2025-04-13 19:38:04,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 126 transitions, 1267 flow, removed 17 selfloop flow, removed 5 redundant places. [2025-04-13 19:38:04,745 INFO L231 Difference]: Finished difference. Result has 100 places, 94 transitions, 997 flow [2025-04-13 19:38:04,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=997, PETRI_PLACES=100, PETRI_TRANSITIONS=94} [2025-04-13 19:38:04,746 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 56 predicate places. [2025-04-13 19:38:04,746 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 94 transitions, 997 flow [2025-04-13 19:38:04,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:04,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:04,746 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, 1, 1] [2025-04-13 19:38:04,746 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 19:38:04,746 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:04,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1430124771, now seen corresponding path program 5 times [2025-04-13 19:38:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:04,747 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846879611] [2025-04-13 19:38:04,747 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:04,753 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:04,787 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:04,787 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:04,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:05,625 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:38:05,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:05,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846879611] [2025-04-13 19:38:05,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846879611] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:05,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:05,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:38:05,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756476523] [2025-04-13 19:38:05,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:05,626 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:38:05,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:05,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:38:05,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:38:05,634 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:05,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 94 transitions, 997 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:05,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:05,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:05,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:06,132 INFO L116 PetriNetUnfolderBase]: 1329/2730 cut-off events. [2025-04-13 19:38:06,133 INFO L117 PetriNetUnfolderBase]: For 10358/10739 co-relation queries the response was YES. [2025-04-13 19:38:06,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10369 conditions, 2730 events. 1329/2730 cut-off events. For 10358/10739 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 20591 event pairs, 296 based on Foata normal form. 78/2529 useless extension candidates. Maximal degree in co-relation 10330. Up to 779 conditions per place. [2025-04-13 19:38:06,146 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 71 selfloop transitions, 16 changer transitions 22/132 dead transitions. [2025-04-13 19:38:06,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 132 transitions, 1485 flow [2025-04-13 19:38:06,146 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:38:06,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:38:06,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 171 transitions. [2025-04-13 19:38:06,147 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5777027027027027 [2025-04-13 19:38:06,147 INFO L175 Difference]: Start difference. First operand has 100 places, 94 transitions, 997 flow. Second operand 8 states and 171 transitions. [2025-04-13 19:38:06,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 132 transitions, 1485 flow [2025-04-13 19:38:06,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 132 transitions, 1421 flow, removed 22 selfloop flow, removed 4 redundant places. [2025-04-13 19:38:06,160 INFO L231 Difference]: Finished difference. Result has 101 places, 88 transitions, 901 flow [2025-04-13 19:38:06,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=901, PETRI_PLACES=101, PETRI_TRANSITIONS=88} [2025-04-13 19:38:06,160 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 57 predicate places. [2025-04-13 19:38:06,160 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 88 transitions, 901 flow [2025-04-13 19:38:06,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:06,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:06,161 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, 1, 1] [2025-04-13 19:38:06,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 19:38:06,161 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:06,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1406598741, now seen corresponding path program 6 times [2025-04-13 19:38:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:06,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892260052] [2025-04-13 19:38:06,161 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:06,169 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:06,182 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:06,182 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:38:06,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:06,510 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:38:06,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:06,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892260052] [2025-04-13 19:38:06,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892260052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:06,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:06,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:06,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000302343] [2025-04-13 19:38:06,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:06,510 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:06,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:06,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:06,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:06,511 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:06,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 88 transitions, 901 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:06,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:06,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:06,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:06,932 INFO L116 PetriNetUnfolderBase]: 1359/2724 cut-off events. [2025-04-13 19:38:06,932 INFO L117 PetriNetUnfolderBase]: For 10667/11061 co-relation queries the response was YES. [2025-04-13 19:38:06,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10527 conditions, 2724 events. 1359/2724 cut-off events. For 10667/11061 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 20202 event pairs, 495 based on Foata normal form. 82/2489 useless extension candidates. Maximal degree in co-relation 10484. Up to 1108 conditions per place. [2025-04-13 19:38:06,948 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 51 selfloop transitions, 17 changer transitions 30/121 dead transitions. [2025-04-13 19:38:06,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 121 transitions, 1368 flow [2025-04-13 19:38:06,948 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:38:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:38:06,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 164 transitions. [2025-04-13 19:38:06,949 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2025-04-13 19:38:06,949 INFO L175 Difference]: Start difference. First operand has 101 places, 88 transitions, 901 flow. Second operand 8 states and 164 transitions. [2025-04-13 19:38:06,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 121 transitions, 1368 flow [2025-04-13 19:38:06,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 121 transitions, 1246 flow, removed 27 selfloop flow, removed 10 redundant places. [2025-04-13 19:38:06,970 INFO L231 Difference]: Finished difference. Result has 99 places, 83 transitions, 808 flow [2025-04-13 19:38:06,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=808, PETRI_PLACES=99, PETRI_TRANSITIONS=83} [2025-04-13 19:38:06,971 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 55 predicate places. [2025-04-13 19:38:06,971 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 83 transitions, 808 flow [2025-04-13 19:38:06,971 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:06,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:06,971 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, 1, 1] [2025-04-13 19:38:06,971 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 19:38:06,971 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:06,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:06,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1875607601, now seen corresponding path program 7 times [2025-04-13 19:38:06,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:06,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893095897] [2025-04-13 19:38:06,971 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:06,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:06,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:07,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:07,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:07,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:08,644 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:38:08,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:08,644 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893095897] [2025-04-13 19:38:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893095897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:38:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967702254] [2025-04-13 19:38:08,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:08,645 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:38:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:08,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:38:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:38:08,651 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:08,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 83 transitions, 808 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:08,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:08,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:08,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:09,305 INFO L116 PetriNetUnfolderBase]: 1109/2209 cut-off events. [2025-04-13 19:38:09,305 INFO L117 PetriNetUnfolderBase]: For 8816/9054 co-relation queries the response was YES. [2025-04-13 19:38:09,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8594 conditions, 2209 events. 1109/2209 cut-off events. For 8816/9054 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 15795 event pairs, 249 based on Foata normal form. 62/2049 useless extension candidates. Maximal degree in co-relation 8554. Up to 904 conditions per place. [2025-04-13 19:38:09,316 INFO L140 encePairwiseOnDemand]: 29/37 looper letters, 66 selfloop transitions, 29 changer transitions 16/134 dead transitions. [2025-04-13 19:38:09,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 134 transitions, 1426 flow [2025-04-13 19:38:09,317 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 19:38:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 19:38:09,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 222 transitions. [2025-04-13 19:38:09,318 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-04-13 19:38:09,318 INFO L175 Difference]: Start difference. First operand has 99 places, 83 transitions, 808 flow. Second operand 11 states and 222 transitions. [2025-04-13 19:38:09,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 134 transitions, 1426 flow [2025-04-13 19:38:09,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 134 transitions, 1339 flow, removed 30 selfloop flow, removed 8 redundant places. [2025-04-13 19:38:09,329 INFO L231 Difference]: Finished difference. Result has 104 places, 98 transitions, 1056 flow [2025-04-13 19:38:09,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=742, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1056, PETRI_PLACES=104, PETRI_TRANSITIONS=98} [2025-04-13 19:38:09,330 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 60 predicate places. [2025-04-13 19:38:09,330 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 98 transitions, 1056 flow [2025-04-13 19:38:09,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:09,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:09,330 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, 1, 1] [2025-04-13 19:38:09,330 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 19:38:09,330 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:09,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:09,330 INFO L85 PathProgramCache]: Analyzing trace with hash -2016185565, now seen corresponding path program 8 times [2025-04-13 19:38:09,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:09,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79748368] [2025-04-13 19:38:09,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:09,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:09,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:09,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:09,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:09,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:10,387 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:38:10,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:10,388 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79748368] [2025-04-13 19:38:10,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79748368] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:10,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:10,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:38:10,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618449340] [2025-04-13 19:38:10,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:10,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:38:10,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:10,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:38:10,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:38:10,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:10,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 98 transitions, 1056 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:10,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:10,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:10,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:10,846 INFO L116 PetriNetUnfolderBase]: 1289/2543 cut-off events. [2025-04-13 19:38:10,846 INFO L117 PetriNetUnfolderBase]: For 9095/9441 co-relation queries the response was YES. [2025-04-13 19:38:10,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9669 conditions, 2543 events. 1289/2543 cut-off events. For 9095/9441 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 18656 event pairs, 222 based on Foata normal form. 61/2338 useless extension candidates. Maximal degree in co-relation 9624. Up to 658 conditions per place. [2025-04-13 19:38:10,861 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 60 selfloop transitions, 36 changer transitions 14/133 dead transitions. [2025-04-13 19:38:10,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 133 transitions, 1461 flow [2025-04-13 19:38:10,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:10,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:10,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 185 transitions. [2025-04-13 19:38:10,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5555555555555556 [2025-04-13 19:38:10,862 INFO L175 Difference]: Start difference. First operand has 104 places, 98 transitions, 1056 flow. Second operand 9 states and 185 transitions. [2025-04-13 19:38:10,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 133 transitions, 1461 flow [2025-04-13 19:38:10,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 133 transitions, 1389 flow, removed 26 selfloop flow, removed 5 redundant places. [2025-04-13 19:38:10,881 INFO L231 Difference]: Finished difference. Result has 110 places, 105 transitions, 1180 flow [2025-04-13 19:38:10,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=994, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1180, PETRI_PLACES=110, PETRI_TRANSITIONS=105} [2025-04-13 19:38:10,882 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 66 predicate places. [2025-04-13 19:38:10,882 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 105 transitions, 1180 flow [2025-04-13 19:38:10,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:10,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:10,882 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, 1, 1] [2025-04-13 19:38:10,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-13 19:38:10,883 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:10,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:10,883 INFO L85 PathProgramCache]: Analyzing trace with hash -580664177, now seen corresponding path program 9 times [2025-04-13 19:38:10,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:10,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663839940] [2025-04-13 19:38:10,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:10,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:10,889 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:10,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:10,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:10,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:12,832 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:38:12,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:12,833 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663839940] [2025-04-13 19:38:12,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663839940] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:12,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:12,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:38:12,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207041394] [2025-04-13 19:38:12,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:12,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:38:12,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:12,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:38:12,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:38:12,841 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:12,842 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 105 transitions, 1180 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:12,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:12,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:12,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:13,487 INFO L116 PetriNetUnfolderBase]: 1621/3257 cut-off events. [2025-04-13 19:38:13,487 INFO L117 PetriNetUnfolderBase]: For 11612/12031 co-relation queries the response was YES. [2025-04-13 19:38:13,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12052 conditions, 3257 events. 1621/3257 cut-off events. For 11612/12031 co-relation queries the response was YES. Maximal size of possible extension queue 332. Compared 25395 event pairs, 371 based on Foata normal form. 66/2955 useless extension candidates. Maximal degree in co-relation 12004. Up to 997 conditions per place. [2025-04-13 19:38:13,505 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 62 selfloop transitions, 37 changer transitions 24/146 dead transitions. [2025-04-13 19:38:13,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 146 transitions, 1643 flow [2025-04-13 19:38:13,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 215 transitions. [2025-04-13 19:38:13,506 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2025-04-13 19:38:13,506 INFO L175 Difference]: Start difference. First operand has 110 places, 105 transitions, 1180 flow. Second operand 10 states and 215 transitions. [2025-04-13 19:38:13,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 146 transitions, 1643 flow [2025-04-13 19:38:13,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 146 transitions, 1561 flow, removed 20 selfloop flow, removed 6 redundant places. [2025-04-13 19:38:13,529 INFO L231 Difference]: Finished difference. Result has 116 places, 102 transitions, 1185 flow [2025-04-13 19:38:13,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1115, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1185, PETRI_PLACES=116, PETRI_TRANSITIONS=102} [2025-04-13 19:38:13,530 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 72 predicate places. [2025-04-13 19:38:13,530 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 102 transitions, 1185 flow [2025-04-13 19:38:13,530 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:13,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:13,530 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, 1, 1] [2025-04-13 19:38:13,530 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 19:38:13,530 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:13,531 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:13,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2048613507, now seen corresponding path program 10 times [2025-04-13 19:38:13,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:13,531 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729080416] [2025-04-13 19:38:13,531 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:13,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:13,536 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 19:38:13,557 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:13,557 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:13,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:14,168 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:38:14,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:14,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729080416] [2025-04-13 19:38:14,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729080416] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:14,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:14,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:14,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223578814] [2025-04-13 19:38:14,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:14,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:38:14,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:14,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:38:14,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:38:14,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:14,172 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 102 transitions, 1185 flow. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 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:38:14,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:14,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:14,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:14,697 INFO L116 PetriNetUnfolderBase]: 1883/3806 cut-off events. [2025-04-13 19:38:14,697 INFO L117 PetriNetUnfolderBase]: For 14610/15085 co-relation queries the response was YES. [2025-04-13 19:38:14,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13938 conditions, 3806 events. 1883/3806 cut-off events. For 14610/15085 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 30516 event pairs, 674 based on Foata normal form. 80/3468 useless extension candidates. Maximal degree in co-relation 13887. Up to 1551 conditions per place. [2025-04-13 19:38:14,722 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 71 selfloop transitions, 36 changer transitions 14/144 dead transitions. [2025-04-13 19:38:14,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 144 transitions, 1740 flow [2025-04-13 19:38:14,723 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:14,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:14,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 214 transitions. [2025-04-13 19:38:14,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5783783783783784 [2025-04-13 19:38:14,724 INFO L175 Difference]: Start difference. First operand has 116 places, 102 transitions, 1185 flow. Second operand 10 states and 214 transitions. [2025-04-13 19:38:14,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 144 transitions, 1740 flow [2025-04-13 19:38:14,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 144 transitions, 1674 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-13 19:38:14,751 INFO L231 Difference]: Finished difference. Result has 121 places, 106 transitions, 1333 flow [2025-04-13 19:38:14,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1333, PETRI_PLACES=121, PETRI_TRANSITIONS=106} [2025-04-13 19:38:14,751 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 77 predicate places. [2025-04-13 19:38:14,751 INFO L485 AbstractCegarLoop]: Abstraction has has 121 places, 106 transitions, 1333 flow [2025-04-13 19:38:14,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 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:38:14,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:14,752 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, 1, 1] [2025-04-13 19:38:14,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 19:38:14,752 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:14,752 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1157909733, now seen corresponding path program 11 times [2025-04-13 19:38:14,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:14,752 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842984570] [2025-04-13 19:38:14,752 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:14,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:14,789 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:14,789 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:14,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:15,516 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:38:15,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:15,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842984570] [2025-04-13 19:38:15,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842984570] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:15,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:15,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 19:38:15,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188026214] [2025-04-13 19:38:15,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:15,517 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 19:38:15,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:15,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 19:38:15,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-13 19:38:15,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:15,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 106 transitions, 1333 flow. Second operand has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 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:38:15,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:15,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:15,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:16,149 INFO L116 PetriNetUnfolderBase]: 2013/4154 cut-off events. [2025-04-13 19:38:16,149 INFO L117 PetriNetUnfolderBase]: For 16399/16898 co-relation queries the response was YES. [2025-04-13 19:38:16,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14774 conditions, 4154 events. 2013/4154 cut-off events. For 16399/16898 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 34574 event pairs, 691 based on Foata normal form. 86/3766 useless extension candidates. Maximal degree in co-relation 14722. Up to 1563 conditions per place. [2025-04-13 19:38:16,174 INFO L140 encePairwiseOnDemand]: 26/37 looper letters, 50 selfloop transitions, 31 changer transitions 29/133 dead transitions. [2025-04-13 19:38:16,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 133 transitions, 1702 flow [2025-04-13 19:38:16,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:16,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:16,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 188 transitions. [2025-04-13 19:38:16,175 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5645645645645646 [2025-04-13 19:38:16,175 INFO L175 Difference]: Start difference. First operand has 121 places, 106 transitions, 1333 flow. Second operand 9 states and 188 transitions. [2025-04-13 19:38:16,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 133 transitions, 1702 flow [2025-04-13 19:38:16,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 133 transitions, 1570 flow, removed 45 selfloop flow, removed 7 redundant places. [2025-04-13 19:38:16,206 INFO L231 Difference]: Finished difference. Result has 124 places, 92 transitions, 1092 flow [2025-04-13 19:38:16,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=1203, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1092, PETRI_PLACES=124, PETRI_TRANSITIONS=92} [2025-04-13 19:38:16,206 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 80 predicate places. [2025-04-13 19:38:16,206 INFO L485 AbstractCegarLoop]: Abstraction has has 124 places, 92 transitions, 1092 flow [2025-04-13 19:38:16,206 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 16.0) internal successors, (144), 9 states have internal predecessors, (144), 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:38:16,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:16,206 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, 1, 1] [2025-04-13 19:38:16,206 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 19:38:16,207 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:16,207 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:16,207 INFO L85 PathProgramCache]: Analyzing trace with hash -368890505, now seen corresponding path program 12 times [2025-04-13 19:38:16,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:16,207 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928284269] [2025-04-13 19:38:16,207 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:16,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:16,212 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:16,234 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:16,234 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:38:16,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:17,588 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:38:17,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:17,588 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928284269] [2025-04-13 19:38:17,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928284269] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:17,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:17,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 19:38:17,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627779263] [2025-04-13 19:38:17,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:17,589 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 19:38:17,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:17,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 19:38:17,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-04-13 19:38:17,590 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:17,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 92 transitions, 1092 flow. Second operand has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:17,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:17,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:17,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:18,060 INFO L116 PetriNetUnfolderBase]: 1479/3012 cut-off events. [2025-04-13 19:38:18,061 INFO L117 PetriNetUnfolderBase]: For 12033/12456 co-relation queries the response was YES. [2025-04-13 19:38:18,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10930 conditions, 3012 events. 1479/3012 cut-off events. For 12033/12456 co-relation queries the response was YES. Maximal size of possible extension queue 306. Compared 23500 event pairs, 440 based on Foata normal form. 83/2733 useless extension candidates. Maximal degree in co-relation 10891. Up to 1076 conditions per place. [2025-04-13 19:38:18,079 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 50 selfloop transitions, 28 changer transitions 16/117 dead transitions. [2025-04-13 19:38:18,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 117 transitions, 1365 flow [2025-04-13 19:38:18,079 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 205 transitions. [2025-04-13 19:38:18,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2025-04-13 19:38:18,080 INFO L175 Difference]: Start difference. First operand has 124 places, 92 transitions, 1092 flow. Second operand 10 states and 205 transitions. [2025-04-13 19:38:18,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 117 transitions, 1365 flow [2025-04-13 19:38:18,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 117 transitions, 1233 flow, removed 30 selfloop flow, removed 15 redundant places. [2025-04-13 19:38:18,103 INFO L231 Difference]: Finished difference. Result has 113 places, 87 transitions, 977 flow [2025-04-13 19:38:18,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=964, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=977, PETRI_PLACES=113, PETRI_TRANSITIONS=87} [2025-04-13 19:38:18,104 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2025-04-13 19:38:18,104 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 87 transitions, 977 flow [2025-04-13 19:38:18,104 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.8) internal successors, (158), 10 states have internal predecessors, (158), 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:38:18,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:18,104 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, 1, 1] [2025-04-13 19:38:18,104 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 19:38:18,104 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:18,105 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:18,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1340872685, now seen corresponding path program 13 times [2025-04-13 19:38:18,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:18,105 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001269016] [2025-04-13 19:38:18,105 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 19:38:18,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:18,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:18,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:18,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:18,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:20,120 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:38:20,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:20,120 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001269016] [2025-04-13 19:38:20,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001269016] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:20,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:20,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 19:38:20,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825839188] [2025-04-13 19:38:20,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:20,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 19:38:20,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:20,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 19:38:20,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 19:38:20,124 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:20,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 87 transitions, 977 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:20,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:20,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:20,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:20,605 INFO L116 PetriNetUnfolderBase]: 1152/2366 cut-off events. [2025-04-13 19:38:20,605 INFO L117 PetriNetUnfolderBase]: For 8542/8945 co-relation queries the response was YES. [2025-04-13 19:38:20,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8721 conditions, 2366 events. 1152/2366 cut-off events. For 8542/8945 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 17745 event pairs, 225 based on Foata normal form. 67/2179 useless extension candidates. Maximal degree in co-relation 8688. Up to 937 conditions per place. [2025-04-13 19:38:20,618 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 39 selfloop transitions, 25 changer transitions 20/105 dead transitions. [2025-04-13 19:38:20,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 105 transitions, 1190 flow [2025-04-13 19:38:20,618 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 19:38:20,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 19:38:20,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 167 transitions. [2025-04-13 19:38:20,619 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5641891891891891 [2025-04-13 19:38:20,619 INFO L175 Difference]: Start difference. First operand has 113 places, 87 transitions, 977 flow. Second operand 8 states and 167 transitions. [2025-04-13 19:38:20,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 105 transitions, 1190 flow [2025-04-13 19:38:20,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 105 transitions, 1127 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-04-13 19:38:20,630 INFO L231 Difference]: Finished difference. Result has 114 places, 76 transitions, 830 flow [2025-04-13 19:38:20,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=916, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=830, PETRI_PLACES=114, PETRI_TRANSITIONS=76} [2025-04-13 19:38:20,630 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 70 predicate places. [2025-04-13 19:38:20,630 INFO L485 AbstractCegarLoop]: Abstraction has has 114 places, 76 transitions, 830 flow [2025-04-13 19:38:20,631 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 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:38:20,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:20,631 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, 1, 1] [2025-04-13 19:38:20,631 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 19:38:20,631 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:20,631 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:20,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1283096045, now seen corresponding path program 14 times [2025-04-13 19:38:20,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:20,631 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555800121] [2025-04-13 19:38:20,631 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:38:20,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:20,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:20,649 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:20,649 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:20,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:21,085 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:38:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:21,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555800121] [2025-04-13 19:38:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555800121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 19:38:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330719469] [2025-04-13 19:38:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:21,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 19:38:21,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:21,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 19:38:21,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-04-13 19:38:21,089 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:21,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 76 transitions, 830 flow. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:21,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:21,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:21,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:21,443 INFO L116 PetriNetUnfolderBase]: 1037/2098 cut-off events. [2025-04-13 19:38:21,443 INFO L117 PetriNetUnfolderBase]: For 8854/9239 co-relation queries the response was YES. [2025-04-13 19:38:21,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7768 conditions, 2098 events. 1037/2098 cut-off events. For 8854/9239 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15084 event pairs, 250 based on Foata normal form. 50/1909 useless extension candidates. Maximal degree in co-relation 7736. Up to 845 conditions per place. [2025-04-13 19:38:21,455 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 41 selfloop transitions, 18 changer transitions 16/96 dead transitions. [2025-04-13 19:38:21,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 96 transitions, 1033 flow [2025-04-13 19:38:21,456 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 19:38:21,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 19:38:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 196 transitions. [2025-04-13 19:38:21,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5297297297297298 [2025-04-13 19:38:21,456 INFO L175 Difference]: Start difference. First operand has 114 places, 76 transitions, 830 flow. Second operand 10 states and 196 transitions. [2025-04-13 19:38:21,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 96 transitions, 1033 flow [2025-04-13 19:38:21,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 96 transitions, 955 flow, removed 6 selfloop flow, removed 9 redundant places. [2025-04-13 19:38:21,466 INFO L231 Difference]: Finished difference. Result has 113 places, 68 transitions, 673 flow [2025-04-13 19:38:21,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=673, PETRI_PLACES=113, PETRI_TRANSITIONS=68} [2025-04-13 19:38:21,466 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2025-04-13 19:38:21,466 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 68 transitions, 673 flow [2025-04-13 19:38:21,467 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 8 states have internal predecessors, (130), 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:38:21,467 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:21,467 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, 1, 1] [2025-04-13 19:38:21,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 19:38:21,467 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:21,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1160013403, now seen corresponding path program 15 times [2025-04-13 19:38:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:21,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855962758] [2025-04-13 19:38:21,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:38:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:21,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:21,491 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:21,491 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 19:38:21,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:21,738 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:38:21,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:21,739 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855962758] [2025-04-13 19:38:21,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855962758] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:21,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:21,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 19:38:21,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184496058] [2025-04-13 19:38:21,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:21,739 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:38:21,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:21,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:38:21,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:38:21,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:21,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 68 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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:38:21,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:21,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:21,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:22,024 INFO L116 PetriNetUnfolderBase]: 1182/2346 cut-off events. [2025-04-13 19:38:22,024 INFO L117 PetriNetUnfolderBase]: For 7938/8410 co-relation queries the response was YES. [2025-04-13 19:38:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8135 conditions, 2346 events. 1182/2346 cut-off events. For 7938/8410 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 17450 event pairs, 596 based on Foata normal form. 61/2108 useless extension candidates. Maximal degree in co-relation 8105. Up to 1019 conditions per place. [2025-04-13 19:38:22,033 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 35 selfloop transitions, 7 changer transitions 28/90 dead transitions. [2025-04-13 19:38:22,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 90 transitions, 913 flow [2025-04-13 19:38:22,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:22,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2025-04-13 19:38:22,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5521235521235521 [2025-04-13 19:38:22,034 INFO L175 Difference]: Start difference. First operand has 113 places, 68 transitions, 673 flow. Second operand 7 states and 143 transitions. [2025-04-13 19:38:22,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 90 transitions, 913 flow [2025-04-13 19:38:22,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 90 transitions, 774 flow, removed 17 selfloop flow, removed 20 redundant places. [2025-04-13 19:38:22,044 INFO L231 Difference]: Finished difference. Result has 97 places, 59 transitions, 461 flow [2025-04-13 19:38:22,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=461, PETRI_PLACES=97, PETRI_TRANSITIONS=59} [2025-04-13 19:38:22,045 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2025-04-13 19:38:22,045 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 59 transitions, 461 flow [2025-04-13 19:38:22,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 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:38:22,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:22,045 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, 1, 1] [2025-04-13 19:38:22,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 19:38:22,045 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:22,045 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:22,045 INFO L85 PathProgramCache]: Analyzing trace with hash -519500889, now seen corresponding path program 16 times [2025-04-13 19:38:22,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:22,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417229751] [2025-04-13 19:38:22,046 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:38:22,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:22,051 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 29 statements into 2 equivalence classes. [2025-04-13 19:38:22,074 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:22,074 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:38:22,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:23,342 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:38:23,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:23,342 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417229751] [2025-04-13 19:38:23,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417229751] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:23,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:23,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:23,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768862362] [2025-04-13 19:38:23,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:23,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:23,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:23,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:23,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:23,346 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:23,346 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 59 transitions, 461 flow. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:23,346 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:23,346 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:23,346 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:23,782 INFO L116 PetriNetUnfolderBase]: 772/1518 cut-off events. [2025-04-13 19:38:23,782 INFO L117 PetriNetUnfolderBase]: For 3299/3653 co-relation queries the response was YES. [2025-04-13 19:38:23,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4832 conditions, 1518 events. 772/1518 cut-off events. For 3299/3653 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 10079 event pairs, 136 based on Foata normal form. 35/1379 useless extension candidates. Maximal degree in co-relation 4804. Up to 477 conditions per place. [2025-04-13 19:38:23,790 INFO L140 encePairwiseOnDemand]: 27/37 looper letters, 31 selfloop transitions, 14 changer transitions 16/80 dead transitions. [2025-04-13 19:38:23,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 80 transitions, 666 flow [2025-04-13 19:38:23,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 19:38:23,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 19:38:23,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 178 transitions. [2025-04-13 19:38:23,791 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5345345345345346 [2025-04-13 19:38:23,791 INFO L175 Difference]: Start difference. First operand has 97 places, 59 transitions, 461 flow. Second operand 9 states and 178 transitions. [2025-04-13 19:38:23,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 80 transitions, 666 flow [2025-04-13 19:38:23,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 80 transitions, 562 flow, removed 17 selfloop flow, removed 16 redundant places. [2025-04-13 19:38:23,796 INFO L231 Difference]: Finished difference. Result has 88 places, 52 transitions, 338 flow [2025-04-13 19:38:23,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=338, PETRI_PLACES=88, PETRI_TRANSITIONS=52} [2025-04-13 19:38:23,796 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 44 predicate places. [2025-04-13 19:38:23,796 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 52 transitions, 338 flow [2025-04-13 19:38:23,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:23,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:23,797 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, 1, 1] [2025-04-13 19:38:23,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 19:38:23,797 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:23,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1168594625, now seen corresponding path program 17 times [2025-04-13 19:38:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:23,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824180982] [2025-04-13 19:38:23,797 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 19:38:23,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:23,803 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:23,837 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:23,837 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 19:38:23,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:38:25,597 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:38:25,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:38:25,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824180982] [2025-04-13 19:38:25,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824180982] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:38:25,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:38:25,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 19:38:25,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401636197] [2025-04-13 19:38:25,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:38:25,598 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 19:38:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:38:25,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 19:38:25,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 19:38:25,600 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 37 [2025-04-13 19:38:25,600 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 52 transitions, 338 flow. Second operand has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:25,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:38:25,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 37 [2025-04-13 19:38:25,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:38:25,894 INFO L116 PetriNetUnfolderBase]: 581/1144 cut-off events. [2025-04-13 19:38:25,894 INFO L117 PetriNetUnfolderBase]: For 1705/1968 co-relation queries the response was YES. [2025-04-13 19:38:25,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3556 conditions, 1144 events. 581/1144 cut-off events. For 1705/1968 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 7247 event pairs, 188 based on Foata normal form. 30/1043 useless extension candidates. Maximal degree in co-relation 3532. Up to 473 conditions per place. [2025-04-13 19:38:25,899 INFO L140 encePairwiseOnDemand]: 30/37 looper letters, 24 selfloop transitions, 4 changer transitions 22/68 dead transitions. [2025-04-13 19:38:25,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 68 transitions, 506 flow [2025-04-13 19:38:25,899 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 19:38:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 19:38:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2025-04-13 19:38:25,900 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5444015444015444 [2025-04-13 19:38:25,900 INFO L175 Difference]: Start difference. First operand has 88 places, 52 transitions, 338 flow. Second operand 7 states and 141 transitions. [2025-04-13 19:38:25,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 68 transitions, 506 flow [2025-04-13 19:38:25,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 68 transitions, 413 flow, removed 21 selfloop flow, removed 18 redundant places. [2025-04-13 19:38:25,904 INFO L231 Difference]: Finished difference. Result has 75 places, 42 transitions, 199 flow [2025-04-13 19:38:25,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=199, PETRI_PLACES=75, PETRI_TRANSITIONS=42} [2025-04-13 19:38:25,905 INFO L279 CegarLoopForPetriNet]: 44 programPoint places, 31 predicate places. [2025-04-13 19:38:25,905 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 42 transitions, 199 flow [2025-04-13 19:38:25,905 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 15.636363636363637) internal successors, (172), 11 states have internal predecessors, (172), 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:38:25,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:38:25,905 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, 1, 1] [2025-04-13 19:38:25,905 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 19:38:25,905 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2025-04-13 19:38:25,906 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:38:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1907340821, now seen corresponding path program 18 times [2025-04-13 19:38:25,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:38:25,906 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976211771] [2025-04-13 19:38:25,906 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 19:38:25,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:38:25,912 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:25,963 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:25,963 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 19:38:25,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:25,963 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-13 19:38:25,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-13 19:38:26,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-13 19:38:26,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:38:26,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-13 19:38:26,043 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-13 19:38:26,043 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-13 19:38:26,043 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 19:38:26,045 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2025-04-13 19:38:26,045 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 19:38:26,045 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2025-04-13 19:38:26,045 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-13 19:38:26,045 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 19:38:26,046 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 19:38:26,046 INFO L422 BasicCegarLoop]: Path program histogram: [18, 3, 2, 2, 1, 1, 1, 1, 1] [2025-04-13 19:38:26,118 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:38:26,118 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:38:26,129 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:38:26 BasicIcfg [2025-04-13 19:38:26,129 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:38:26,130 INFO L158 Benchmark]: Toolchain (without parser) took 42919.38ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 97.4MB in the beginning and 551.4MB in the end (delta: -453.9MB). Peak memory consumption was 392.1MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,130 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 163.6MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:38:26,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.02ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 68.3MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 65.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,130 INFO L158 Benchmark]: Boogie Preprocessor took 64.48ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 61.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,130 INFO L158 Benchmark]: RCFGBuilder took 821.65ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 42.8MB in the end (delta: 18.2MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,131 INFO L158 Benchmark]: TraceAbstraction took 41406.81ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 42.8MB in the beginning and 551.4MB in the end (delta: -508.5MB). Peak memory consumption was 338.7MB. Max. memory is 8.0GB. [2025-04-13 19:38:26,131 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.24ms. Allocated memory is still 163.6MB. Free memory is still 92.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 573.02ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 68.3MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.99ms. Allocated memory is still 142.6MB. Free memory was 68.3MB in the beginning and 65.8MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 64.48ms. Allocated memory is still 142.6MB. Free memory was 65.8MB in the beginning and 61.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 821.65ms. Allocated memory is still 142.6MB. Free memory was 61.0MB in the beginning and 42.8MB in the end (delta: 18.2MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 41406.81ms. Allocated memory was 142.6MB in the beginning and 989.9MB in the end (delta: 847.2MB). Free memory was 42.8MB in the beginning and 551.4MB in the end (delta: -508.5MB). Peak memory consumption was 338.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L715] 0 _Bool main$tmp_guard0; [L716] 0 _Bool main$tmp_guard1; [L718] 0 int x = 0; [L719] 0 _Bool x$flush_delayed; [L720] 0 int x$mem_tmp; [L721] 0 _Bool x$r_buff0_thd0; [L722] 0 _Bool x$r_buff0_thd1; [L723] 0 _Bool x$r_buff0_thd2; [L724] 0 _Bool x$r_buff0_thd3; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$r_buff1_thd3; [L729] 0 _Bool x$read_delayed; [L730] 0 int *x$read_delayed_var; [L731] 0 int x$w_buff0; [L732] 0 _Bool x$w_buff0_used; [L733] 0 int x$w_buff1; [L734] 0 _Bool x$w_buff1_used; [L736] 0 int y = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2537; [L850] FCALL, FORK 0 pthread_create(&t2537, ((void *)0), P0, ((void *)0)) VAL [\at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, 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] [L851] 0 pthread_t t2538; [L852] FCALL, FORK 0 pthread_create(&t2538, ((void *)0), P1, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, t2538=-1, 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] [L853] 0 pthread_t t2539; [L854] FCALL, FORK 0 pthread_create(&t2539, ((void *)0), P2, ((void *)0)) VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=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=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] [L812] 3 x$w_buff1 = x$w_buff0 [L813] 3 x$w_buff0 = 2 [L814] 3 x$w_buff1_used = x$w_buff0_used [L815] 3 x$w_buff0_used = (_Bool)1 [L816] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L816] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L817] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L818] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L819] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L820] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L821] 3 x$r_buff0_thd3 = (_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_p1_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=0, x$r_buff0_thd3=1, 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] [L824] 3 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_p1_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=0, x$r_buff0_thd3=1, 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] [L742] 1 y = 2 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=0, x$r_buff0_thd3=1, 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] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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] [L772] 2 x = 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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] [L775] 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) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L777] 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 [L778] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L779] 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}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, 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] [L782] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L783] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L784] 2 x$flush_delayed = weak$$choice2 [L785] 2 x$mem_tmp = x [L786] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L787] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L788] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L789] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L790] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L791] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L792] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 __unbuffered_p1_EAX = x [L794] 2 x = x$flush_delayed ? x$mem_tmp : x [L795] 2 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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}, \at(arg, Pre)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L834] 3 __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=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L798] 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) [L799] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L800] 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 [L801] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L802] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L805] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_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=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=1, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L867] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L868] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L869] 0 x$flush_delayed = weak$$choice2 [L870] 0 x$mem_tmp = x [L871] 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) [L872] 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)) [L873] 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)) [L874] 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)) [L875] 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)) [L876] 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)) [L877] 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)) [L878] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1) [L879] 0 x = x$flush_delayed ? x$mem_tmp : x [L880] 0 x$flush_delayed = (_Bool)0 VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2537=-2, t2538=-1, t2539=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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] [L882] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\at(arg, Pre)={0:0}, \at(arg, Pre)={0:0}, \at(expression, Pre)=0, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=1, 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: 19]: 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: 850]: 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: 852]: 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: 854]: 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, 65 locations, 61 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: 41.2s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 18, EmptinessCheckTime: 0.0s, AutomataDifference: 17.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1430 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1384 mSDsluCounter, 318 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 258 mSDsCounter, 504 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4987 IncrementalHoareTripleChecker+Invalid, 5491 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 504 mSolverCounterUnsat, 60 mSDtfsCounter, 4987 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 294 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1351occurred in iteration=10, InterpolantAutomatonStates: 235, 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.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 23.0s InterpolantComputationTime, 742 NumberOfCodeBlocks, 742 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 684 ConstructedInterpolants, 0 QuantifiedInterpolants, 10283 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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:38:26,149 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...