/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 21:06:01,382 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 21:06:01,436 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 21:06:01,442 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 21:06:01,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 21:06:01,468 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 21:06:01,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 21:06:01,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 21:06:01,470 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 21:06:01,470 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 21:06:01,471 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 21:06:01,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 21:06:01,471 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 21:06:01,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 21:06:01,472 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:01,472 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 21:06:01,472 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:01,472 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 21:06:01,473 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 21:06:01,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 21:06:01,726 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 21:06:01,728 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 21:06:01,729 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 21:06:01,729 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 21:06:01,731 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-13 21:06:03,042 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e531cc41/17c41f70db594a54a2cf6bbd78929df0/FLAG33e462ecd [2025-04-13 21:06:03,305 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 21:06:03,306 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2025-04-13 21:06:03,321 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e531cc41/17c41f70db594a54a2cf6bbd78929df0/FLAG33e462ecd [2025-04-13 21:06:04,093 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e531cc41/17c41f70db594a54a2cf6bbd78929df0 [2025-04-13 21:06:04,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 21:06:04,097 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 21:06:04,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:04,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 21:06:04,102 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 21:06:04,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42d8c2d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04, skipping insertion in model container [2025-04-13 21:06:04,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 21:06:04,462 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-13 21:06:04,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:04,485 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 21:06:04,542 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-13 21:06:04,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 21:06:04,586 INFO L204 MainTranslator]: Completed translation [2025-04-13 21:06:04,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04 WrapperNode [2025-04-13 21:06:04,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 21:06:04,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:04,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 21:06:04,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 21:06:04,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,614 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,641 INFO L138 Inliner]: procedures = 243, calls = 26, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 260 [2025-04-13 21:06:04,641 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 21:06:04,643 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 21:06:04,643 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 21:06:04,643 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 21:06:04,650 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,653 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,672 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-13 21:06:04,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,681 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,686 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,688 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,696 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 21:06:04,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 21:06:04,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 21:06:04,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 21:06:04,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (1/1) ... [2025-04-13 21:06:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 21:06:04,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:04,727 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 21:06:04,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 21:06:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 21:06:04,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 21:06:04,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 21:06:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 21:06:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 21:06:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 21:06:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 21:06:04,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 21:06:04,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 21:06:04,750 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 21:06:04,878 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 21:06:04,880 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 21:06:05,206 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 21:06:05,206 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 21:06:05,206 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 21:06:07,365 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:07,367 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 21:06:07,372 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 21:06:07,373 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:07 BoogieIcfgContainer [2025-04-13 21:06:07,373 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 21:06:07,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 21:06:07,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 21:06:07,379 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 21:06:07,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 09:06:04" (1/3) ... [2025-04-13 21:06:07,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e04cc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:07, skipping insertion in model container [2025-04-13 21:06:07,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 09:06:04" (2/3) ... [2025-04-13 21:06:07,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e04cc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 09:06:07, skipping insertion in model container [2025-04-13 21:06:07,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 09:06:07" (3/3) ... [2025-04-13 21:06:07,381 INFO L128 eAbstractionObserver]: Analyzing ICFG arithmetic_prog_ok.i [2025-04-13 21:06:07,393 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 21:06:07,395 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-13 21:06:07,395 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 21:06:07,445 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 21:06:07,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 34 places, 33 transitions, 80 flow [2025-04-13 21:06:07,506 INFO L116 PetriNetUnfolderBase]: 6/31 cut-off events. [2025-04-13 21:06:07,507 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:06:07,510 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 56 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-13 21:06:07,510 INFO L82 GeneralOperation]: Start removeDead. Operand has 34 places, 33 transitions, 80 flow [2025-04-13 21:06:07,512 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 30 transitions, 72 flow [2025-04-13 21:06:07,522 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 21:06:07,534 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;@2bcb51c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 21:06:07,534 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 21:06:07,553 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 21:06:07,553 INFO L116 PetriNetUnfolderBase]: 6/29 cut-off events. [2025-04-13 21:06:07,553 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 21:06:07,553 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:07,554 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:07,554 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-13 21:06:07,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:07,558 INFO L85 PathProgramCache]: Analyzing trace with hash 918047284, now seen corresponding path program 1 times [2025-04-13 21:06:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:07,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526423107] [2025-04-13 21:06:07,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 21:06:07,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 21:06:07,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:07,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:08,166 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526423107] [2025-04-13 21:06:08,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526423107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:08,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:08,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 21:06:08,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388302799] [2025-04-13 21:06:08,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:08,174 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 21:06:08,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:08,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 21:06:08,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 21:06:08,199 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:08,201 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-13 21:06:08,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:08,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:08,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:08,352 INFO L116 PetriNetUnfolderBase]: 256/439 cut-off events. [2025-04-13 21:06:08,353 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 21:06:08,355 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 1648 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-13 21:06:08,359 INFO L140 encePairwiseOnDemand]: 31/33 looper letters, 24 selfloop transitions, 0 changer transitions 0/28 dead transitions. [2025-04-13 21:06:08,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 28 transitions, 116 flow [2025-04-13 21:06:08,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 21:06:08,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 21:06:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 38 transitions. [2025-04-13 21:06:08,371 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5757575757575758 [2025-04-13 21:06:08,373 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 72 flow. Second operand 2 states and 38 transitions. [2025-04-13 21:06:08,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 28 transitions, 116 flow [2025-04-13 21:06:08,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 108 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:06:08,381 INFO L231 Difference]: Finished difference. Result has 28 places, 28 transitions, 60 flow [2025-04-13 21:06:08,383 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-13 21:06:08,387 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-13 21:06:08,387 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 28 transitions, 60 flow [2025-04-13 21:06:08,387 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-13 21:06:08,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:08,387 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:08,387 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 21:06:08,388 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-13 21:06:08,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:08,388 INFO L85 PathProgramCache]: Analyzing trace with hash -311441943, now seen corresponding path program 1 times [2025-04-13 21:06:08,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:08,388 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119916826] [2025-04-13 21:06:08,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:08,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:06:08,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:06:08,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:08,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:08,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:08,832 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119916826] [2025-04-13 21:06:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119916826] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:08,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122664358] [2025-04-13 21:06:08,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:08,833 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:08,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:08,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:08,834 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:08,834 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-13 21:06:08,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:08,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:08,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:08,985 INFO L116 PetriNetUnfolderBase]: 164/324 cut-off events. [2025-04-13 21:06:08,985 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 21:06:08,986 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 1199 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-13 21:06:08,987 INFO L140 encePairwiseOnDemand]: 25/33 looper letters, 26 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-04-13 21:06:08,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 38 transitions, 150 flow [2025-04-13 21:06:08,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:08,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:08,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2025-04-13 21:06:08,990 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5656565656565656 [2025-04-13 21:06:08,990 INFO L175 Difference]: Start difference. First operand has 28 places, 28 transitions, 60 flow. Second operand 3 states and 56 transitions. [2025-04-13 21:06:08,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 38 transitions, 150 flow [2025-04-13 21:06:08,991 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 38 transitions, 150 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 21:06:08,992 INFO L231 Difference]: Finished difference. Result has 30 places, 28 transitions, 76 flow [2025-04-13 21:06:08,992 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-13 21:06:08,993 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 21:06:08,993 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 28 transitions, 76 flow [2025-04-13 21:06:08,993 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-13 21:06:08,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:08,993 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 21:06:08,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 21:06:08,993 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-13 21:06:08,994 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:08,994 INFO L85 PathProgramCache]: Analyzing trace with hash 129011025, now seen corresponding path program 2 times [2025-04-13 21:06:08,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:08,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30003777] [2025-04-13 21:06:08,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:08,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:09,278 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-04-13 21:06:09,292 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 21:06:09,292 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 21:06:09,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:09,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:09,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:09,368 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30003777] [2025-04-13 21:06:09,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30003777] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:09,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:09,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:09,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033765426] [2025-04-13 21:06:09,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:09,369 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:09,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:09,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:09,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:09,370 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:09,371 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-13 21:06:09,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:09,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:09,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:09,483 INFO L116 PetriNetUnfolderBase]: 280/547 cut-off events. [2025-04-13 21:06:09,483 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-13 21:06:09,485 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 2246 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-13 21:06:09,490 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 39 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2025-04-13 21:06:09,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 45 transitions, 209 flow [2025-04-13 21:06:09,490 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:09,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:09,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-13 21:06:09,491 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-13 21:06:09,491 INFO L175 Difference]: Start difference. First operand has 30 places, 28 transitions, 76 flow. Second operand 3 states and 60 transitions. [2025-04-13 21:06:09,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 45 transitions, 209 flow [2025-04-13 21:06:09,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 45 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:09,494 INFO L231 Difference]: Finished difference. Result has 32 places, 29 transitions, 80 flow [2025-04-13 21:06:09,494 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-13 21:06:09,495 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-13 21:06:09,495 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 29 transitions, 80 flow [2025-04-13 21:06:09,495 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-13 21:06:09,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:09,495 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-13 21:06:09,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 21:06:09,495 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-13 21:06:09,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1916222718, now seen corresponding path program 1 times [2025-04-13 21:06:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:09,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427076292] [2025-04-13 21:06:09,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:09,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 21:06:09,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 21:06:09,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:09,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:09,743 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-13 21:06:09,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:09,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427076292] [2025-04-13 21:06:09,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427076292] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:09,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 21:06:09,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 21:06:09,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534331938] [2025-04-13 21:06:09,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:09,746 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 21:06:09,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:09,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 21:06:09,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 21:06:09,746 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:09,746 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-13 21:06:09,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:09,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:09,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:09,891 INFO L116 PetriNetUnfolderBase]: 450/882 cut-off events. [2025-04-13 21:06:09,892 INFO L117 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2025-04-13 21:06:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1944 conditions, 882 events. 450/882 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4005 event pairs, 184 based on Foata normal form. 0/821 useless extension candidates. Maximal degree in co-relation 1938. Up to 481 conditions per place. [2025-04-13 21:06:09,896 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 40 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2025-04-13 21:06:09,896 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 46 transitions, 217 flow [2025-04-13 21:06:09,896 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 21:06:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 21:06:09,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-04-13 21:06:09,897 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5959595959595959 [2025-04-13 21:06:09,897 INFO L175 Difference]: Start difference. First operand has 32 places, 29 transitions, 80 flow. Second operand 3 states and 59 transitions. [2025-04-13 21:06:09,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 46 transitions, 217 flow [2025-04-13 21:06:09,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 46 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:09,898 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 90 flow [2025-04-13 21:06:09,898 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-13 21:06:09,899 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2025-04-13 21:06:09,899 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 90 flow [2025-04-13 21:06:09,899 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-13 21:06:09,899 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:09,899 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-13 21:06:09,899 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 21:06:09,899 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-13 21:06:09,900 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:09,900 INFO L85 PathProgramCache]: Analyzing trace with hash 744597314, now seen corresponding path program 1 times [2025-04-13 21:06:09,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:09,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44090557] [2025-04-13 21:06:09,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:09,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:10,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:06:10,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:06:10,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:10,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:10,153 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-13 21:06:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:10,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44090557] [2025-04-13 21:06:10,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44090557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:10,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368266176] [2025-04-13 21:06:10,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 21:06:10,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:10,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:10,157 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-13 21:06:10,158 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-13 21:06:10,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-13 21:06:11,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-13 21:06:11,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 21:06:11,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:11,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-13 21:06:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:11,060 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-13 21:06:11,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:11,098 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-13 21:06:11,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368266176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:11,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:11,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-13 21:06:11,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321681312] [2025-04-13 21:06:11,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:11,099 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:06:11,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:11,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:06:11,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:06:11,100 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:11,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:11,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:11,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:11,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:11,358 INFO L116 PetriNetUnfolderBase]: 783/1564 cut-off events. [2025-04-13 21:06:11,358 INFO L117 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2025-04-13 21:06:11,360 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 7749 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-13 21:06:11,364 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 75 selfloop transitions, 4 changer transitions 0/83 dead transitions. [2025-04-13 21:06:11,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 83 transitions, 415 flow [2025-04-13 21:06:11,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:06:11,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:06:11,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-04-13 21:06:11,365 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6484848484848484 [2025-04-13 21:06:11,365 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 90 flow. Second operand 5 states and 107 transitions. [2025-04-13 21:06:11,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 83 transitions, 415 flow [2025-04-13 21:06:11,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 83 transitions, 407 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:11,367 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 114 flow [2025-04-13 21:06:11,367 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-13 21:06:11,368 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-04-13 21:06:11,368 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 114 flow [2025-04-13 21:06:11,369 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:11,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:11,369 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-13 21:06:11,381 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-13 21:06:11,569 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-13 21:06:11,569 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-13 21:06:11,570 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1239390006, now seen corresponding path program 2 times [2025-04-13 21:06:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:11,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690781162] [2025-04-13 21:06:11,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:11,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:11,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:06:11,742 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:06:11,743 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:11,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:11,806 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-13 21:06:11,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:11,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690781162] [2025-04-13 21:06:11,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690781162] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:11,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240154127] [2025-04-13 21:06:11,806 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 21:06:11,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:11,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:11,808 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-13 21:06:11,810 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-13 21:06:12,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-13 21:06:12,700 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-13 21:06:12,701 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 21:06:12,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:12,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 21:06:12,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:12,729 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-13 21:06:12,729 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 21:06:12,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240154127] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 21:06:12,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 21:06:12,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-04-13 21:06:12,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294298463] [2025-04-13 21:06:12,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 21:06:12,730 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 21:06:12,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:12,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 21:06:12,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:06:12,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-04-13 21:06:12,732 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-13 21:06:12,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:12,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-04-13 21:06:12,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:12,876 INFO L116 PetriNetUnfolderBase]: 859/1633 cut-off events. [2025-04-13 21:06:12,876 INFO L117 PetriNetUnfolderBase]: For 813/813 co-relation queries the response was YES. [2025-04-13 21:06:12,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 1633 events. 859/1633 cut-off events. For 813/813 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7041 event pairs, 214 based on Foata normal form. 0/1452 useless extension candidates. Maximal degree in co-relation 3983. Up to 821 conditions per place. [2025-04-13 21:06:12,887 INFO L140 encePairwiseOnDemand]: 28/33 looper letters, 47 selfloop transitions, 4 changer transitions 0/53 dead transitions. [2025-04-13 21:06:12,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 53 transitions, 299 flow [2025-04-13 21:06:12,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:06:12,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:06:12,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-04-13 21:06:12,888 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2025-04-13 21:06:12,888 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 114 flow. Second operand 4 states and 61 transitions. [2025-04-13 21:06:12,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 53 transitions, 299 flow [2025-04-13 21:06:12,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 288 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:12,893 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 133 flow [2025-04-13 21:06:12,893 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-13 21:06:12,895 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 12 predicate places. [2025-04-13 21:06:12,895 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 133 flow [2025-04-13 21:06:12,895 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-13 21:06:12,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:12,895 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-13 21:06:12,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 21:06:13,095 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-13 21:06:13,096 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-13 21:06:13,096 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:13,096 INFO L85 PathProgramCache]: Analyzing trace with hash -885469634, now seen corresponding path program 3 times [2025-04-13 21:06:13,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:13,096 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330534757] [2025-04-13 21:06:13,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:13,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:13,237 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-13 21:06:13,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 21:06:13,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:06:13,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:13,415 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:13,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:13,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330534757] [2025-04-13 21:06:13,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330534757] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:13,416 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431141604] [2025-04-13 21:06:13,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 21:06:13,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:13,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:13,420 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-13 21:06:13,432 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-13 21:06:14,247 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-13 21:06:14,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 21:06:14,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-13 21:06:14,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:14,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 21:06:14,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:14,365 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:14,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 21:06:14,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431141604] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:14,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:14,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2025-04-13 21:06:14,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081464630] [2025-04-13 21:06:14,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:14,407 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 21:06:14,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:14,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 21:06:14,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-13 21:06:14,408 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:14,408 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-13 21:06:14,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:14,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:14,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:14,648 INFO L116 PetriNetUnfolderBase]: 1341/2749 cut-off events. [2025-04-13 21:06:14,649 INFO L117 PetriNetUnfolderBase]: For 1553/1555 co-relation queries the response was YES. [2025-04-13 21:06:14,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6952 conditions, 2749 events. 1341/2749 cut-off events. For 1553/1555 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 15002 event pairs, 340 based on Foata normal form. 0/2660 useless extension candidates. Maximal degree in co-relation 6940. Up to 1100 conditions per place. [2025-04-13 21:06:14,664 INFO L140 encePairwiseOnDemand]: 30/33 looper letters, 77 selfloop transitions, 4 changer transitions 0/86 dead transitions. [2025-04-13 21:06:14,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 86 transitions, 507 flow [2025-04-13 21:06:14,665 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 21:06:14,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 21:06:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-04-13 21:06:14,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6060606060606061 [2025-04-13 21:06:14,667 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 133 flow. Second operand 5 states and 100 transitions. [2025-04-13 21:06:14,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 86 transitions, 507 flow [2025-04-13 21:06:14,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 86 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:14,672 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 158 flow [2025-04-13 21:06:14,673 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-13 21:06:14,673 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-13 21:06:14,673 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 158 flow [2025-04-13 21:06:14,674 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-13 21:06:14,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:14,674 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-13 21:06:14,685 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-13 21:06:14,874 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-13 21:06:14,874 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-13 21:06:14,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:14,875 INFO L85 PathProgramCache]: Analyzing trace with hash -614003018, now seen corresponding path program 4 times [2025-04-13 21:06:14,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:14,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587475714] [2025-04-13 21:06:14,875 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:06:14,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:15,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 21:06:15,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 21:06:15,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:06:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:15,183 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-13 21:06:15,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:15,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587475714] [2025-04-13 21:06:15,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587475714] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:15,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15887885] [2025-04-13 21:06:15,183 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 21:06:15,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:15,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:15,187 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-13 21:06:15,189 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-13 21:06:15,980 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 50 statements into 2 equivalence classes. [2025-04-13 21:06:16,033 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 21:06:16,034 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 21:06:16,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:16,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-13 21:06:16,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:16,117 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-13 21:06:16,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:16,165 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-13 21:06:16,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15887885] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:16,166 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:16,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-04-13 21:06:16,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397537252] [2025-04-13 21:06:16,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:16,167 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 21:06:16,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:16,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 21:06:16,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-13 21:06:16,172 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 33 [2025-04-13 21:06:16,172 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.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:16,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 33 [2025-04-13 21:06:16,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:16,343 INFO L116 PetriNetUnfolderBase]: 517/1064 cut-off events. [2025-04-13 21:06:16,343 INFO L117 PetriNetUnfolderBase]: For 1129/1129 co-relation queries the response was YES. [2025-04-13 21:06:16,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2979 conditions, 1064 events. 517/1064 cut-off events. For 1129/1129 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 4075 event pairs, 135 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 2965. Up to 500 conditions per place. [2025-04-13 21:06:16,348 INFO L140 encePairwiseOnDemand]: 29/33 looper letters, 50 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2025-04-13 21:06:16,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 55 transitions, 354 flow [2025-04-13 21:06:16,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 21:06:16,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 21:06:16,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2025-04-13 21:06:16,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44696969696969696 [2025-04-13 21:06:16,350 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 158 flow. Second operand 4 states and 59 transitions. [2025-04-13 21:06:16,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 55 transitions, 354 flow [2025-04-13 21:06:16,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 342 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-04-13 21:06:16,352 INFO L231 Difference]: Finished difference. Result has 50 places, 34 transitions, 148 flow [2025-04-13 21:06:16,352 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-13 21:06:16,354 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 19 predicate places. [2025-04-13 21:06:16,354 INFO L485 AbstractCegarLoop]: Abstraction has has 50 places, 34 transitions, 148 flow [2025-04-13 21:06:16,355 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.714285714285714) internal successors, (75), 7 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 21:06:16,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 21:06:16,355 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-13 21:06:16,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 21:06:16,555 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-13 21:06:16,556 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-13 21:06:16,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 21:06:16,557 INFO L85 PathProgramCache]: Analyzing trace with hash 831652608, now seen corresponding path program 5 times [2025-04-13 21:06:16,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 21:06:16,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311458067] [2025-04-13 21:06:16,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:06:16,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 21:06:16,720 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-13 21:06:16,746 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 21:06:16,746 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 21:06:16,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:17,117 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-13 21:06:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 21:06:17,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311458067] [2025-04-13 21:06:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311458067] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 21:06:17,117 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479004231] [2025-04-13 21:06:17,117 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 21:06:17,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 21:06:17,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 21:06:17,120 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-13 21:06:17,121 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-13 21:06:17,937 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 4 equivalence classes. [2025-04-13 21:06:17,982 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 50 of 50 statements. [2025-04-13 21:06:17,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-04-13 21:06:17,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 21:06:17,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 21:06:17,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 21:06:18,207 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-13 21:06:18,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 21:06:18,483 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-13 21:06:18,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479004231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 21:06:18,483 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 21:06:18,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 27 [2025-04-13 21:06:18,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659848870] [2025-04-13 21:06:18,483 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 21:06:18,484 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-04-13 21:06:18,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 21:06:18,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-04-13 21:06:18,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2025-04-13 21:06:18,485 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 33 [2025-04-13 21:06:18,485 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-13 21:06:18,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 21:06:18,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 33 [2025-04-13 21:06:18,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 21:06:19,343 INFO L116 PetriNetUnfolderBase]: 418/938 cut-off events. [2025-04-13 21:06:19,343 INFO L117 PetriNetUnfolderBase]: For 1003/1003 co-relation queries the response was YES. [2025-04-13 21:06:19,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2542 conditions, 938 events. 418/938 cut-off events. For 1003/1003 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3641 event pairs, 21 based on Foata normal form. 26/963 useless extension candidates. Maximal degree in co-relation 2527. Up to 176 conditions per place. [2025-04-13 21:06:19,346 INFO L140 encePairwiseOnDemand]: 27/33 looper letters, 0 selfloop transitions, 0 changer transitions 113/113 dead transitions. [2025-04-13 21:06:19,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 113 transitions, 695 flow [2025-04-13 21:06:19,346 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 21:06:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 21:06:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 171 transitions. [2025-04-13 21:06:19,347 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47107438016528924 [2025-04-13 21:06:19,347 INFO L175 Difference]: Start difference. First operand has 50 places, 34 transitions, 148 flow. Second operand 11 states and 171 transitions. [2025-04-13 21:06:19,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 113 transitions, 695 flow [2025-04-13 21:06:19,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 113 transitions, 665 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-13 21:06:19,350 INFO L231 Difference]: Finished difference. Result has 55 places, 0 transitions, 0 flow [2025-04-13 21:06:19,350 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-13 21:06:19,350 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2025-04-13 21:06:19,350 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 0 transitions, 0 flow [2025-04-13 21:06:19,350 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-13 21:06:19,352 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 21:06:19,352 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 21:06:19,353 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 21:06:19,364 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-13 21:06:19,553 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-13 21:06:19,554 INFO L422 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1] [2025-04-13 21:06:19,556 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 21:06:19,556 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 21:06:19,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 09:06:19 BasicIcfg [2025-04-13 21:06:19,561 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 21:06:19,561 INFO L158 Benchmark]: Toolchain (without parser) took 15464.83ms. Allocated memory was 142.6MB in the beginning and 708.8MB in the end (delta: 566.2MB). Free memory was 101.7MB in the beginning and 247.2MB in the end (delta: -145.5MB). Peak memory consumption was 422.5MB. Max. memory is 8.0GB. [2025-04-13 21:06:19,561 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:19,562 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.63ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 69.7MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 21:06:19,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.45ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 21:06:19,562 INFO L158 Benchmark]: Boogie Preprocessor took 52.77ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 62.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 21:06:19,562 INFO L158 Benchmark]: RCFGBuilder took 2676.52ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 62.9MB in the beginning and 195.7MB in the end (delta: -132.7MB). Peak memory consumption was 197.8MB. Max. memory is 8.0GB. [2025-04-13 21:06:19,562 INFO L158 Benchmark]: TraceAbstraction took 12186.77ms. Allocated memory was 352.3MB in the beginning and 708.8MB in the end (delta: 356.5MB). Free memory was 195.7MB in the beginning and 247.2MB in the end (delta: -51.5MB). Peak memory consumption was 308.6MB. Max. memory is 8.0GB. [2025-04-13 21:06:19,563 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.38ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 489.63ms. Allocated memory is still 142.6MB. Free memory was 101.7MB in the beginning and 69.7MB in the end (delta: 32.0MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.45ms. Allocated memory is still 142.6MB. Free memory was 69.7MB in the beginning and 66.3MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 52.77ms. Allocated memory is still 142.6MB. Free memory was 66.3MB in the beginning and 62.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2676.52ms. Allocated memory was 142.6MB in the beginning and 352.3MB in the end (delta: 209.7MB). Free memory was 62.9MB in the beginning and 195.7MB in the end (delta: -132.7MB). Peak memory consumption was 197.8MB. Max. memory is 8.0GB. * TraceAbstraction took 12186.77ms. Allocated memory was 352.3MB in the beginning and 708.8MB in the end (delta: 356.5MB). Free memory was 195.7MB in the beginning and 247.2MB in the end (delta: -51.5MB). Peak memory consumption was 308.6MB. 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: 12.1s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 321 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 316 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.2s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 662 ConstructedInterpolants, 0 QuantifiedInterpolants, 2501 SizeOfPredicates, 1 NumberOfNonLiveVariables, 2503 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 18 InterpolantComputations, 5 PerfectInterpolantSequences, 77/329 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-13 21:06:19,591 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...