/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/weaver/popl20-more-vector-add.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:44:56,816 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:44:56,875 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 20:44:56,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:44:56,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:44:56,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:44:56,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:44:56,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:44:56,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:44:56,902 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:44:56,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:44:56,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:44:56,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:44:56,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:44:56,903 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:44:56,904 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:44:56,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:56,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:56,905 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:44:56,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:44:56,905 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 20:44:57,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:44:57,126 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:44:57,128 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:44:57,129 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:44:57,130 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:44:57,131 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2025-04-13 20:44:58,357 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78588b6f1/456413f9d1d540e3a4b35eefc7e36eed/FLAGae45f4251 [2025-04-13 20:44:58,571 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:44:58,572 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c [2025-04-13 20:44:58,581 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78588b6f1/456413f9d1d540e3a4b35eefc7e36eed/FLAGae45f4251 [2025-04-13 20:44:59,358 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/78588b6f1/456413f9d1d540e3a4b35eefc7e36eed [2025-04-13 20:44:59,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:44:59,361 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:44:59,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:44:59,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:44:59,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:44:59,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66b155e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59, skipping insertion in model container [2025-04-13 20:44:59,366 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,383 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:44:59,520 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2025-04-13 20:44:59,526 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:44:59,533 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:44:59,555 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-vector-add.wvr.c[2637,2650] [2025-04-13 20:44:59,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:44:59,568 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:44:59,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59 WrapperNode [2025-04-13 20:44:59,570 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:44:59,570 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:44:59,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:44:59,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:44:59,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,581 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,603 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 11, calls inlined = 17, statements flattened = 173 [2025-04-13 20:44:59,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:44:59,604 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:44:59,604 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:44:59,604 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:44:59,611 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,633 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 7 writes are split as follows [0, 7]. [2025-04-13 20:44:59,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,638 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,642 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,647 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:44:59,648 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:44:59,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:44:59,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:44:59,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (1/1) ... [2025-04-13 20:44:59,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:44:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:59,671 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 20:44:59,673 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 20:44:59,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:44:59,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:44:59,688 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:44:59,688 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:44:59,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:44:59,689 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:44:59,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:44:59,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:44:59,690 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 20:44:59,783 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:44:59,784 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:45:00,054 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:45:00,055 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:45:00,055 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:45:00,296 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:45:00,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:45:00 BoogieIcfgContainer [2025-04-13 20:45:00,297 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:45:00,298 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:45:00,298 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:45:00,302 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:45:00,302 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:44:59" (1/3) ... [2025-04-13 20:45:00,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124ed3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:45:00, skipping insertion in model container [2025-04-13 20:45:00,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:44:59" (2/3) ... [2025-04-13 20:45:00,303 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124ed3ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:45:00, skipping insertion in model container [2025-04-13 20:45:00,303 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:45:00" (3/3) ... [2025-04-13 20:45:00,304 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-vector-add.wvr.c [2025-04-13 20:45:00,318 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:45:00,319 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-vector-add.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 7 loop locations, and 1 error locations. [2025-04-13 20:45:00,319 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:45:00,354 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:45:00,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:45:00,400 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:45:00,401 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:45:00,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-13 20:45:00,403 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:45:00,409 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:45:00,415 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:45:00,427 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;@b470fae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:45:00,428 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:45:00,435 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:45:00,435 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:45:00,435 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:45:00,435 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:00,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:00,436 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:00,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:00,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1539422741, now seen corresponding path program 1 times [2025-04-13 20:45:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:00,445 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429310502] [2025-04-13 20:45:00,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:00,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:45:00,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:45:00,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:00,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:00,839 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 20:45:00,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:00,840 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429310502] [2025-04-13 20:45:00,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429310502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:00,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:45:00,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:45:00,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156055342] [2025-04-13 20:45:00,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:00,846 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 20:45:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:00,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 20:45:00,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-13 20:45:00,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:00,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 20:45:00,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:00,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:00,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:01,060 INFO L116 PetriNetUnfolderBase]: 411/610 cut-off events. [2025-04-13 20:45:01,061 INFO L117 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2025-04-13 20:45:01,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 610 events. 411/610 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1692 event pairs, 248 based on Foata normal form. 1/447 useless extension candidates. Maximal degree in co-relation 534. Up to 301 conditions per place. [2025-04-13 20:45:01,069 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 24 selfloop transitions, 8 changer transitions 34/66 dead transitions. [2025-04-13 20:45:01,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 66 transitions, 300 flow [2025-04-13 20:45:01,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:45:01,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:45:01,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 82 transitions. [2025-04-13 20:45:01,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5125 [2025-04-13 20:45:01,081 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 5 states and 82 transitions. [2025-04-13 20:45:01,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 66 transitions, 300 flow [2025-04-13 20:45:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 66 transitions, 276 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:01,091 INFO L231 Difference]: Finished difference. Result has 32 places, 32 transitions, 114 flow [2025-04-13 20:45:01,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=114, PETRI_PLACES=32, PETRI_TRANSITIONS=32} [2025-04-13 20:45:01,094 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-13 20:45:01,094 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 32 transitions, 114 flow [2025-04-13 20:45:01,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 20:45:01,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:01,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:01,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:45:01,095 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:01,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:01,095 INFO L85 PathProgramCache]: Analyzing trace with hash -719112087, now seen corresponding path program 1 times [2025-04-13 20:45:01,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:01,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751408422] [2025-04-13 20:45:01,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:01,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:45:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:01,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:01,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,250 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:01,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:01,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751408422] [2025-04-13 20:45:01,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751408422] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083136650] [2025-04-13 20:45:01,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:01,253 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 20:45:01,260 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 20:45:01,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:45:01,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:01,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:01,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:01,352 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:01,409 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:01,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:01,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083136650] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:01,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-13 20:45:01,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807110939] [2025-04-13 20:45:01,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:01,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-13 20:45:01,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:01,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-13 20:45:01,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:45:01,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:01,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 32 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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 20:45:01,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:01,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:01,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:01,545 INFO L116 PetriNetUnfolderBase]: 262/389 cut-off events. [2025-04-13 20:45:01,545 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:45:01,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 389 events. 262/389 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1025 event pairs, 124 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 814. Up to 303 conditions per place. [2025-04-13 20:45:01,548 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 40 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-04-13 20:45:01,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 44 transitions, 228 flow [2025-04-13 20:45:01,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 20:45:01,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 20:45:01,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2025-04-13 20:45:01,548 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-13 20:45:01,548 INFO L175 Difference]: Start difference. First operand has 32 places, 32 transitions, 114 flow. Second operand 5 states and 57 transitions. [2025-04-13 20:45:01,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 44 transitions, 228 flow [2025-04-13 20:45:01,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 44 transitions, 210 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:01,554 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 112 flow [2025-04-13 20:45:01,554 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2025-04-13 20:45:01,554 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1 predicate places. [2025-04-13 20:45:01,554 INFO L485 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 112 flow [2025-04-13 20:45:01,554 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 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 20:45:01,554 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:01,555 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:01,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:45:01,755 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,755 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:01,756 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1722498590, now seen corresponding path program 1 times [2025-04-13 20:45:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:01,756 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611497041] [2025-04-13 20:45:01,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:01,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:45:01,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:01,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:01,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:01,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:01,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611497041] [2025-04-13 20:45:01,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611497041] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:01,944 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955576201] [2025-04-13 20:45:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:01,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:01,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:01,946 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 20:45:01,947 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 20:45:02,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:45:02,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:02,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:02,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:02,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:02,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:02,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:02,191 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:02,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955576201] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:02,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:02,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7, 6] total 13 [2025-04-13 20:45:02,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019319805] [2025-04-13 20:45:02,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:02,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:45:02,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:02,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:45:02,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:45:02,193 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:02,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 112 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:02,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:02,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:02,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:02,395 INFO L116 PetriNetUnfolderBase]: 443/655 cut-off events. [2025-04-13 20:45:02,395 INFO L117 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2025-04-13 20:45:02,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1575 conditions, 655 events. 443/655 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2061 event pairs, 169 based on Foata normal form. 0/490 useless extension candidates. Maximal degree in co-relation 1529. Up to 388 conditions per place. [2025-04-13 20:45:02,399 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 61 selfloop transitions, 7 changer transitions 0/68 dead transitions. [2025-04-13 20:45:02,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 68 transitions, 356 flow [2025-04-13 20:45:02,399 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:02,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:02,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 83 transitions. [2025-04-13 20:45:02,400 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3705357142857143 [2025-04-13 20:45:02,400 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 112 flow. Second operand 7 states and 83 transitions. [2025-04-13 20:45:02,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 68 transitions, 356 flow [2025-04-13 20:45:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 336 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-13 20:45:02,402 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 144 flow [2025-04-13 20:45:02,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=144, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 20:45:02,403 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2025-04-13 20:45:02,403 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 144 flow [2025-04-13 20:45:02,403 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:02,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:02,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:02,410 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 20:45:02,604 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,SelfDestructingSolverStorable2 [2025-04-13 20:45:02,604 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:02,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:02,604 INFO L85 PathProgramCache]: Analyzing trace with hash -563246820, now seen corresponding path program 2 times [2025-04-13 20:45:02,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:02,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319553848] [2025-04-13 20:45:02,605 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:45:02,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:02,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:02,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-13 20:45:02,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:45:02,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:45:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:02,716 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319553848] [2025-04-13 20:45:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319553848] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:45:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:45:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948596805] [2025-04-13 20:45:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:02,717 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:45:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:02,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:45:02,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:45:02,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:02,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 144 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:02,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:02,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:02,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:02,967 INFO L116 PetriNetUnfolderBase]: 693/1023 cut-off events. [2025-04-13 20:45:02,967 INFO L117 PetriNetUnfolderBase]: For 610/610 co-relation queries the response was YES. [2025-04-13 20:45:02,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2970 conditions, 1023 events. 693/1023 cut-off events. For 610/610 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3609 event pairs, 291 based on Foata normal form. 1/805 useless extension candidates. Maximal degree in co-relation 2921. Up to 642 conditions per place. [2025-04-13 20:45:02,974 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 65 selfloop transitions, 7 changer transitions 9/81 dead transitions. [2025-04-13 20:45:02,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 81 transitions, 466 flow [2025-04-13 20:45:02,974 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:45:02,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:45:02,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-13 20:45:02,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2025-04-13 20:45:02,976 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 144 flow. Second operand 6 states and 83 transitions. [2025-04-13 20:45:02,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 81 transitions, 466 flow [2025-04-13 20:45:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 81 transitions, 445 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:02,978 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 184 flow [2025-04-13 20:45:02,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2025-04-13 20:45:02,980 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 14 predicate places. [2025-04-13 20:45:02,980 INFO L485 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 184 flow [2025-04-13 20:45:02,980 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:02,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:02,980 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:02,981 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:45:02,981 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:02,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:02,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1728979300, now seen corresponding path program 3 times [2025-04-13 20:45:02,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:02,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812032268] [2025-04-13 20:45:02,981 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:45:02,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:02,990 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:02,998 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-13 20:45:02,998 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:45:02,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:03,069 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:45:03,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:03,070 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812032268] [2025-04-13 20:45:03,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812032268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:03,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:45:03,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:45:03,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761704297] [2025-04-13 20:45:03,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:03,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:45:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:03,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:45:03,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:45:03,071 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:03,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:03,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:03,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:03,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:03,272 INFO L116 PetriNetUnfolderBase]: 748/1097 cut-off events. [2025-04-13 20:45:03,272 INFO L117 PetriNetUnfolderBase]: For 1277/1277 co-relation queries the response was YES. [2025-04-13 20:45:03,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3669 conditions, 1097 events. 748/1097 cut-off events. For 1277/1277 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3916 event pairs, 366 based on Foata normal form. 1/922 useless extension candidates. Maximal degree in co-relation 3645. Up to 827 conditions per place. [2025-04-13 20:45:03,278 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 11 changer transitions 9/81 dead transitions. [2025-04-13 20:45:03,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 81 transitions, 512 flow [2025-04-13 20:45:03,279 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:45:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:45:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2025-04-13 20:45:03,280 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4322916666666667 [2025-04-13 20:45:03,280 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 184 flow. Second operand 6 states and 83 transitions. [2025-04-13 20:45:03,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 81 transitions, 512 flow [2025-04-13 20:45:03,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 81 transitions, 486 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-04-13 20:45:03,285 INFO L231 Difference]: Finished difference. Result has 51 places, 47 transitions, 255 flow [2025-04-13 20:45:03,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=255, PETRI_PLACES=51, PETRI_TRANSITIONS=47} [2025-04-13 20:45:03,286 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 20 predicate places. [2025-04-13 20:45:03,286 INFO L485 AbstractCegarLoop]: Abstraction has has 51 places, 47 transitions, 255 flow [2025-04-13 20:45:03,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:03,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:03,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:03,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:45:03,286 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:03,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:03,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1302914318, now seen corresponding path program 4 times [2025-04-13 20:45:03,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:03,287 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993918189] [2025-04-13 20:45:03,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:03,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:03,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:03,302 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-13 20:45:03,304 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:03,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:03,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:03,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:03,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993918189] [2025-04-13 20:45:03,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993918189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:03,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213810646] [2025-04-13 20:45:03,357 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:03,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:03,359 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 20:45:03,360 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 20:45:03,413 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:03,428 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-13 20:45:03,428 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:45:03,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:03,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:03,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:03,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:03,523 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:03,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213810646] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:03,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:03,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2025-04-13 20:45:03,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050408172] [2025-04-13 20:45:03,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:03,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:45:03,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:03,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:45:03,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:45:03,525 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:03,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 47 transitions, 255 flow. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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 20:45:03,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:03,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:03,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:04,013 INFO L116 PetriNetUnfolderBase]: 911/1342 cut-off events. [2025-04-13 20:45:04,014 INFO L117 PetriNetUnfolderBase]: For 3609/3609 co-relation queries the response was YES. [2025-04-13 20:45:04,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5057 conditions, 1342 events. 911/1342 cut-off events. For 3609/3609 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5473 event pairs, 62 based on Foata normal form. 6/1132 useless extension candidates. Maximal degree in co-relation 5021. Up to 364 conditions per place. [2025-04-13 20:45:04,022 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 161 selfloop transitions, 47 changer transitions 0/208 dead transitions. [2025-04-13 20:45:04,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 208 transitions, 1704 flow [2025-04-13 20:45:04,023 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:45:04,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:45:04,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 183 transitions. [2025-04-13 20:45:04,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33639705882352944 [2025-04-13 20:45:04,024 INFO L175 Difference]: Start difference. First operand has 51 places, 47 transitions, 255 flow. Second operand 17 states and 183 transitions. [2025-04-13 20:45:04,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 208 transitions, 1704 flow [2025-04-13 20:45:04,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 208 transitions, 1530 flow, removed 37 selfloop flow, removed 3 redundant places. [2025-04-13 20:45:04,036 INFO L231 Difference]: Finished difference. Result has 75 places, 94 transitions, 830 flow [2025-04-13 20:45:04,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=830, PETRI_PLACES=75, PETRI_TRANSITIONS=94} [2025-04-13 20:45:04,037 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 44 predicate places. [2025-04-13 20:45:04,037 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 94 transitions, 830 flow [2025-04-13 20:45:04,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 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 20:45:04,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:04,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:04,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:04,238 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:04,238 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:04,239 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:04,239 INFO L85 PathProgramCache]: Analyzing trace with hash 843112948, now seen corresponding path program 5 times [2025-04-13 20:45:04,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:04,239 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602460025] [2025-04-13 20:45:04,239 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:04,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:04,252 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:04,270 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:04,270 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:04,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:04,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602460025] [2025-04-13 20:45:04,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602460025] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:04,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355728670] [2025-04-13 20:45:04,365 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:45:04,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:04,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:04,368 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 20:45:04,369 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 20:45:04,421 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:04,449 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:04,449 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:45:04,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:04,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:45:04,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:04,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 20:45:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355728670] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:04,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 20:45:04,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-04-13 20:45:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719695259] [2025-04-13 20:45:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:04,506 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:45:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:04,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:45:04,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:45:04,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:04,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 94 transitions, 830 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:04,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:04,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:04,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:04,800 INFO L116 PetriNetUnfolderBase]: 914/1358 cut-off events. [2025-04-13 20:45:04,800 INFO L117 PetriNetUnfolderBase]: For 8085/8085 co-relation queries the response was YES. [2025-04-13 20:45:04,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6422 conditions, 1358 events. 914/1358 cut-off events. For 8085/8085 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5337 event pairs, 350 based on Foata normal form. 3/1247 useless extension candidates. Maximal degree in co-relation 6357. Up to 1020 conditions per place. [2025-04-13 20:45:04,808 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 74 selfloop transitions, 54 changer transitions 10/138 dead transitions. [2025-04-13 20:45:04,809 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 138 transitions, 1409 flow [2025-04-13 20:45:04,810 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:04,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:04,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2025-04-13 20:45:04,810 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38839285714285715 [2025-04-13 20:45:04,810 INFO L175 Difference]: Start difference. First operand has 75 places, 94 transitions, 830 flow. Second operand 7 states and 87 transitions. [2025-04-13 20:45:04,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 138 transitions, 1409 flow [2025-04-13 20:45:04,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 138 transitions, 1351 flow, removed 24 selfloop flow, removed 1 redundant places. [2025-04-13 20:45:04,826 INFO L231 Difference]: Finished difference. Result has 84 places, 106 transitions, 1099 flow [2025-04-13 20:45:04,827 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=780, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1099, PETRI_PLACES=84, PETRI_TRANSITIONS=106} [2025-04-13 20:45:04,828 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 53 predicate places. [2025-04-13 20:45:04,828 INFO L485 AbstractCegarLoop]: Abstraction has has 84 places, 106 transitions, 1099 flow [2025-04-13 20:45:04,828 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:04,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:04,829 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:04,835 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 20:45:05,029 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:05,029 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:05,030 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:05,030 INFO L85 PathProgramCache]: Analyzing trace with hash -1491592104, now seen corresponding path program 6 times [2025-04-13 20:45:05,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:05,030 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498690375] [2025-04-13 20:45:05,030 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:45:05,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:05,046 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 26 statements into 2 equivalence classes. [2025-04-13 20:45:05,055 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 26 statements. [2025-04-13 20:45:05,056 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:45:05,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:05,132 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-13 20:45:05,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:05,133 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498690375] [2025-04-13 20:45:05,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498690375] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:45:05,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:45:05,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-13 20:45:05,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179798629] [2025-04-13 20:45:05,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:05,133 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:45:05,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:05,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:45:05,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:45:05,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:05,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 106 transitions, 1099 flow. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:05,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:05,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:05,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:05,351 INFO L116 PetriNetUnfolderBase]: 927/1377 cut-off events. [2025-04-13 20:45:05,351 INFO L117 PetriNetUnfolderBase]: For 9824/9824 co-relation queries the response was YES. [2025-04-13 20:45:05,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7162 conditions, 1377 events. 927/1377 cut-off events. For 9824/9824 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 5443 event pairs, 351 based on Foata normal form. 2/1265 useless extension candidates. Maximal degree in co-relation 7092. Up to 1039 conditions per place. [2025-04-13 20:45:05,362 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 97 selfloop transitions, 34 changer transitions 10/141 dead transitions. [2025-04-13 20:45:05,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 141 transitions, 1578 flow [2025-04-13 20:45:05,363 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:45:05,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:45:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 82 transitions. [2025-04-13 20:45:05,364 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4270833333333333 [2025-04-13 20:45:05,364 INFO L175 Difference]: Start difference. First operand has 84 places, 106 transitions, 1099 flow. Second operand 6 states and 82 transitions. [2025-04-13 20:45:05,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 141 transitions, 1578 flow [2025-04-13 20:45:05,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 141 transitions, 1376 flow, removed 53 selfloop flow, removed 6 redundant places. [2025-04-13 20:45:05,383 INFO L231 Difference]: Finished difference. Result has 82 places, 107 transitions, 998 flow [2025-04-13 20:45:05,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=82, PETRI_TRANSITIONS=107} [2025-04-13 20:45:05,384 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-04-13 20:45:05,384 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 107 transitions, 998 flow [2025-04-13 20:45:05,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 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 20:45:05,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:05,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:05,384 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-13 20:45:05,384 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:05,384 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -792573184, now seen corresponding path program 7 times [2025-04-13 20:45:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:05,385 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463990127] [2025-04-13 20:45:05,385 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:05,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:45:05,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:05,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:05,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:05,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:05,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463990127] [2025-04-13 20:45:05,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463990127] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:05,509 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693140902] [2025-04-13 20:45:05,509 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:45:05,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:05,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:05,513 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 20:45:05,514 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 20:45:05,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-04-13 20:45:05,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-04-13 20:45:05,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:05,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:05,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:45:05,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:05,662 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:05,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:05,736 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-13 20:45:05,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693140902] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:05,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:45:05,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 20:45:05,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034281897] [2025-04-13 20:45:05,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:45:05,736 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:45:05,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:05,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:45:05,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 20:45:05,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:05,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 107 transitions, 998 flow. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:05,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:05,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:05,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:05,955 INFO L116 PetriNetUnfolderBase]: 887/1299 cut-off events. [2025-04-13 20:45:05,955 INFO L117 PetriNetUnfolderBase]: For 7622/7622 co-relation queries the response was YES. [2025-04-13 20:45:05,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6304 conditions, 1299 events. 887/1299 cut-off events. For 7622/7622 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 4849 event pairs, 286 based on Foata normal form. 14/1199 useless extension candidates. Maximal degree in co-relation 6264. Up to 703 conditions per place. [2025-04-13 20:45:05,963 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 74 selfloop transitions, 56 changer transitions 0/130 dead transitions. [2025-04-13 20:45:05,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 130 transitions, 1348 flow [2025-04-13 20:45:05,964 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:45:05,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:45:05,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2025-04-13 20:45:05,964 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35714285714285715 [2025-04-13 20:45:05,964 INFO L175 Difference]: Start difference. First operand has 82 places, 107 transitions, 998 flow. Second operand 7 states and 80 transitions. [2025-04-13 20:45:05,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 130 transitions, 1348 flow [2025-04-13 20:45:05,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 130 transitions, 1250 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-04-13 20:45:05,976 INFO L231 Difference]: Finished difference. Result has 82 places, 105 transitions, 1007 flow [2025-04-13 20:45:05,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1007, PETRI_PLACES=82, PETRI_TRANSITIONS=105} [2025-04-13 20:45:05,977 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 51 predicate places. [2025-04-13 20:45:05,977 INFO L485 AbstractCegarLoop]: Abstraction has has 82 places, 105 transitions, 1007 flow [2025-04-13 20:45:05,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 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 20:45:05,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:05,977 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:05,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 20:45:06,178 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 20:45:06,178 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:06,179 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:06,179 INFO L85 PathProgramCache]: Analyzing trace with hash -643096378, now seen corresponding path program 1 times [2025-04-13 20:45:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:06,179 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027475405] [2025-04-13 20:45:06,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:06,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:45:06,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:45:06,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:06,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:45:07,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:07,283 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027475405] [2025-04-13 20:45:07,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027475405] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:07,284 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907315748] [2025-04-13 20:45:07,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:45:07,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:07,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:07,286 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:07,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:45:07,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-04-13 20:45:07,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 20:45:07,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:45:07,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:07,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-04-13 20:45:07,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:07,397 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-04-13 20:45:07,450 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-13 20:45:07,450 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-04-13 20:45:07,488 INFO L325 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-04-13 20:45:07,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-04-13 20:45:07,618 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-13 20:45:07,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2025-04-13 20:45:07,783 INFO L325 Elim1Store]: treesize reduction 54, result has 48.1 percent of original size [2025-04-13 20:45:07,784 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 39 treesize of output 64 [2025-04-13 20:45:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:08,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:29,729 INFO L325 Elim1Store]: treesize reduction 102, result has 71.5 percent of original size [2025-04-13 20:45:29,730 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 16 case distinctions, treesize of input 3414 treesize of output 1749 [2025-04-13 20:45:29,844 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:29,845 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1523 treesize of output 1433 [2025-04-13 20:45:30,011 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:45:30,012 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 17 [2025-04-13 20:45:30,463 INFO L325 Elim1Store]: treesize reduction 8, result has 86.0 percent of original size [2025-04-13 20:45:30,463 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-04-13 20:45:30,679 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:45:30,679 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-04-13 20:45:30,743 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-13 20:45:30,744 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-04-13 20:45:31,147 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:31,148 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 587 treesize of output 567 [2025-04-13 20:45:47,169 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:47,169 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 115 treesize of output 131 [2025-04-13 20:45:48,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 226 treesize of output 202 [2025-04-13 20:45:58,022 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:58,022 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 1099 treesize of output 1191 [2025-04-13 20:48:21,429 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2025-04-13 20:48:21,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 101 [2025-04-13 20:48:21,430 WARN L310 FreeRefinementEngine]: Global settings require throwing the following exception [2025-04-13 20:48:21,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:48:21,630 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:21,631 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.checkRedundancy(SimplifyDDA2.java:275) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convertForPreprocessedInputTerms(SimplifyDDA2.java:499) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:484) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.convert(SimplifyDDA2.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SimplifyDDA2.simplify(SimplifyDDA2.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:245) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:318) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:726) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:223) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:115) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:241) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:191) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:103) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:99) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:305) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:56) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:234) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:325) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:181) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:160) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:317) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:427) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:315) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:132) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 76 more [2025-04-13 20:48:21,636 INFO L158 Benchmark]: Toolchain (without parser) took 202275.30ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 99.6MB in the beginning and 754.2MB in the end (delta: -654.7MB). Peak memory consumption was 606.0MB. Max. memory is 8.0GB. [2025-04-13 20:48:21,636 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:48:21,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.43ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 84.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:48:21,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.15ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:48:21,637 INFO L158 Benchmark]: Boogie Preprocessor took 43.39ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:48:21,637 INFO L158 Benchmark]: RCFGBuilder took 648.97ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 76.3MB in the end (delta: 3.4MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2025-04-13 20:48:21,637 INFO L158 Benchmark]: TraceAbstraction took 201337.48ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 75.5MB in the beginning and 754.2MB in the end (delta: -678.7MB). Peak memory consumption was 581.6MB. Max. memory is 8.0GB. [2025-04-13 20:48:21,638 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 95.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.43ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 84.0MB in the end (delta: 15.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 33.15ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 82.3MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.39ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 79.7MB in the end (delta: 2.6MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 648.97ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 76.3MB in the end (delta: 3.4MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. * TraceAbstraction took 201337.48ms. Allocated memory was 142.6MB in the beginning and 981.5MB in the end (delta: 838.9MB). Free memory was 75.5MB in the beginning and 754.2MB in the end (delta: -678.7MB). Peak memory consumption was 581.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...