/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_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:44:32,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:44:33,009 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-14 01:44:33,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:44:33,017 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:44:33,033 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:44:33,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:44:33,034 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:44:33,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:44:33,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:44:33,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:44:33,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:44:33,035 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:44:33,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:44:33,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:33,036 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:33,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:33,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:44:33,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:44:33,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:44:33,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:44:33,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:44:33,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:44:33,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:44:33,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:44:33,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:44:33,038 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:44:33,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:44:33,274 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:44:33,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:44:33,277 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:44:33,279 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:44:33,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-04-14 01:44:34,568 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a789a8df/017d7e9fd0e94769a3a0d57b5d53da11/FLAG2949ba273 [2025-04-14 01:44:34,838 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:44:34,839 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-04-14 01:44:34,849 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a789a8df/017d7e9fd0e94769a3a0d57b5d53da11/FLAG2949ba273 [2025-04-14 01:44:35,568 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a789a8df/017d7e9fd0e94769a3a0d57b5d53da11 [2025-04-14 01:44:35,570 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:44:35,571 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:44:35,572 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:35,572 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:44:35,576 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:44:35,576 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:35,577 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2487e2a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35, skipping insertion in model container [2025-04-14 01:44:35,577 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:35,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:44:35,849 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-deagle/arithmetic_prog_ok.i[39757,39770] [2025-04-14 01:44:35,853 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:35,878 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:44:35,927 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-deagle/arithmetic_prog_ok.i[39757,39770] [2025-04-14 01:44:35,931 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:35,977 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:44:35,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35 WrapperNode [2025-04-14 01:44:35,978 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:35,979 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:35,979 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:44:35,979 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:44:35,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,003 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,032 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-04-14 01:44:36,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:36,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:44:36,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:44:36,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:44:36,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,070 INFO L175 MemorySlicer]: Split 11 memory accesses to 3 slices as follows [2, 1, 8]. 73 percent of accesses are in the largest equivalence class. The 11 initializations are split as follows [2, 1, 8]. The 0 writes are split as follows [0, 0, 0]. [2025-04-14 01:44:36,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,080 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,084 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,086 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:44:36,096 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:44:36,096 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:44:36,096 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:44:36,101 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (1/1) ... [2025-04-14 01:44:36,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:36,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:36,132 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-14 01:44:36,137 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-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:44:36,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:44:36,152 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:44:36,152 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 01:44:36,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:44:36,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:44:36,154 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:44:36,286 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:44:36,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:44:36,546 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:44:36,547 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:44:36,547 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:44:38,473 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:38,474 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:38,479 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:44:38,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:38 BoogieIcfgContainer [2025-04-14 01:44:38,480 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:44:38,481 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:44:38,481 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:44:38,484 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:44:38,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:44:35" (1/3) ... [2025-04-14 01:44:38,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d09491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:38, skipping insertion in model container [2025-04-14 01:44:38,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:35" (2/3) ... [2025-04-14 01:44:38,485 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d09491 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:38, skipping insertion in model container [2025-04-14 01:44:38,485 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:38" (3/3) ... [2025-04-14 01:44:38,486 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-04-14 01:44:38,496 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:44:38,498 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG arithmetic_prog_ok.i that has 3 procedures, 28 locations, 31 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 01:44:38,498 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:44:38,540 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:44:38,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 80 flow [2025-04-14 01:44:38,616 INFO L116 PetriNetUnfolderBase]: 6/31 cut-off events. [2025-04-14 01:44:38,619 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:44:38,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40 conditions, 31 events. 6/31 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 60 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-14 01:44:38,621 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 80 flow [2025-04-14 01:44:38,624 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 72 flow [2025-04-14 01:44:38,631 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:44:38,638 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;@22621851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:44:38,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 01:44:38,668 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:44:38,669 INFO L116 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-04-14 01:44:38,669 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:44:38,669 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:38,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:38,670 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:38,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:38,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1065649999, now seen corresponding path program 1 times [2025-04-14 01:44:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:38,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572001360] [2025-04-14 01:44:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:38,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:39,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:44:39,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:44:39,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:39,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:39,284 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-14 01:44:39,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:39,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572001360] [2025-04-14 01:44:39,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572001360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:39,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:39,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:44:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703375092] [2025-04-14 01:44:39,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:39,290 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:44:39,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:39,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:44:39,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:44:39,311 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:39,312 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 72 flow. Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-14 01:44:39,312 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:39,312 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:39,312 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:39,441 INFO L116 PetriNetUnfolderBase]: 256/439 cut-off events. [2025-04-14 01:44:39,445 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-14 01:44:39,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 867 conditions, 439 events. 256/439 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1645 event pairs, 163 based on Foata normal form. 0/392 useless extension candidates. Maximal degree in co-relation 808. Up to 400 conditions per place. [2025-04-14 01:44:39,451 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2025-04-14 01:44:39,451 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 116 flow [2025-04-14 01:44:39,452 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:44:39,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:44:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2025-04-14 01:44:39,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-14 01:44:39,461 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 72 flow. Second operand 2 states and 38 transitions. [2025-04-14 01:44:39,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 116 flow [2025-04-14 01:44:39,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:44:39,467 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 60 flow [2025-04-14 01:44:39,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=60, PETRI_PLACES=28, PETRI_TRANSITIONS=28} [2025-04-14 01:44:39,473 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-14 01:44:39,473 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 60 flow [2025-04-14 01:44:39,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 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-14 01:44:39,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:39,473 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-14 01:44:39,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:44:39,473 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:39,474 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:39,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1992983502, now seen corresponding path program 1 times [2025-04-14 01:44:39,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:39,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663265634] [2025-04-14 01:44:39,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:39,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:39,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:44:39,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:44:39,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:39,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:39,898 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-14 01:44:39,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:39,899 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663265634] [2025-04-14 01:44:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663265634] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:39,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:39,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:39,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729303509] [2025-04-14 01:44:39,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:39,900 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:39,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:39,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:39,900 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:39,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 28 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 01:44:39,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:39,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:39,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:40,012 INFO L116 PetriNetUnfolderBase]: 164/324 cut-off events. [2025-04-14 01:44:40,012 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:44:40,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 324 events. 164/324 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1204 event pairs, 68 based on Foata normal form. 16/309 useless extension candidates. Maximal degree in co-relation 610. Up to 160 conditions per place. [2025-04-14 01:44:40,015 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 26 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-04-14 01:44:40,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 150 flow [2025-04-14 01:44:40,015 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:40,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:40,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-14 01:44:40,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-04-14 01:44:40,016 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 60 flow. Second operand 3 states and 56 transitions. [2025-04-14 01:44:40,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 150 flow [2025-04-14 01:44:40,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:44:40,017 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 76 flow [2025-04-14 01:44:40,017 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=30, PETRI_TRANSITIONS=28} [2025-04-14 01:44:40,017 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-14 01:44:40,017 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 76 flow [2025-04-14 01:44:40,018 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 01:44:40,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:40,018 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-14 01:44:40,018 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:44:40,018 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:40,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:40,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1127583324, now seen corresponding path program 2 times [2025-04-14 01:44:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:40,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005031807] [2025-04-14 01:44:40,019 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:44:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:40,308 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-14 01:44:40,323 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-14 01:44:40,323 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-14 01:44:40,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:40,390 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-14 01:44:40,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:40,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005031807] [2025-04-14 01:44:40,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005031807] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:40,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:40,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:40,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232138947] [2025-04-14 01:44:40,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:40,391 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:40,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:40,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:40,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:40,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:40,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 28 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 01:44:40,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:40,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:40,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:40,515 INFO L116 PetriNetUnfolderBase]: 280/547 cut-off events. [2025-04-14 01:44:40,515 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-14 01:44:40,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1208 conditions, 547 events. 280/547 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2255 event pairs, 109 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1204. Up to 292 conditions per place. [2025-04-14 01:44:40,520 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 39 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-04-14 01:44:40,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 209 flow [2025-04-14 01:44:40,521 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:40,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:40,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-14 01:44:40,522 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-14 01:44:40,522 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-04-14 01:44:40,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 209 flow [2025-04-14 01:44:40,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:40,524 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 80 flow [2025-04-14 01:44:40,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=32, PETRI_TRANSITIONS=29} [2025-04-14 01:44:40,525 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-14 01:44:40,525 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 80 flow [2025-04-14 01:44:40,525 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-14 01:44:40,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:40,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:40,525 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:44:40,526 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:40,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1223715114, now seen corresponding path program 1 times [2025-04-14 01:44:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:40,528 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531287365] [2025-04-14 01:44:40,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:40,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 01:44:40,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 01:44:40,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:40,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:44:40,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:40,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531287365] [2025-04-14 01:44:40,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531287365] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:40,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:40,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:40,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670588471] [2025-04-14 01:44:40,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:40,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:40,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:40,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:40,779 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:40,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 29 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 01:44:40,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:40,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:40,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:40,904 INFO L116 PetriNetUnfolderBase]: 447/880 cut-off events. [2025-04-14 01:44:40,904 INFO L117 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-04-14 01:44:40,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 880 events. 447/880 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3995 event pairs, 183 based on Foata normal form. 0/818 useless extension candidates. Maximal degree in co-relation 1931. Up to 478 conditions per place. [2025-04-14 01:44:40,910 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 40 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-14 01:44:40,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 217 flow [2025-04-14 01:44:40,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-14 01:44:40,912 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-04-14 01:44:40,912 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 80 flow. Second operand 3 states and 59 transitions. [2025-04-14 01:44:40,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 217 flow [2025-04-14 01:44:40,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:40,915 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 90 flow [2025-04-14 01:44:40,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2025-04-14 01:44:40,916 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-04-14 01:44:40,917 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 90 flow [2025-04-14 01:44:40,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 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-14 01:44:40,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:40,917 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:40,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:44:40,917 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:40,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:40,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1370127053, now seen corresponding path program 1 times [2025-04-14 01:44:40,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:40,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129802950] [2025-04-14 01:44:40,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:40,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:41,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 01:44:41,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:44:41,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:41,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:44:41,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:41,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129802950] [2025-04-14 01:44:41,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129802950] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:41,144 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404095516] [2025-04-14 01:44:41,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:41,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:41,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:41,148 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:44:41,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-14 01:44:41,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-14 01:44:41,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:41,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:41,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:44:41,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:44:41,974 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:42,003 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:44:42,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404095516] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:44:42,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:44:42,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-14 01:44:42,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101265710] [2025-04-14 01:44:42,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:44:42,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:44:42,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:42,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:44:42,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:44:42,005 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:42,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-14 01:44:42,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:42,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:42,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:42,189 INFO L116 PetriNetUnfolderBase]: 783/1564 cut-off events. [2025-04-14 01:44:42,189 INFO L117 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2025-04-14 01:44:42,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3577 conditions, 1564 events. 783/1564 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7721 event pairs, 178 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 3570. Up to 461 conditions per place. [2025-04-14 01:44:42,196 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 75 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-04-14 01:44:42,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 415 flow [2025-04-14 01:44:42,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:44:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:44:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-04-14 01:44:42,197 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-04-14 01:44:42,197 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 90 flow. Second operand 5 states and 107 transitions. [2025-04-14 01:44:42,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 415 flow [2025-04-14 01:44:42,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 83 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:42,199 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2025-04-14 01:44:42,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2025-04-14 01:44:42,199 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-04-14 01:44:42,199 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2025-04-14 01:44:42,200 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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-14 01:44:42,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:42,200 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:42,211 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:44:42,400 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:42,401 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:42,401 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash 743445479, now seen corresponding path program 2 times [2025-04-14 01:44:42,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:42,401 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758159424] [2025-04-14 01:44:42,401 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:44:42,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:42,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 01:44:42,591 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:44:42,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:44:42,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:44:42,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:42,670 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758159424] [2025-04-14 01:44:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758159424] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:42,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [148066494] [2025-04-14 01:44:42,671 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:44:42,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:42,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:42,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:42,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:44:43,405 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 01:44:43,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:44:43,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:44:43,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:43,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-14 01:44:43,477 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:43,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-14 01:44:43,497 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:44:43,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [148066494] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:44:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-04-14 01:44:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683234338] [2025-04-14 01:44:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:43,497 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:44:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:43,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:44:43,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:44:43,502 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-04-14 01:44:43,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 01:44:43,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:43,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-04-14 01:44:43,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:43,673 INFO L116 PetriNetUnfolderBase]: 859/1632 cut-off events. [2025-04-14 01:44:43,673 INFO L117 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2025-04-14 01:44:43,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3991 conditions, 1632 events. 859/1632 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 6980 event pairs, 214 based on Foata normal form. 0/1452 useless extension candidates. Maximal degree in co-relation 3982. Up to 821 conditions per place. [2025-04-14 01:44:43,680 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-04-14 01:44:43,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 299 flow [2025-04-14 01:44:43,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:44:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:44:43,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-14 01:44:43,681 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-04-14 01:44:43,681 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 4 states and 61 transitions. [2025-04-14 01:44:43,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 299 flow [2025-04-14 01:44:43,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 288 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:43,684 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 133 flow [2025-04-14 01:44:43,684 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=133, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-04-14 01:44:43,684 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-14 01:44:43,684 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 133 flow [2025-04-14 01:44:43,684 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-14 01:44:43,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:43,685 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:43,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-14 01:44:43,885 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:44:43,885 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:43,886 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:43,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1275234982, now seen corresponding path program 3 times [2025-04-14 01:44:43,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:43,886 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937574730] [2025-04-14 01:44:43,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:44:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:44,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-14 01:44:44,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:44:44,060 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:44:44,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:44,143 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:44,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:44,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937574730] [2025-04-14 01:44:44,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937574730] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:44,143 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1517167587] [2025-04-14 01:44:44,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:44:44,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:44,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:44,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:44,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:44:44,911 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-14 01:44:44,977 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:44:44,977 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:44:44,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:44,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 01:44:44,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:45,013 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:45,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:45,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:45,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1517167587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:44:45,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:44:45,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-14 01:44:45,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864861597] [2025-04-14 01:44:45,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:44:45,050 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:44:45,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:45,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:44:45,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:44:45,051 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:45,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 133 flow. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-14 01:44:45,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:45,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:45,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:45,269 INFO L116 PetriNetUnfolderBase]: 1342/2749 cut-off events. [2025-04-14 01:44:45,269 INFO L117 PetriNetUnfolderBase]: For 1551/1553 co-relation queries the response was YES. [2025-04-14 01:44:45,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6954 conditions, 2749 events. 1342/2749 cut-off events. For 1551/1553 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15026 event pairs, 340 based on Foata normal form. 0/2661 useless extension candidates. Maximal degree in co-relation 6942. Up to 1101 conditions per place. [2025-04-14 01:44:45,283 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 77 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2025-04-14 01:44:45,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 507 flow [2025-04-14 01:44:45,284 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:44:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:44:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-14 01:44:45,286 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-14 01:44:45,286 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 133 flow. Second operand 5 states and 100 transitions. [2025-04-14 01:44:45,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 507 flow [2025-04-14 01:44:45,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 86 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:45,291 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 158 flow [2025-04-14 01:44:45,291 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=158, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-04-14 01:44:45,292 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-14 01:44:45,292 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 158 flow [2025-04-14 01:44:45,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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-14 01:44:45,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:45,292 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:45,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:44:45,492 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:45,493 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:45,493 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:45,493 INFO L85 PathProgramCache]: Analyzing trace with hash 179117823, now seen corresponding path program 4 times [2025-04-14 01:44:45,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:45,493 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923613378] [2025-04-14 01:44:45,493 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:44:45,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:45,642 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-14 01:44:45,655 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 01:44:45,655 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:44:45,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:44:45,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:45,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923613378] [2025-04-14 01:44:45,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923613378] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:45,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407721974] [2025-04-14 01:44:45,865 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:44:45,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:45,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:45,868 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:45,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:44:46,669 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-14 01:44:46,710 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 01:44:46,710 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:44:46,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:46,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 01:44:46,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:46,764 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:44:46,765 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:46,808 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:44:46,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407721974] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:44:46,808 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:44:46,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-14 01:44:46,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092574347] [2025-04-14 01:44:46,808 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:44:46,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:44:46,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:46,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:44:46,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:44:46,812 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-04-14 01:44:46,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 158 flow. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-14 01:44:46,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:46,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-04-14 01:44:46,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:46,966 INFO L116 PetriNetUnfolderBase]: 517/1063 cut-off events. [2025-04-14 01:44:46,967 INFO L117 PetriNetUnfolderBase]: For 1128/1128 co-relation queries the response was YES. [2025-04-14 01:44:46,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2978 conditions, 1063 events. 517/1063 cut-off events. For 1128/1128 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4045 event pairs, 135 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 2964. Up to 500 conditions per place. [2025-04-14 01:44:46,972 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 50 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-04-14 01:44:46,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 354 flow [2025-04-14 01:44:46,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:44:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:44:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-14 01:44:46,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-04-14 01:44:46,974 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 158 flow. Second operand 4 states and 59 transitions. [2025-04-14 01:44:46,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 354 flow [2025-04-14 01:44:46,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 342 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:46,976 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 148 flow [2025-04-14 01:44:46,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=50, PETRI_TRANSITIONS=34} [2025-04-14 01:44:46,976 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2025-04-14 01:44:46,976 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 148 flow [2025-04-14 01:44:46,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 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-14 01:44:46,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:46,978 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:46,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 01:44:47,178 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:47,178 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 01:44:47,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:47,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1132911589, now seen corresponding path program 5 times [2025-04-14 01:44:47,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:47,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919673784] [2025-04-14 01:44:47,179 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:44:47,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:47,320 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-14 01:44:47,344 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 01:44:47,344 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 01:44:47,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:47,676 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:47,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:47,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919673784] [2025-04-14 01:44:47,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919673784] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:47,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [42296469] [2025-04-14 01:44:47,677 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:44:47,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:47,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:47,679 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:47,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:44:48,467 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-14 01:44:48,513 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-14 01:44:48,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-14 01:44:48,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:48,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-14 01:44:48,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:48,724 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:48,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [42296469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:44:48,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:44:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-04-14 01:44:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331779694] [2025-04-14 01:44:48,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:44:48,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-14 01:44:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-14 01:44:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-04-14 01:44:48,999 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-14 01:44:48,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 34 transitions, 148 flow. Second operand has 29 states, 29 states have (on average 10.068965517241379) internal successors, (292), 29 states have internal predecessors, (292), 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-14 01:44:48,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:48,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-14 01:44:48,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:49,843 INFO L116 PetriNetUnfolderBase]: 418/937 cut-off events. [2025-04-14 01:44:49,843 INFO L117 PetriNetUnfolderBase]: For 1000/1000 co-relation queries the response was YES. [2025-04-14 01:44:49,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2541 conditions, 937 events. 418/937 cut-off events. For 1000/1000 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3637 event pairs, 21 based on Foata normal form. 26/962 useless extension candidates. Maximal degree in co-relation 2526. Up to 176 conditions per place. [2025-04-14 01:44:49,846 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2025-04-14 01:44:49,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 695 flow [2025-04-14 01:44:49,847 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 01:44:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-14 01:44:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2025-04-14 01:44:49,848 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2025-04-14 01:44:49,849 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 148 flow. Second operand 11 states and 171 transitions. [2025-04-14 01:44:49,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 695 flow [2025-04-14 01:44:49,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 113 transitions, 665 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 01:44:49,851 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2025-04-14 01:44:49,851 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=33, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=55, PETRI_TRANSITIONS=0} [2025-04-14 01:44:49,852 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-04-14 01:44:49,852 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2025-04-14 01:44:49,853 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 10.068965517241379) internal successors, (292), 29 states have internal predecessors, (292), 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-14 01:44:49,854 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 01:44:49,855 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 01:44:49,855 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 01:44:49,865 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:44:50,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:50,056 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2025-04-14 01:44:50,058 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:44:50,058 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:44:50,062 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:44:50 BasicIcfg [2025-04-14 01:44:50,062 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:44:50,062 INFO L158 Benchmark]: Toolchain (without parser) took 14491.48ms. Allocated memory was 142.6MB in the beginning and 717.2MB in the end (delta: 574.6MB). Free memory was 99.2MB in the beginning and 386.4MB in the end (delta: -287.1MB). Peak memory consumption was 289.0MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,062 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:44:50,062 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.90ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 68.4MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,063 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.02ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 65.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,063 INFO L158 Benchmark]: Boogie Preprocessor took 63.25ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 62.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,063 INFO L158 Benchmark]: IcfgBuilder took 2383.36ms. Allocated memory was 142.6MB in the beginning and 373.3MB in the end (delta: 230.7MB). Free memory was 62.1MB in the beginning and 232.8MB in the end (delta: -170.6MB). Peak memory consumption was 210.5MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,063 INFO L158 Benchmark]: TraceAbstraction took 11580.86ms. Allocated memory was 373.3MB in the beginning and 717.2MB in the end (delta: 343.9MB). Free memory was 232.8MB in the beginning and 386.4MB in the end (delta: -153.6MB). Peak memory consumption was 191.8MB. Max. memory is 8.0GB. [2025-04-14 01:44:50,064 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.20ms. Allocated memory is still 155.2MB. Free memory is still 85.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 406.90ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 68.4MB in the end (delta: 30.8MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.02ms. Allocated memory is still 142.6MB. Free memory was 68.4MB in the beginning and 65.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 63.25ms. Allocated memory is still 142.6MB. Free memory was 65.3MB in the beginning and 62.1MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 2383.36ms. Allocated memory was 142.6MB in the beginning and 373.3MB in the end (delta: 230.7MB). Free memory was 62.1MB in the beginning and 232.8MB in the end (delta: -170.6MB). Peak memory consumption was 210.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11580.86ms. Allocated memory was 373.3MB in the beginning and 717.2MB in the end (delta: 343.9MB). Free memory was 232.8MB in the beginning and 386.4MB in the end (delta: -153.6MB). Peak memory consumption was 191.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 919]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 48 locations, 59 edges, 3 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: 11.5s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 324 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 319 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2456 IncrementalHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 0 mSDtfsCounter, 2456 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 420 GetRequests, 371 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158occurred in iteration=7, InterpolantAutomatonStates: 40, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 2499 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2503 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 77/335 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-14 01:44:50,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...