/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/pthread/queue_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 19:12:02,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 19:12:02,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 19:12:02,792 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 19:12:02,793 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 19:12:02,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 19:12:02,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 19:12:02,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 19:12:02,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 19:12:02,814 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 19:12:02,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 19:12:02,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 19:12:02,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 19:12:02,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 19:12:02,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 19:12:02,816 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:12:02,816 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 19:12:02,816 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:12:02,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 19:12:02,817 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 19:12:03,038 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 19:12:03,046 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 19:12:03,048 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 19:12:03,049 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 19:12:03,049 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 19:12:03,050 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 19:12:04,387 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e11ec432/41d3dc06b5714a5daa6cffd9bee45997/FLAGa065525ce [2025-04-13 19:12:04,619 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 19:12:04,619 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i [2025-04-13 19:12:04,637 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e11ec432/41d3dc06b5714a5daa6cffd9bee45997/FLAGa065525ce [2025-04-13 19:12:05,438 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e11ec432/41d3dc06b5714a5daa6cffd9bee45997 [2025-04-13 19:12:05,440 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 19:12:05,441 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 19:12:05,442 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 19:12:05,442 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 19:12:05,445 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 19:12:05,446 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,446 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc1b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05, skipping insertion in model container [2025-04-13 19:12:05,446 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,477 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 19:12:05,743 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 19:12:05,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 19:12:05,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:12:05,763 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 19:12:05,822 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43266,43279] [2025-04-13 19:12:05,823 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/queue_ok.i[43543,43556] [2025-04-13 19:12:05,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 19:12:05,871 INFO L204 MainTranslator]: Completed translation [2025-04-13 19:12:05,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05 WrapperNode [2025-04-13 19:12:05,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 19:12:05,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 19:12:05,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 19:12:05,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 19:12:05,877 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,888 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,910 INFO L138 Inliner]: procedures = 274, calls = 92, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 231 [2025-04-13 19:12:05,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 19:12:05,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 19:12:05,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 19:12:05,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 19:12:05,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,936 INFO L175 MemorySlicer]: Split 75 memory accesses to 4 slices as follows [2, 5, 22, 46]. 61 percent of accesses are in the largest equivalence class. The 50 initializations are split as follows [2, 5, 20, 23]. The 11 writes are split as follows [0, 0, 1, 10]. [2025-04-13 19:12:05,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,946 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,947 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,955 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 19:12:05,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 19:12:05,964 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 19:12:05,964 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 19:12:05,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (1/1) ... [2025-04-13 19:12:05,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 19:12:05,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:12:05,989 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 19:12:05,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 19:12:06,007 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 19:12:06,007 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 19:12:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-13 19:12:06,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 19:12:06,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 19:12:06,009 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 19:12:06,129 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 19:12:06,131 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 19:12:06,394 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 19:12:06,394 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 19:12:06,394 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 19:12:06,811 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 19:12:06,842 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 19:12:06,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:12:06 BoogieIcfgContainer [2025-04-13 19:12:06,842 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 19:12:06,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 19:12:06,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 19:12:06,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 19:12:06,864 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 07:12:05" (1/3) ... [2025-04-13 19:12:06,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b08c769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:12:06, skipping insertion in model container [2025-04-13 19:12:06,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 07:12:05" (2/3) ... [2025-04-13 19:12:06,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b08c769 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 07:12:06, skipping insertion in model container [2025-04-13 19:12:06,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 07:12:06" (3/3) ... [2025-04-13 19:12:06,866 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2025-04-13 19:12:06,877 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 19:12:06,878 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok.i that has 3 procedures, 24 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 19:12:06,878 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 19:12:06,959 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 19:12:06,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 19:12:07,005 INFO L116 PetriNetUnfolderBase]: 5/27 cut-off events. [2025-04-13 19:12:07,007 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:12:07,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36 conditions, 27 events. 5/27 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 34 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 23. Up to 2 conditions per place. [2025-04-13 19:12:07,012 INFO L82 GeneralOperation]: Start removeDead. Operand has 31 places, 29 transitions, 72 flow [2025-04-13 19:12:07,015 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 25 transitions, 59 flow [2025-04-13 19:12:07,021 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 19:12:07,029 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;@71391e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 19:12:07,029 INFO L341 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2025-04-13 19:12:07,031 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 19:12:07,031 INFO L116 PetriNetUnfolderBase]: 0/0 cut-off events. [2025-04-13 19:12:07,031 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-13 19:12:07,031 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:07,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-13 19:12:07,032 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 2 more)] === [2025-04-13 19:12:07,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:07,035 INFO L85 PathProgramCache]: Analyzing trace with hash 614, now seen corresponding path program 1 times [2025-04-13 19:12:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:07,040 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029046823] [2025-04-13 19:12:07,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:07,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:07,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-13 19:12:07,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-13 19:12:07,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:07,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:07,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:07,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:07,119 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029046823] [2025-04-13 19:12:07,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029046823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:07,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:07,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-13 19:12:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601840943] [2025-04-13 19:12:07,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:07,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-13 19:12:07,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:07,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-13 19:12:07,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-13 19:12:07,147 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:07,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 25 transitions, 59 flow. Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:07,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:07,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:07,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:07,335 INFO L116 PetriNetUnfolderBase]: 239/374 cut-off events. [2025-04-13 19:12:07,336 INFO L117 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-04-13 19:12:07,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 776 conditions, 374 events. 239/374 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1104 event pairs, 158 based on Foata normal form. 0/278 useless extension candidates. Maximal degree in co-relation 722. Up to 375 conditions per place. [2025-04-13 19:12:07,341 INFO L140 encePairwiseOnDemand]: 28/29 looper letters, 20 selfloop transitions, 0 changer transitions 4/24 dead transitions. [2025-04-13 19:12:07,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 24 transitions, 105 flow [2025-04-13 19:12:07,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-13 19:12:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-13 19:12:07,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 29 transitions. [2025-04-13 19:12:07,353 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 19:12:07,354 INFO L175 Difference]: Start difference. First operand has 27 places, 25 transitions, 59 flow. Second operand 2 states and 29 transitions. [2025-04-13 19:12:07,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 24 transitions, 105 flow [2025-04-13 19:12:07,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 24 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 19:12:07,358 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 44 flow [2025-04-13 19:12:07,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 19:12:07,363 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-04-13 19:12:07,363 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 44 flow [2025-04-13 19:12:07,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:07,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:07,363 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:07,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 19:12:07,363 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:07,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:07,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1334675415, now seen corresponding path program 1 times [2025-04-13 19:12:07,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:07,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302453877] [2025-04-13 19:12:07,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:07,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:07,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-13 19:12:07,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-13 19:12:07,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:07,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302453877] [2025-04-13 19:12:07,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302453877] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:07,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:07,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 19:12:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090404992] [2025-04-13 19:12:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:07,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:12:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:07,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:12:07,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:12:07,699 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:07,699 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:07,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:07,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:07,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:07,873 INFO L116 PetriNetUnfolderBase]: 195/323 cut-off events. [2025-04-13 19:12:07,873 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 19:12:07,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 323 events. 195/323 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 974 event pairs, 85 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 669. Up to 178 conditions per place. [2025-04-13 19:12:07,875 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 25 selfloop transitions, 2 changer transitions 5/32 dead transitions. [2025-04-13 19:12:07,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 32 transitions, 135 flow [2025-04-13 19:12:07,877 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:07,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 40 transitions. [2025-04-13 19:12:07,879 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2025-04-13 19:12:07,879 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 44 flow. Second operand 3 states and 40 transitions. [2025-04-13 19:12:07,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 32 transitions, 135 flow [2025-04-13 19:12:07,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 32 transitions, 135 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-13 19:12:07,881 INFO L231 Difference]: Finished difference. Result has 24 places, 20 transitions, 56 flow [2025-04-13 19:12:07,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=24, PETRI_TRANSITIONS=20} [2025-04-13 19:12:07,881 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -3 predicate places. [2025-04-13 19:12:07,882 INFO L485 AbstractCegarLoop]: Abstraction has has 24 places, 20 transitions, 56 flow [2025-04-13 19:12:07,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:07,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:07,882 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:07,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 19:12:07,882 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:07,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:07,883 INFO L85 PathProgramCache]: Analyzing trace with hash 510991058, now seen corresponding path program 1 times [2025-04-13 19:12:07,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:07,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466589551] [2025-04-13 19:12:07,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:07,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:07,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 19:12:07,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 19:12:07,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:07,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 19:12:08,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:08,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466589551] [2025-04-13 19:12:08,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466589551] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 19:12:08,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 19:12:08,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 19:12:08,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193121962] [2025-04-13 19:12:08,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 19:12:08,105 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 19:12:08,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:08,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 19:12:08,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 19:12:08,106 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:08,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 20 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:08,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:08,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:08,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:08,196 INFO L116 PetriNetUnfolderBase]: 121/225 cut-off events. [2025-04-13 19:12:08,196 INFO L117 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-04-13 19:12:08,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 225 events. 121/225 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 738 event pairs, 33 based on Foata normal form. 14/239 useless extension candidates. Maximal degree in co-relation 502. Up to 151 conditions per place. [2025-04-13 19:12:08,198 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 23 selfloop transitions, 3 changer transitions 1/27 dead transitions. [2025-04-13 19:12:08,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 27 transitions, 127 flow [2025-04-13 19:12:08,200 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 19:12:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 19:12:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2025-04-13 19:12:08,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39080459770114945 [2025-04-13 19:12:08,200 INFO L175 Difference]: Start difference. First operand has 24 places, 20 transitions, 56 flow. Second operand 3 states and 34 transitions. [2025-04-13 19:12:08,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 27 transitions, 127 flow [2025-04-13 19:12:08,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 125 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:12:08,201 INFO L231 Difference]: Finished difference. Result has 25 places, 20 transitions, 60 flow [2025-04-13 19:12:08,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=25, PETRI_TRANSITIONS=20} [2025-04-13 19:12:08,202 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, -2 predicate places. [2025-04-13 19:12:08,202 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 20 transitions, 60 flow [2025-04-13 19:12:08,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:08,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:08,202 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:08,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 19:12:08,202 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:08,203 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:08,203 INFO L85 PathProgramCache]: Analyzing trace with hash 2042660581, now seen corresponding path program 1 times [2025-04-13 19:12:08,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:08,203 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473380970] [2025-04-13 19:12:08,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:08,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:08,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:12:08,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:12:08,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:08,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:08,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473380970] [2025-04-13 19:12:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473380970] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:12:08,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333405525] [2025-04-13 19:12:08,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 19:12:08,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:08,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:12:08,314 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 19:12:08,315 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 19:12:08,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-13 19:12:08,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-13 19:12:08,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 19:12:08,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:08,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 19:12:08,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:12:08,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:08,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:12:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333405525] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:12:08,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:12:08,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 19:12:08,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128442451] [2025-04-13 19:12:08,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:12:08,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 19:12:08,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:08,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 19:12:08,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 19:12:08,496 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:08,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 20 transitions, 60 flow. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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 19:12:08,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:08,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:08,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:08,628 INFO L116 PetriNetUnfolderBase]: 105/197 cut-off events. [2025-04-13 19:12:08,628 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-13 19:12:08,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 197 events. 105/197 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 507 event pairs, 61 based on Foata normal form. 24/221 useless extension candidates. Maximal degree in co-relation 479. Up to 150 conditions per place. [2025-04-13 19:12:08,630 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 34 selfloop transitions, 5 changer transitions 0/39 dead transitions. [2025-04-13 19:12:08,630 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 39 transitions, 190 flow [2025-04-13 19:12:08,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 19:12:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 19:12:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2025-04-13 19:12:08,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3160919540229885 [2025-04-13 19:12:08,633 INFO L175 Difference]: Start difference. First operand has 25 places, 20 transitions, 60 flow. Second operand 6 states and 55 transitions. [2025-04-13 19:12:08,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 39 transitions, 190 flow [2025-04-13 19:12:08,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 39 transitions, 187 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 19:12:08,634 INFO L231 Difference]: Finished difference. Result has 33 places, 23 transitions, 97 flow [2025-04-13 19:12:08,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=97, PETRI_PLACES=33, PETRI_TRANSITIONS=23} [2025-04-13 19:12:08,635 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 6 predicate places. [2025-04-13 19:12:08,635 INFO L485 AbstractCegarLoop]: Abstraction has has 33 places, 23 transitions, 97 flow [2025-04-13 19:12:08,635 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 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 19:12:08,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:08,635 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:08,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-13 19:12:08,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:08,836 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:08,837 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:08,837 INFO L85 PathProgramCache]: Analyzing trace with hash -768553831, now seen corresponding path program 2 times [2025-04-13 19:12:08,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:08,837 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388585208] [2025-04-13 19:12:08,837 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:12:08,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:08,857 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 19:12:08,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:12:08,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:12:08,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:09,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:09,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388585208] [2025-04-13 19:12:09,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388585208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:12:09,078 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967243880] [2025-04-13 19:12:09,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 19:12:09,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:09,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:12:09,080 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 19:12:09,082 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 19:12:09,200 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-04-13 19:12:09,280 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 19:12:09,280 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 19:12:09,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:09,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 19:12:09,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:12:09,297 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:09,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:12:09,342 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:09,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967243880] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:12:09,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:12:09,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 19:12:09,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668338356] [2025-04-13 19:12:09,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:12:09,343 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 19:12:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:09,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 19:12:09,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 19:12:09,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:09,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 97 flow. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:09,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:09,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:09,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:09,531 INFO L116 PetriNetUnfolderBase]: 141/269 cut-off events. [2025-04-13 19:12:09,531 INFO L117 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2025-04-13 19:12:09,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 786 conditions, 269 events. 141/269 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 709 event pairs, 61 based on Foata normal form. 36/305 useless extension candidates. Maximal degree in co-relation 776. Up to 150 conditions per place. [2025-04-13 19:12:09,533 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 58 selfloop transitions, 11 changer transitions 0/69 dead transitions. [2025-04-13 19:12:09,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 69 transitions, 371 flow [2025-04-13 19:12:09,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 19:12:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 19:12:09,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2025-04-13 19:12:09,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28448275862068967 [2025-04-13 19:12:09,534 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 97 flow. Second operand 12 states and 99 transitions. [2025-04-13 19:12:09,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 69 transitions, 371 flow [2025-04-13 19:12:09,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 355 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-04-13 19:12:09,537 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 165 flow [2025-04-13 19:12:09,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=165, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2025-04-13 19:12:09,537 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 22 predicate places. [2025-04-13 19:12:09,537 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 165 flow [2025-04-13 19:12:09,537 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:09,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:09,537 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:09,543 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 19:12:09,742 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:09,742 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:09,742 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:09,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1366382759, now seen corresponding path program 3 times [2025-04-13 19:12:09,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:09,743 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071020636] [2025-04-13 19:12:09,743 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:12:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:09,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-04-13 19:12:10,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:12:10,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:12:10,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:10,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:10,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071020636] [2025-04-13 19:12:10,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071020636] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:12:10,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185000585] [2025-04-13 19:12:10,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 19:12:10,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:10,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:12:10,249 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 19:12:10,251 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 19:12:10,376 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 6 equivalence classes. [2025-04-13 19:12:13,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 19:12:13,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 19:12:13,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:13,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 19:12:13,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:12:13,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:13,271 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:12:13,433 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:13,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185000585] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 19:12:13,434 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 19:12:13,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-04-13 19:12:13,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012123532] [2025-04-13 19:12:13,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 19:12:13,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 19:12:13,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 19:12:13,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 19:12:13,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-04-13 19:12:13,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 29 [2025-04-13 19:12:13,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 29 transitions, 165 flow. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:13,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 19:12:13,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 29 [2025-04-13 19:12:13,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 19:12:13,759 INFO L116 PetriNetUnfolderBase]: 201/389 cut-off events. [2025-04-13 19:12:13,760 INFO L117 PetriNetUnfolderBase]: For 3029/3029 co-relation queries the response was YES. [2025-04-13 19:12:13,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 389 events. 201/389 cut-off events. For 3029/3029 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1038 event pairs, 61 based on Foata normal form. 60/449 useless extension candidates. Maximal degree in co-relation 1317. Up to 150 conditions per place. [2025-04-13 19:12:13,762 INFO L140 encePairwiseOnDemand]: 26/29 looper letters, 98 selfloop transitions, 21 changer transitions 0/119 dead transitions. [2025-04-13 19:12:13,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 119 transitions, 683 flow [2025-04-13 19:12:13,762 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 19:12:13,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 19:12:13,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 173 transitions. [2025-04-13 19:12:13,764 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2711598746081505 [2025-04-13 19:12:13,764 INFO L175 Difference]: Start difference. First operand has 49 places, 29 transitions, 165 flow. Second operand 22 states and 173 transitions. [2025-04-13 19:12:13,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 119 transitions, 683 flow [2025-04-13 19:12:13,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 119 transitions, 615 flow, removed 29 selfloop flow, removed 5 redundant places. [2025-04-13 19:12:13,772 INFO L231 Difference]: Finished difference. Result has 75 places, 39 transitions, 261 flow [2025-04-13 19:12:13,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=261, PETRI_PLACES=75, PETRI_TRANSITIONS=39} [2025-04-13 19:12:13,773 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 48 predicate places. [2025-04-13 19:12:13,773 INFO L485 AbstractCegarLoop]: Abstraction has has 75 places, 39 transitions, 261 flow [2025-04-13 19:12:13,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 19:12:13,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 19:12:13,773 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 19:12:13,783 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 19:12:13,973 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 19:12:13,974 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2025-04-13 19:12:13,974 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 19:12:13,974 INFO L85 PathProgramCache]: Analyzing trace with hash -35488103, now seen corresponding path program 4 times [2025-04-13 19:12:13,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 19:12:13,974 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457736911] [2025-04-13 19:12:13,974 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:12:13,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 19:12:14,033 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:12:15,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:12:15,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:12:15,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:24,948 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:24,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 19:12:24,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457736911] [2025-04-13 19:12:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457736911] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 19:12:24,948 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725915495] [2025-04-13 19:12:24,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 19:12:24,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 19:12:24,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 19:12:24,950 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 19:12:24,951 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 19:12:25,100 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 33 statements into 2 equivalence classes. [2025-04-13 19:12:25,243 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 33 of 33 statements. [2025-04-13 19:12:25,244 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 19:12:25,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 19:12:25,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 756 conjuncts, 154 conjuncts are in the unsatisfiable core [2025-04-13 19:12:25,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 19:12:25,289 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-04-13 19:12:25,350 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,351 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 21 [2025-04-13 19:12:25,386 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,387 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 21 [2025-04-13 19:12:25,413 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,413 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 21 [2025-04-13 19:12:25,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2025-04-13 19:12:25,468 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,473 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,524 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,528 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,528 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,580 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,580 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,583 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,640 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,690 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,742 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,746 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,746 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,802 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,852 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,859 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,859 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,907 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:25,913 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,962 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:25,966 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:25,966 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,015 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:26,019 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,080 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:26,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,140 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:26,197 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,198 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:26,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,255 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,261 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-04-13 19:12:26,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:12:26,279 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-13 19:12:26,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 19:12:26,339 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-04-13 19:12:26,343 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,343 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 35 [2025-04-13 19:12:26,444 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 45 [2025-04-13 19:12:26,498 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 19:12:26,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 19:12:26,639 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:26,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 68 [2025-04-13 19:12:27,001 INFO L325 Elim1Store]: treesize reduction 23, result has 66.7 percent of original size [2025-04-13 19:12:27,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 509 treesize of output 337 [2025-04-13 19:12:27,196 INFO L325 Elim1Store]: treesize reduction 68, result has 1.4 percent of original size [2025-04-13 19:12:27,197 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 523 treesize of output 1 [2025-04-13 19:12:27,323 INFO L325 Elim1Store]: treesize reduction 8, result has 88.4 percent of original size [2025-04-13 19:12:27,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 536 treesize of output 359 [2025-04-13 19:12:30,349 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 19:12:30,350 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1678 treesize of output 1066 [2025-04-13 19:12:31,736 INFO L325 Elim1Store]: treesize reduction 44, result has 48.2 percent of original size [2025-04-13 19:12:31,737 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 887 treesize of output 584 [2025-04-13 19:12:32,354 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 19:12:32,355 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 3251 treesize of output 2057 [2025-04-13 19:12:35,586 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:35,586 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 16 treesize of output 8 [2025-04-13 19:12:35,625 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:35,625 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 16 treesize of output 8 [2025-04-13 19:12:35,758 INFO L325 Elim1Store]: treesize reduction 69, result has 18.8 percent of original size [2025-04-13 19:12:35,758 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 460 treesize of output 279 [2025-04-13 19:12:35,853 INFO L325 Elim1Store]: treesize reduction 59, result has 30.6 percent of original size [2025-04-13 19:12:35,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 344 treesize of output 224 [2025-04-13 19:12:35,979 INFO L325 Elim1Store]: treesize reduction 49, result has 42.4 percent of original size [2025-04-13 19:12:35,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 432 treesize of output 279 [2025-04-13 19:12:36,084 INFO L325 Elim1Store]: treesize reduction 39, result has 54.1 percent of original size [2025-04-13 19:12:36,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 423 treesize of output 280 [2025-04-13 19:12:36,163 INFO L325 Elim1Store]: treesize reduction 39, result has 54.1 percent of original size [2025-04-13 19:12:36,163 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1394 treesize of output 879 [2025-04-13 19:12:37,264 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 19:12:37,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 437 treesize of output 299 [2025-04-13 19:12:37,452 INFO L325 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2025-04-13 19:12:37,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 549 treesize of output 350 [2025-04-13 19:12:49,821 INFO L325 Elim1Store]: treesize reduction 24, result has 79.1 percent of original size [2025-04-13 19:12:49,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 5336 treesize of output 3261 [2025-04-13 19:12:51,649 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 19:12:51,649 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 2240 treesize of output 1322 [2025-04-13 19:12:51,798 INFO L325 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2025-04-13 19:12:51,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 864 treesize of output 545 [2025-04-13 19:12:51,970 INFO L325 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2025-04-13 19:12:51,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 1867 treesize of output 1121 [2025-04-13 19:12:52,201 INFO L325 Elim1Store]: treesize reduction 24, result has 71.8 percent of original size [2025-04-13 19:12:52,202 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 3120 treesize of output 1811 [2025-04-13 19:12:52,405 INFO L325 Elim1Store]: treesize reduction 44, result has 48.2 percent of original size [2025-04-13 19:12:52,405 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 2566 treesize of output 1494 [2025-04-13 19:12:52,510 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:52,511 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 19:12:52,586 INFO L325 Elim1Store]: treesize reduction 34, result has 60.0 percent of original size [2025-04-13 19:12:52,587 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 3129 treesize of output 1810 [2025-04-13 19:12:52,733 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:52,733 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 19:12:52,769 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 19:12:52,769 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 40 treesize of output 20 [2025-04-13 19:12:52,824 INFO L325 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2025-04-13 19:12:52,824 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 5253 treesize of output 2853 [2025-04-13 19:12:53,245 INFO L325 Elim1Store]: treesize reduction 39, result has 84.2 percent of original size [2025-04-13 19:12:53,247 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 11 new quantified variables, introduced 28 case distinctions, treesize of input 16051 treesize of output 9874 [2025-04-13 19:12:53,627 INFO L325 Elim1Store]: treesize reduction 49, result has 80.2 percent of original size [2025-04-13 19:12:53,628 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 11 new quantified variables, introduced 28 case distinctions, treesize of input 15403 treesize of output 9576 [2025-04-13 19:12:53,884 INFO L325 Elim1Store]: treesize reduction 39, result has 66.1 percent of original size [2025-04-13 19:12:53,885 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 4762 treesize of output 2870 [2025-04-13 19:12:54,676 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 30 treesize of output 18 [2025-04-13 19:12:54,740 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-04-13 19:12:54,796 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 30 treesize of output 18 [2025-04-13 19:12:54,891 INFO L325 Elim1Store]: treesize reduction 75, result has 11.8 percent of original size [2025-04-13 19:12:54,891 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 4936 treesize of output 2848 [2025-04-13 19:12:55,076 INFO L325 Elim1Store]: treesize reduction 80, result has 5.9 percent of original size [2025-04-13 19:12:55,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 819 treesize of output 470 [2025-04-13 19:12:56,186 INFO L325 Elim1Store]: treesize reduction 44, result has 91.1 percent of original size [2025-04-13 19:12:56,187 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 14 new quantified variables, introduced 55 case distinctions, treesize of input 201231 treesize of output 154661 [2025-04-13 19:22:42,450 WARN L286 SmtUtils]: Spent 16.79s on a formula simplification. DAG size of input: 3964 DAG size of output: 4651 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:23:02,177 WARN L286 SmtUtils]: Spent 14.13s on a formula simplification. DAG size of input: 3962 DAG size of output: 4114 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-13 19:23:15,445 WARN L286 SmtUtils]: Spent 10.44s on a formula simplification. DAG size of input: 3890 DAG size of output: 3217 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-13 19:26:13,718 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2025-04-13 19:26:13,727 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 19:26:13,728 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:26:13,742 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 19:26:13,919 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 19:26:13,919 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-3-3-4-8-9-10-11-11-3-11-3-9-3-8-3-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-27-9-3-9-4-9-9-10-11-11-3-11-3-8-3-8-3-3-3-1 context. [2025-04-13 19:26:13,921 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2025-04-13 19:26:13,921 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2025-04-13 19:26:13,921 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2025-04-13 19:26:13,921 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2025-04-13 19:26:13,922 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2025-04-13 19:26:13,927 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 19:26:13,927 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 19:26:13,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 07:26:13 BasicIcfg [2025-04-13 19:26:13,930 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 19:26:13,932 INFO L158 Benchmark]: Toolchain (without parser) took 848489.77ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 96.9MB in the beginning and 591.5MB in the end (delta: -494.6MB). Peak memory consumption was 449.7MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,932 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 19:26:13,932 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.04ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 63.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,932 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.36ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,933 INFO L158 Benchmark]: Boogie Preprocessor took 52.08ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 57.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,933 INFO L158 Benchmark]: RCFGBuilder took 878.50ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 29.2MB in the end (delta: 27.9MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,933 INFO L158 Benchmark]: TraceAbstraction took 847085.98ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 28.6MB in the beginning and 591.5MB in the end (delta: -562.9MB). Peak memory consumption was 381.7MB. Max. memory is 8.0GB. [2025-04-13 19:26:13,934 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.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 431.04ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 63.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.36ms. Allocated memory is still 142.6MB. Free memory was 63.1MB in the beginning and 60.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.08ms. Allocated memory is still 142.6MB. Free memory was 60.0MB in the beginning and 57.1MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 878.50ms. Allocated memory is still 142.6MB. Free memory was 57.1MB in the beginning and 29.2MB in the end (delta: 27.9MB). Peak memory consumption was 40.8MB. Max. memory is 8.0GB. * TraceAbstraction took 847085.98ms. Allocated memory was 142.6MB in the beginning and 713.0MB in the end (delta: 570.4MB). Free memory was 28.6MB in the beginning and 591.5MB in the end (delta: -562.9MB). Peak memory consumption was 381.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1033]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-3-3-4-8-9-10-11-11-3-11-3-9-3-8-3-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-27-9-3-9-4-9-9-10-11-11-3-11-3-8-3-8-3-3-3-1 context. - TimeoutResultAtElement [Line: 1049]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-3-3-4-8-9-10-11-11-3-11-3-9-3-8-3-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-27-9-3-9-4-9-9-10-11-11-3-11-3-8-3-8-3-3-3-1 context. - TimeoutResultAtElement [Line: 1052]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-3-3-4-8-9-10-11-11-3-11-3-9-3-8-3-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-27-9-3-9-4-9-9-10-11-11-3-11-3-8-3-8-3-3-3-1 context. - TimeoutResultAtElement [Line: 1053]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 34 with TraceHistMax 20,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-2-3-3-4-8-9-10-11-11-3-11-3-9-3-8-3-3-3-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-27-9-3-9-4-9-9-10-11-11-3-11-3-8-3-8-3-3-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 42 locations, 51 edges, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 846.9s, OverallIterations: 7, TraceHistogramMax: 20, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 289 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 289 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 525 IncrementalHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 0 mSDtfsCounter, 525 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 89 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=6, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1188 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 12 InterpolantComputations, 3 PerfectInterpolantSequences, 1/199 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown