/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/pthread/stack_longest-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:47:53,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:47:53,966 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 23:47:53,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:47:53,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:47:53,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:47:53,989 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:47:53,989 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:47:53,989 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:47:53,989 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:47:53,990 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:47:53,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:47:53,990 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:47:53,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:47:53,990 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:47:53,991 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:47:53,991 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:47:53,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:53,992 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:53,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:47:53,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:47:53,993 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:47:53,993 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:47:53,993 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:47:53,993 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 23:47:54,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:47:54,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:47:54,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:47:54,211 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:47:54,211 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:47:54,212 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 23:47:55,471 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a294a16b3/b7a7e9fd3efe4773b46042c3396ee9f7/FLAGb27f6a7f7 [2025-04-13 23:47:55,678 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:47:55,679 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longest-2.i [2025-04-13 23:47:55,696 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a294a16b3/b7a7e9fd3efe4773b46042c3396ee9f7/FLAGb27f6a7f7 [2025-04-13 23:47:56,520 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a294a16b3/b7a7e9fd3efe4773b46042c3396ee9f7 [2025-04-13 23:47:56,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:47:56,523 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:47:56,524 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:56,524 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:47:56,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:47:56,527 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:56" (1/1) ... [2025-04-13 23:47:56,528 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40c236b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:56, skipping insertion in model container [2025-04-13 23:47:56,528 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:56" (1/1) ... [2025-04-13 23:47:56,554 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:47:56,903 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/stack_longest-2.i[41530,41543] [2025-04-13 23:47:56,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:56,954 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:47:56,997 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/stack_longest-2.i[41530,41543] [2025-04-13 23:47:57,007 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:57,092 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:47:57,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57 WrapperNode [2025-04-13 23:47:57,094 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:57,095 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:57,095 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:47:57,096 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:47:57,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,120 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,166 INFO L138 Inliner]: procedures = 277, calls = 830, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 939 [2025-04-13 23:47:57,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:57,167 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:47:57,167 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:47:57,167 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:47:57,177 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,177 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,190 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,220 INFO L175 MemorySlicer]: Split 809 memory accesses to 3 slices as follows [2, 802, 5]. 99 percent of accesses are in the largest equivalence class. The 807 initializations are split as follows [2, 800, 5]. The 1 writes are split as follows [0, 1, 0]. [2025-04-13 23:47:57,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,242 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,253 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:47:57,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:47:57,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:47:57,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:47:57,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (1/1) ... [2025-04-13 23:47:57,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:57,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:57,287 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 23:47:57,288 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 23:47:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:47:57,305 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:47:57,306 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:47:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:47:57,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:47:57,307 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:47:57,437 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:47:57,439 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:47:58,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-04-13 23:47:58,276 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-04-13 23:47:58,277 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-04-13 23:47:58,277 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:47:58,278 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:47:58,278 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:48:09,274 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:09,275 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:48:09,277 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:48:09,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:09 BoogieIcfgContainer [2025-04-13 23:48:09,279 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:48:09,280 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:48:09,280 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:48:09,283 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:48:09,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:47:56" (1/3) ... [2025-04-13 23:48:09,284 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350093f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:09, skipping insertion in model container [2025-04-13 23:48:09,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:57" (2/3) ... [2025-04-13 23:48:09,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2350093f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:48:09, skipping insertion in model container [2025-04-13 23:48:09,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:48:09" (3/3) ... [2025-04-13 23:48:09,286 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longest-2.i [2025-04-13 23:48:09,297 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:48:09,299 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longest-2.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 23:48:09,299 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:48:09,371 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:48:09,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:48:09,447 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 23:48:09,449 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:48:09,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 23:48:09,451 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:48:09,453 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 23:48:09,459 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:48:09,468 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;@358a3654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:48:09,469 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:48:09,493 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:48:09,493 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 23:48:09,494 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:48:09,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:09,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:48:09,495 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:09,499 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1853549348, now seen corresponding path program 1 times [2025-04-13 23:48:09,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:09,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764678495] [2025-04-13 23:48:09,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:09,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:09,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:48:09,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:48:09,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:09,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:10,132 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 23:48:10,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:10,132 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764678495] [2025-04-13 23:48:10,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764678495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:10,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:10,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:48:10,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581268810] [2025-04-13 23:48:10,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:10,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:48:10,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:10,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:48:10,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:48:10,160 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:10,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23:48:10,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:10,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:10,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:10,314 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 23:48:10,315 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 23:48:10,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 352 events. 206/352 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 690. Up to 263 conditions per place. [2025-04-13 23:48:10,319 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 23:48:10,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 136 flow [2025-04-13 23:48:10,319 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:48:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:48:10,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 23:48:10,327 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 23:48:10,328 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 3 states and 42 transitions. [2025-04-13 23:48:10,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 136 flow [2025-04-13 23:48:10,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:48:10,336 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 58 flow [2025-04-13 23:48:10,338 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, 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=58, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 23:48:10,341 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 23:48:10,341 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 58 flow [2025-04-13 23:48:10,341 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 23:48:10,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:10,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:10,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:48:10,342 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:10,342 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:10,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1767561081, now seen corresponding path program 1 times [2025-04-13 23:48:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:10,343 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56038120] [2025-04-13 23:48:10,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:10,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:48:10,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:48:10,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:10,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:10,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:10,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:10,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56038120] [2025-04-13 23:48:10,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56038120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:10,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718365702] [2025-04-13 23:48:10,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:10,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:10,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:10,728 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 23:48:10,729 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 23:48:10,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:48:10,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:48:10,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:10,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:10,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:48:11,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:11,053 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 8 treesize of output 1 [2025-04-13 23:48:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:11,081 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:11,111 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:11,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718365702] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:11,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:11,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 23:48:11,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649063806] [2025-04-13 23:48:11,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:11,113 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:48:11,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:11,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:48:11,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:48:11,114 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:11,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 58 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 23:48:11,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:11,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:11,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:11,431 INFO L116 PetriNetUnfolderBase]: 771/1322 cut-off events. [2025-04-13 23:48:11,431 INFO L117 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-04-13 23:48:11,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1322 events. 771/1322 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5747 event pairs, 54 based on Foata normal form. 11/1141 useless extension candidates. Maximal degree in co-relation 2577. Up to 270 conditions per place. [2025-04-13 23:48:11,440 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 94 selfloop transitions, 17 changer transitions 2/113 dead transitions. [2025-04-13 23:48:11,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 113 transitions, 506 flow [2025-04-13 23:48:11,442 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:48:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:48:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-13 23:48:11,445 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2025-04-13 23:48:11,445 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 58 flow. Second operand 8 states and 134 transitions. [2025-04-13 23:48:11,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 113 transitions, 506 flow [2025-04-13 23:48:11,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 113 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:48:11,450 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 194 flow [2025-04-13 23:48:11,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2025-04-13 23:48:11,450 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 23:48:11,450 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 194 flow [2025-04-13 23:48:11,450 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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 23:48:11,450 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:11,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:11,460 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 23:48:11,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:11,652 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:11,653 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:11,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1005110706, now seen corresponding path program 1 times [2025-04-13 23:48:11,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:11,653 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940829858] [2025-04-13 23:48:11,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:11,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:11,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:48:11,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:48:11,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:11,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:11,937 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 23:48:11,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:11,937 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940829858] [2025-04-13 23:48:11,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940829858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:11,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:11,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:48:11,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303475037] [2025-04-13 23:48:11,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:11,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:48:11,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:11,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:48:11,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:48:11,938 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:11,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:48:11,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:11,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:11,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:12,218 INFO L116 PetriNetUnfolderBase]: 531/934 cut-off events. [2025-04-13 23:48:12,218 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-13 23:48:12,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 934 events. 531/934 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3971 event pairs, 194 based on Foata normal form. 52/830 useless extension candidates. Maximal degree in co-relation 2011. Up to 505 conditions per place. [2025-04-13 23:48:12,224 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-04-13 23:48:12,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 303 flow [2025-04-13 23:48:12,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:48:12,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:48:12,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 23:48:12,225 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 23:48:12,225 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 194 flow. Second operand 3 states and 38 transitions. [2025-04-13 23:48:12,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 303 flow [2025-04-13 23:48:12,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 283 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 23:48:12,231 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 174 flow [2025-04-13 23:48:12,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 23:48:12,232 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2025-04-13 23:48:12,232 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 174 flow [2025-04-13 23:48:12,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23:48:12,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:12,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:12,232 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:48:12,233 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:12,233 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:12,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1089823532, now seen corresponding path program 1 times [2025-04-13 23:48:12,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:12,233 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243667420] [2025-04-13 23:48:12,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:12,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:12,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:48:12,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:48:12,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:12,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:13,416 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 23:48:13,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:13,417 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243667420] [2025-04-13 23:48:13,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243667420] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:13,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:48:13,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:48:13,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682560679] [2025-04-13 23:48:13,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:13,417 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:48:13,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:13,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:48:13,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:48:13,418 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:13,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:48:13,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:13,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:13,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:13,625 INFO L116 PetriNetUnfolderBase]: 636/1120 cut-off events. [2025-04-13 23:48:13,625 INFO L117 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-04-13 23:48:13,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1120 events. 636/1120 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4807 event pairs, 181 based on Foata normal form. 7/912 useless extension candidates. Maximal degree in co-relation 2509. Up to 816 conditions per place. [2025-04-13 23:48:13,632 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 57 selfloop transitions, 4 changer transitions 2/63 dead transitions. [2025-04-13 23:48:13,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 385 flow [2025-04-13 23:48:13,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:48:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:48:13,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-13 23:48:13,633 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2025-04-13 23:48:13,633 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 174 flow. Second operand 4 states and 55 transitions. [2025-04-13 23:48:13,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 385 flow [2025-04-13 23:48:13,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:48:13,639 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 199 flow [2025-04-13 23:48:13,639 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-13 23:48:13,639 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 23:48:13,640 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 199 flow [2025-04-13 23:48:13,640 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 23:48:13,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:13,640 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:13,641 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:48:13,641 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:13,642 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:13,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2058450251, now seen corresponding path program 1 times [2025-04-13 23:48:13,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:13,642 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468074461] [2025-04-13 23:48:13,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:13,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:13,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:48:13,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:48:13,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:13,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:14,687 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:14,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:14,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468074461] [2025-04-13 23:48:14,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468074461] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:14,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656834872] [2025-04-13 23:48:14,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:14,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:14,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:14,690 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 23:48:14,692 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 23:48:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:48:14,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:48:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:14,965 INFO L256 TraceCheckSpWp]: Trace formula consists of 1754 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:14,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:14,995 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 25 treesize of output 1 [2025-04-13 23:48:15,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:15,035 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:48:15,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656834872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:15,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:48:15,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 6 [2025-04-13 23:48:15,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987625765] [2025-04-13 23:48:15,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:15,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:48:15,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:15,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:48:15,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-04-13 23:48:15,036 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:15,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23:48:15,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:15,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:15,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:15,207 INFO L116 PetriNetUnfolderBase]: 665/1175 cut-off events. [2025-04-13 23:48:15,208 INFO L117 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2025-04-13 23:48:15,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 1175 events. 665/1175 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5135 event pairs, 156 based on Foata normal form. 7/960 useless extension candidates. Maximal degree in co-relation 2528. Up to 669 conditions per place. [2025-04-13 23:48:15,216 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 41 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2025-04-13 23:48:15,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 321 flow [2025-04-13 23:48:15,216 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:48:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:48:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:48:15,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-04-13 23:48:15,217 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 199 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:48:15,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 321 flow [2025-04-13 23:48:15,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 310 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:15,222 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 220 flow [2025-04-13 23:48:15,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-04-13 23:48:15,223 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 23:48:15,223 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 220 flow [2025-04-13 23:48:15,223 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 23:48:15,223 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:15,223 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:15,233 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 23:48:15,423 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 23:48:15,424 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:15,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash 734002832, now seen corresponding path program 1 times [2025-04-13 23:48:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:15,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012864521] [2025-04-13 23:48:15,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:15,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:15,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:15,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:15,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:15,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:15,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:15,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012864521] [2025-04-13 23:48:15,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012864521] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:15,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916993859] [2025-04-13 23:48:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:15,779 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 23:48:15,781 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 23:48:15,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:16,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:16,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:16,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:16,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1775 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:16,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:16,045 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 8 treesize of output 1 [2025-04-13 23:48:16,066 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 8 treesize of output 1 [2025-04-13 23:48:16,194 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:16,194 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:16,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916993859] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:16,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:48:16,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 23:48:16,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969806783] [2025-04-13 23:48:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:16,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:48:16,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:16,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:48:16,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:48:16,305 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:16,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 23:48:16,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:16,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:16,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:16,532 INFO L116 PetriNetUnfolderBase]: 869/1538 cut-off events. [2025-04-13 23:48:16,533 INFO L117 PetriNetUnfolderBase]: For 1013/1013 co-relation queries the response was YES. [2025-04-13 23:48:16,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1538 events. 869/1538 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7009 event pairs, 78 based on Foata normal form. 12/1274 useless extension candidates. Maximal degree in co-relation 3463. Up to 708 conditions per place. [2025-04-13 23:48:16,540 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 50 selfloop transitions, 23 changer transitions 0/73 dead transitions. [2025-04-13 23:48:16,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 498 flow [2025-04-13 23:48:16,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:48:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:48:16,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-13 23:48:16,541 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-04-13 23:48:16,542 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 220 flow. Second operand 5 states and 64 transitions. [2025-04-13 23:48:16,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 498 flow [2025-04-13 23:48:16,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 433 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-13 23:48:16,545 INFO L231 Difference]: Finished difference. Result has 40 places, 48 transitions, 312 flow [2025-04-13 23:48:16,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=40, PETRI_TRANSITIONS=48} [2025-04-13 23:48:16,546 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-04-13 23:48:16,546 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 48 transitions, 312 flow [2025-04-13 23:48:16,546 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 23:48:16,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:16,546 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:16,555 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 23:48:16,747 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 23:48:16,747 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:16,747 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:16,747 INFO L85 PathProgramCache]: Analyzing trace with hash 850397486, now seen corresponding path program 1 times [2025-04-13 23:48:16,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:16,748 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688979381] [2025-04-13 23:48:16,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:16,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:16,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:16,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:16,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:16,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:17,993 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:17,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:17,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688979381] [2025-04-13 23:48:17,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688979381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:17,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973634865] [2025-04-13 23:48:17,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:17,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:17,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:17,995 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 23:48:17,997 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 23:48:18,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:18,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:18,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:18,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:18,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1772 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:48:18,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:18,299 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 1 [2025-04-13 23:48:18,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:48:18,422 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:18,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973634865] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:18,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-13 23:48:18,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597947734] [2025-04-13 23:48:18,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:18,685 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:18,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:18,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:18,686 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:18,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 48 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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 23:48:18,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:18,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:18,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:19,158 INFO L116 PetriNetUnfolderBase]: 1342/2382 cut-off events. [2025-04-13 23:48:19,159 INFO L117 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2025-04-13 23:48:19,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 2382 events. 1342/2382 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11423 event pairs, 316 based on Foata normal form. 18/1951 useless extension candidates. Maximal degree in co-relation 5656. Up to 713 conditions per place. [2025-04-13 23:48:19,169 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 88 selfloop transitions, 36 changer transitions 8/132 dead transitions. [2025-04-13 23:48:19,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 132 transitions, 887 flow [2025-04-13 23:48:19,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:19,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:19,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2025-04-13 23:48:19,170 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5299145299145299 [2025-04-13 23:48:19,170 INFO L175 Difference]: Start difference. First operand has 40 places, 48 transitions, 312 flow. Second operand 9 states and 124 transitions. [2025-04-13 23:48:19,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 132 transitions, 887 flow [2025-04-13 23:48:19,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 132 transitions, 851 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:48:19,174 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 549 flow [2025-04-13 23:48:19,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2025-04-13 23:48:19,175 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2025-04-13 23:48:19,175 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 549 flow [2025-04-13 23:48:19,175 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 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 23:48:19,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:19,175 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 23:48:19,185 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 23:48:19,375 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 23:48:19,376 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:19,376 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1403885648, now seen corresponding path program 2 times [2025-04-13 23:48:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:19,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228429339] [2025-04-13 23:48:19,376 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:19,397 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:48:19,418 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:48:19,418 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:19,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:19,705 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:19,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:19,705 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228429339] [2025-04-13 23:48:19,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228429339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:19,706 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693791895] [2025-04-13 23:48:19,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:19,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:19,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:19,707 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:48:19,788 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:48:19,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:48:19,948 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:19,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:19,953 INFO L256 TraceCheckSpWp]: Trace formula consists of 1787 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:48:19,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:19,973 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 8 treesize of output 1 [2025-04-13 23:48:20,003 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 8 treesize of output 1 [2025-04-13 23:48:20,033 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 8 treesize of output 1 [2025-04-13 23:48:20,063 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 8 treesize of output 1 [2025-04-13 23:48:20,084 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:20,085 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:20,138 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:20,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693791895] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:20,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:20,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 15 [2025-04-13 23:48:20,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100213662] [2025-04-13 23:48:20,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:20,139 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-13 23:48:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:20,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-13 23:48:20,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=166, Unknown=0, NotChecked=0, Total=272 [2025-04-13 23:48:20,139 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:20,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 549 flow. Second operand has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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 23:48:20,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:20,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:20,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:21,253 INFO L116 PetriNetUnfolderBase]: 4593/8022 cut-off events. [2025-04-13 23:48:21,253 INFO L117 PetriNetUnfolderBase]: For 11456/11456 co-relation queries the response was YES. [2025-04-13 23:48:21,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22201 conditions, 8022 events. 4593/8022 cut-off events. For 11456/11456 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 43426 event pairs, 821 based on Foata normal form. 140/6648 useless extension candidates. Maximal degree in co-relation 21392. Up to 1480 conditions per place. [2025-04-13 23:48:21,306 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 317 selfloop transitions, 168 changer transitions 10/495 dead transitions. [2025-04-13 23:48:21,306 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 495 transitions, 3709 flow [2025-04-13 23:48:21,307 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-13 23:48:21,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-04-13 23:48:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 461 transitions. [2025-04-13 23:48:21,309 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.591025641025641 [2025-04-13 23:48:21,309 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 549 flow. Second operand 30 states and 461 transitions. [2025-04-13 23:48:21,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 495 transitions, 3709 flow [2025-04-13 23:48:21,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 495 transitions, 3673 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-04-13 23:48:21,341 INFO L231 Difference]: Finished difference. Result has 81 places, 202 transitions, 2319 flow [2025-04-13 23:48:21,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2319, PETRI_PLACES=81, PETRI_TRANSITIONS=202} [2025-04-13 23:48:21,343 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 56 predicate places. [2025-04-13 23:48:21,343 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 202 transitions, 2319 flow [2025-04-13 23:48:21,343 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.705882352941177) internal successors, (97), 17 states have internal predecessors, (97), 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 23:48:21,343 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:21,343 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:21,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:21,543 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:21,544 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:21,544 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:21,544 INFO L85 PathProgramCache]: Analyzing trace with hash 607613902, now seen corresponding path program 2 times [2025-04-13 23:48:21,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:21,544 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637972195] [2025-04-13 23:48:21,544 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:21,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:21,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:48:21,755 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:21,755 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:21,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:23,018 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:23,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:23,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637972195] [2025-04-13 23:48:23,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637972195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:23,018 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418477956] [2025-04-13 23:48:23,018 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:23,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:23,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:23,020 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:23,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:48:23,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:48:23,262 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:23,262 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:23,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:23,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 1815 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:48:23,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:23,293 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 1 [2025-04-13 23:48:23,326 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:48:23,363 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:48:23,599 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:23,599 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:24,039 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:24,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418477956] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:24,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:24,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 17 [2025-04-13 23:48:24,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001815381] [2025-04-13 23:48:24,039 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:24,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-13 23:48:24,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:24,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-13 23:48:24,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:48:24,042 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:24,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 202 transitions, 2319 flow. Second operand has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 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 23:48:24,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:24,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:24,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:25,601 INFO L116 PetriNetUnfolderBase]: 7044/12377 cut-off events. [2025-04-13 23:48:25,601 INFO L117 PetriNetUnfolderBase]: For 23778/23778 co-relation queries the response was YES. [2025-04-13 23:48:25,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35352 conditions, 12377 events. 7044/12377 cut-off events. For 23778/23778 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 74095 event pairs, 1350 based on Foata normal form. 119/10089 useless extension candidates. Maximal degree in co-relation 34531. Up to 2949 conditions per place. [2025-04-13 23:48:25,666 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 169 selfloop transitions, 216 changer transitions 14/399 dead transitions. [2025-04-13 23:48:25,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 399 transitions, 4447 flow [2025-04-13 23:48:25,667 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:48:25,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 23:48:25,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 184 transitions. [2025-04-13 23:48:25,667 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5054945054945055 [2025-04-13 23:48:25,668 INFO L175 Difference]: Start difference. First operand has 81 places, 202 transitions, 2319 flow. Second operand 14 states and 184 transitions. [2025-04-13 23:48:25,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 399 transitions, 4447 flow [2025-04-13 23:48:25,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 399 transitions, 3974 flow, removed 199 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:25,720 INFO L231 Difference]: Finished difference. Result has 95 places, 284 transitions, 3610 flow [2025-04-13 23:48:25,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=133, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3610, PETRI_PLACES=95, PETRI_TRANSITIONS=284} [2025-04-13 23:48:25,720 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 70 predicate places. [2025-04-13 23:48:25,720 INFO L485 AbstractCegarLoop]: Abstraction has has 95 places, 284 transitions, 3610 flow [2025-04-13 23:48:25,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.5) internal successors, (117), 18 states have internal predecessors, (117), 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 23:48:25,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:25,721 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:25,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-13 23:48:25,921 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:25,921 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:25,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1074188156, now seen corresponding path program 1 times [2025-04-13 23:48:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:25,922 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133525285] [2025-04-13 23:48:25,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:25,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 23:48:25,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:25,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:25,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:26,481 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:26,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:26,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133525285] [2025-04-13 23:48:26,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133525285] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:26,482 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847579194] [2025-04-13 23:48:26,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:26,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:26,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:26,484 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:26,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:48:26,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-13 23:48:26,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:26,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:26,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:26,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 1868 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:48:26,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:26,725 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 8 treesize of output 1 [2025-04-13 23:48:26,746 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 8 treesize of output 1 [2025-04-13 23:48:26,766 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 8 treesize of output 1 [2025-04-13 23:48:26,786 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 8 treesize of output 1 [2025-04-13 23:48:26,800 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 8 treesize of output 1 [2025-04-13 23:48:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:27,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 25 proven. 8 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-13 23:48:27,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847579194] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:27,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:27,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 5] total 19 [2025-04-13 23:48:27,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459362490] [2025-04-13 23:48:27,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:27,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-13 23:48:27,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:27,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-13 23:48:27,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:48:27,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:27,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 284 transitions, 3610 flow. Second operand has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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 23:48:27,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:27,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:30,211 INFO L116 PetriNetUnfolderBase]: 12440/21853 cut-off events. [2025-04-13 23:48:30,211 INFO L117 PetriNetUnfolderBase]: For 47895/47895 co-relation queries the response was YES. [2025-04-13 23:48:30,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63506 conditions, 21853 events. 12440/21853 cut-off events. For 47895/47895 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 138714 event pairs, 2661 based on Foata normal form. 276/17662 useless extension candidates. Maximal degree in co-relation 62706. Up to 4135 conditions per place. [2025-04-13 23:48:30,301 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 215 selfloop transitions, 449 changer transitions 2/666 dead transitions. [2025-04-13 23:48:30,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 666 transitions, 8034 flow [2025-04-13 23:48:30,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:48:30,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-04-13 23:48:30,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 269 transitions. [2025-04-13 23:48:30,303 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5747863247863247 [2025-04-13 23:48:30,303 INFO L175 Difference]: Start difference. First operand has 95 places, 284 transitions, 3610 flow. Second operand 18 states and 269 transitions. [2025-04-13 23:48:30,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 666 transitions, 8034 flow [2025-04-13 23:48:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 666 transitions, 7970 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-13 23:48:30,363 INFO L231 Difference]: Finished difference. Result has 118 places, 502 transitions, 7538 flow [2025-04-13 23:48:30,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=3546, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=7538, PETRI_PLACES=118, PETRI_TRANSITIONS=502} [2025-04-13 23:48:30,364 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 93 predicate places. [2025-04-13 23:48:30,364 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 502 transitions, 7538 flow [2025-04-13 23:48:30,364 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.45) internal successors, (129), 20 states have internal predecessors, (129), 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 23:48:30,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:30,364 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:30,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:30,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:30,565 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:30,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:30,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1449721490, now seen corresponding path program 3 times [2025-04-13 23:48:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:30,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309991620] [2025-04-13 23:48:30,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:30,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:30,589 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 23:48:30,985 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:30,985 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:30,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:33,407 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:33,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309991620] [2025-04-13 23:48:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309991620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:33,408 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625985721] [2025-04-13 23:48:33,408 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:33,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:33,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:33,410 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:33,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:48:33,507 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 23:48:33,871 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:33,871 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:33,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:33,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1858 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:48:33,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:33,911 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 1 [2025-04-13 23:48:33,939 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 30 treesize of output 14 [2025-04-13 23:48:33,985 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 30 treesize of output 14 [2025-04-13 23:48:34,031 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 30 treesize of output 14 [2025-04-13 23:48:34,381 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:34,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:34,949 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:34,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625985721] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:34,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:34,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2025-04-13 23:48:34,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204397277] [2025-04-13 23:48:34,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:34,950 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-13 23:48:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:34,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-13 23:48:34,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=344, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:48:34,953 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:34,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 502 transitions, 7538 flow. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 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 23:48:34,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:34,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:34,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:39,540 INFO L116 PetriNetUnfolderBase]: 19068/33641 cut-off events. [2025-04-13 23:48:39,540 INFO L117 PetriNetUnfolderBase]: For 107635/107635 co-relation queries the response was YES. [2025-04-13 23:48:39,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103847 conditions, 33641 events. 19068/33641 cut-off events. For 107635/107635 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 233025 event pairs, 3923 based on Foata normal form. 56/26897 useless extension candidates. Maximal degree in co-relation 102995. Up to 8992 conditions per place. [2025-04-13 23:48:39,687 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 240 selfloop transitions, 630 changer transitions 20/890 dead transitions. [2025-04-13 23:48:39,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 890 transitions, 13618 flow [2025-04-13 23:48:39,688 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:48:39,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 23:48:39,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 247 transitions. [2025-04-13 23:48:39,689 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-13 23:48:39,689 INFO L175 Difference]: Start difference. First operand has 118 places, 502 transitions, 7538 flow. Second operand 19 states and 247 transitions. [2025-04-13 23:48:39,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 890 transitions, 13618 flow [2025-04-13 23:48:39,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 890 transitions, 12642 flow, removed 121 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:39,846 INFO L231 Difference]: Finished difference. Result has 136 places, 734 transitions, 12699 flow [2025-04-13 23:48:39,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=6717, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=488, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=408, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12699, PETRI_PLACES=136, PETRI_TRANSITIONS=734} [2025-04-13 23:48:39,847 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 111 predicate places. [2025-04-13 23:48:39,847 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 734 transitions, 12699 flow [2025-04-13 23:48:39,848 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 22 states have internal predecessors, (138), 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 23:48:39,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:39,848 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:39,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:48:40,048 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-13 23:48:40,049 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:40,049 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:40,049 INFO L85 PathProgramCache]: Analyzing trace with hash -1060690908, now seen corresponding path program 2 times [2025-04-13 23:48:40,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:40,049 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511351410] [2025-04-13 23:48:40,049 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:40,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:40,072 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:40,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:40,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:40,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:40,927 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 71 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:40,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:40,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511351410] [2025-04-13 23:48:40,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511351410] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:40,928 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131870507] [2025-04-13 23:48:40,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:40,930 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:40,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:48:41,030 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:41,169 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:41,169 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:41,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:41,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1918 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-04-13 23:48:41,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:41,190 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 8 treesize of output 1 [2025-04-13 23:48:41,206 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 8 treesize of output 1 [2025-04-13 23:48:41,222 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 8 treesize of output 1 [2025-04-13 23:48:41,242 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 8 treesize of output 1 [2025-04-13 23:48:41,259 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 8 treesize of output 1 [2025-04-13 23:48:41,279 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 8 treesize of output 1 [2025-04-13 23:48:41,444 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-04-13 23:48:41,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:41,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 21 proven. 6 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-04-13 23:48:41,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1131870507] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:41,640 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:41,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 5] total 22 [2025-04-13 23:48:41,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281978654] [2025-04-13 23:48:41,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:41,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-04-13 23:48:41,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:41,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-04-13 23:48:41,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:48:41,643 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:41,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 734 transitions, 12699 flow. Second operand has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 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 23:48:41,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:41,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:41,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:50,125 INFO L116 PetriNetUnfolderBase]: 28938/51066 cut-off events. [2025-04-13 23:48:50,125 INFO L117 PetriNetUnfolderBase]: For 217124/217124 co-relation queries the response was YES. [2025-04-13 23:48:50,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163815 conditions, 51066 events. 28938/51066 cut-off events. For 217124/217124 co-relation queries the response was YES. Maximal size of possible extension queue 646. Compared 374817 event pairs, 6167 based on Foata normal form. 504/41145 useless extension candidates. Maximal degree in co-relation 162946. Up to 9775 conditions per place. [2025-04-13 23:48:50,424 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 278 selfloop transitions, 1046 changer transitions 2/1326 dead transitions. [2025-04-13 23:48:50,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 1326 transitions, 22433 flow [2025-04-13 23:48:50,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:48:50,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-04-13 23:48:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 326 transitions. [2025-04-13 23:48:50,425 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5699300699300699 [2025-04-13 23:48:50,425 INFO L175 Difference]: Start difference. First operand has 136 places, 734 transitions, 12699 flow. Second operand 22 states and 326 transitions. [2025-04-13 23:48:50,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 1326 transitions, 22433 flow [2025-04-13 23:48:51,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 1326 transitions, 22259 flow, removed 87 selfloop flow, removed 0 redundant places. [2025-04-13 23:48:51,072 INFO L231 Difference]: Finished difference. Result has 159 places, 1123 transitions, 21518 flow [2025-04-13 23:48:51,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12516, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=685, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=21518, PETRI_PLACES=159, PETRI_TRANSITIONS=1123} [2025-04-13 23:48:51,072 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 134 predicate places. [2025-04-13 23:48:51,073 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 1123 transitions, 21518 flow [2025-04-13 23:48:51,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.434782608695652) internal successors, (148), 23 states have internal predecessors, (148), 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 23:48:51,073 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:51,073 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:51,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:48:51,273 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:51,273 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:51,274 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:51,274 INFO L85 PathProgramCache]: Analyzing trace with hash 333591054, now seen corresponding path program 4 times [2025-04-13 23:48:51,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:51,274 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126885729] [2025-04-13 23:48:51,274 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:51,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:51,297 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:51,380 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:51,380 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:51,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:53,097 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:48:53,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:53,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126885729] [2025-04-13 23:48:53,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126885729] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:53,097 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2034772807] [2025-04-13 23:48:53,097 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:53,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:53,100 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:48:53,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:48:53,221 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:53,383 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:53,383 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:53,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:53,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1901 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:48:53,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:53,421 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 23 treesize of output 1 [2025-04-13 23:48:53,464 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:53,533 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:53,592 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:53,671 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 19 [2025-04-13 23:48:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:54,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:55,434 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:55,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2034772807] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:55,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:55,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 23:48:55,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270391601] [2025-04-13 23:48:55,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:55,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:48:55,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:55,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:48:55,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:48:55,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:55,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 1123 transitions, 21518 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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 23:48:55,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:55,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:21,375 INFO L116 PetriNetUnfolderBase]: 66741/118080 cut-off events. [2025-04-13 23:49:21,375 INFO L117 PetriNetUnfolderBase]: For 597527/597527 co-relation queries the response was YES. [2025-04-13 23:49:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392380 conditions, 118080 events. 66741/118080 cut-off events. For 597527/597527 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 977425 event pairs, 13826 based on Foata normal form. 54/94110 useless extension candidates. Maximal degree in co-relation 391479. Up to 22792 conditions per place. [2025-04-13 23:49:22,135 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 546 selfloop transitions, 2466 changer transitions 38/3050 dead transitions. [2025-04-13 23:49:22,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 3050 transitions, 56660 flow [2025-04-13 23:49:22,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:49:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 23:49:22,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 755 transitions. [2025-04-13 23:49:22,138 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4683622828784119 [2025-04-13 23:49:22,138 INFO L175 Difference]: Start difference. First operand has 159 places, 1123 transitions, 21518 flow. Second operand 62 states and 755 transitions. [2025-04-13 23:49:22,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 3050 transitions, 56660 flow [2025-04-13 23:49:23,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 3050 transitions, 54268 flow, removed 213 selfloop flow, removed 6 redundant places. [2025-04-13 23:49:23,515 INFO L231 Difference]: Finished difference. Result has 222 places, 2551 transitions, 53958 flow [2025-04-13 23:49:23,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=20500, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=53958, PETRI_PLACES=222, PETRI_TRANSITIONS=2551} [2025-04-13 23:49:23,516 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 197 predicate places. [2025-04-13 23:49:23,516 INFO L485 AbstractCegarLoop]: Abstraction has has 222 places, 2551 transitions, 53958 flow [2025-04-13 23:49:23,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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 23:49:23,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:23,517 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-04-13 23:49:23,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-13 23:49:23,717 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-13 23:49:23,717 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:23,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:23,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1165084034, now seen corresponding path program 3 times [2025-04-13 23:49:23,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:23,718 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742336840] [2025-04-13 23:49:23,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:49:23,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:23,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 23:49:23,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:49:23,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 23:49:23,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:24,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:24,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742336840] [2025-04-13 23:49:24,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742336840] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:24,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859133356] [2025-04-13 23:49:24,580 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:49:24,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:24,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:24,582 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:49:24,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:49:24,700 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 23:49:25,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:49:25,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 23:49:25,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:25,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 1937 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-13 23:49:25,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:25,449 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 8 treesize of output 1 [2025-04-13 23:49:25,469 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 8 treesize of output 1 [2025-04-13 23:49:25,491 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 8 treesize of output 1 [2025-04-13 23:49:25,507 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 8 treesize of output 1 [2025-04-13 23:49:25,527 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 8 treesize of output 1 [2025-04-13 23:49:25,548 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 8 treesize of output 1 [2025-04-13 23:49:25,569 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 8 treesize of output 1 [2025-04-13 23:49:25,592 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 8 treesize of output 1 [2025-04-13 23:49:25,612 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 8 treesize of output 1 [2025-04-13 23:49:25,635 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 8 treesize of output 1 [2025-04-13 23:49:25,659 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:25,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:25,792 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:25,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859133356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:25,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:25,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2025-04-13 23:49:25,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360637178] [2025-04-13 23:49:25,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:25,792 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:49:25,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:25,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:49:25,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:49:25,794 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:49:25,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 2551 transitions, 53958 flow. Second operand has 35 states, 35 states have (on average 5.857142857142857) internal successors, (205), 35 states have internal predecessors, (205), 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 23:49:25,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:25,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:49:25,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:51:46,127 INFO L116 PetriNetUnfolderBase]: 228360/399494 cut-off events. [2025-04-13 23:51:46,128 INFO L117 PetriNetUnfolderBase]: For 2680723/2680723 co-relation queries the response was YES. [2025-04-13 23:51:48,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429396 conditions, 399494 events. 228360/399494 cut-off events. For 2680723/2680723 co-relation queries the response was YES. Maximal size of possible extension queue 2399. Compared 3654817 event pairs, 56467 based on Foata normal form. 2713/321426 useless extension candidates. Maximal degree in co-relation 1427699. Up to 75922 conditions per place. [2025-04-13 23:51:49,821 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 1256 selfloop transitions, 8876 changer transitions 22/10154 dead transitions. [2025-04-13 23:51:49,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 10154 transitions, 217368 flow [2025-04-13 23:51:49,822 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:51:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 23:51:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1519 transitions. [2025-04-13 23:51:49,825 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5901320901320901 [2025-04-13 23:51:49,825 INFO L175 Difference]: Start difference. First operand has 222 places, 2551 transitions, 53958 flow. Second operand 99 states and 1519 transitions. [2025-04-13 23:51:49,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 10154 transitions, 217368 flow [2025-04-13 23:53:07,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 10154 transitions, 214647 flow, removed 1360 selfloop flow, removed 1 redundant places. [2025-04-13 23:53:07,550 INFO L231 Difference]: Finished difference. Result has 319 places, 9159 transitions, 210026 flow [2025-04-13 23:53:07,552 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=52942, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2451, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=99, PETRI_FLOW=210026, PETRI_PLACES=319, PETRI_TRANSITIONS=9159} [2025-04-13 23:53:07,557 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 294 predicate places. [2025-04-13 23:53:07,557 INFO L485 AbstractCegarLoop]: Abstraction has has 319 places, 9159 transitions, 210026 flow [2025-04-13 23:53:07,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 5.857142857142857) internal successors, (205), 35 states have internal predecessors, (205), 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 23:53:07,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:53:07,559 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:53:07,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-13 23:53:07,759 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-13 23:53:07,759 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:53:07,764 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:53:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash -781417042, now seen corresponding path program 5 times [2025-04-13 23:53:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:53:07,764 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238040780] [2025-04-13 23:53:07,764 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:53:07,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:53:07,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 23:53:08,290 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 23:53:08,291 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 23:53:08,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:11,560 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 1 proven. 126 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:53:11,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:53:11,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238040780] [2025-04-13 23:53:11,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238040780] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:53:11,560 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790420201] [2025-04-13 23:53:11,560 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:53:11,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:53:11,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:53:11,563 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:53:11,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:53:11,706 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-04-13 23:53:11,959 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 51 of 51 statements. [2025-04-13 23:53:11,959 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-04-13 23:53:11,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:53:11,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 1944 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-13 23:53:11,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:53:11,992 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 1 [2025-04-13 23:53:12,020 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:53:12,048 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:53:12,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:53:12,108 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:53:12,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2025-04-13 23:53:12,857 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:12,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:53:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 10 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:53:14,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790420201] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:53:14,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:53:14,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 33 [2025-04-13 23:53:14,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425554080] [2025-04-13 23:53:14,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:53:14,136 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:53:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:53:14,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:53:14,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:53:14,138 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:53:14,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 9159 transitions, 210026 flow. Second operand has 34 states, 34 states have (on average 6.5) internal successors, (221), 34 states have internal predecessors, (221), 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 23:53:14,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:53:14,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:53:14,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 23:58:53,447 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 23:58:53,447 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:58:54,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 [2025-04-13 23:58:54,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-13 23:58:55,023 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2025-04-13 23:58:55,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:58:55,023 WARN L610 AbstractCegarLoop]: Verification canceled: while executing Executor. [2025-04-13 23:58:55,024 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2025-04-13 23:58:55,025 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2025-04-13 23:58:55,025 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining) [2025-04-13 23:58:55,025 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 6 remaining) [2025-04-13 23:58:55,025 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2025-04-13 23:58:55,025 INFO L422 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1, 1] [2025-04-13 23:58:55,028 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:58:55,029 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:58:55,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:58:55 BasicIcfg [2025-04-13 23:58:55,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:58:55,032 INFO L158 Benchmark]: Toolchain (without parser) took 658508.86ms. Allocated memory was 125.8MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 85.1MB in the beginning and 1.6GB in the end (delta: -1.5GB). Peak memory consumption was 4.6GB. Max. memory is 8.0GB. [2025-04-13 23:58:55,032 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:58:55,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.19ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 44.1MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. [2025-04-13 23:58:55,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.64ms. Allocated memory is still 125.8MB. Free memory was 44.1MB in the beginning and 34.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 23:58:55,033 INFO L158 Benchmark]: Boogie Preprocessor took 93.71ms. Allocated memory is still 125.8MB. Free memory was 34.9MB in the beginning and 27.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2025-04-13 23:58:55,033 INFO L158 Benchmark]: IcfgBuilder took 12017.32ms. Allocated memory was 125.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 27.4MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. [2025-04-13 23:58:55,033 INFO L158 Benchmark]: TraceAbstraction took 645751.51ms. Allocated memory was 3.2GB in the beginning and 4.5GB in the end (delta: 1.3GB). Free memory was 2.6GB in the beginning and 1.6GB in the end (delta: 973.1MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 23:58:55,034 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.18ms. Allocated memory is still 167.8MB. Free memory is still 95.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 570.19ms. Allocated memory is still 125.8MB. Free memory was 85.1MB in the beginning and 44.1MB in the end (delta: 41.0MB). Peak memory consumption was 41.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 71.64ms. Allocated memory is still 125.8MB. Free memory was 44.1MB in the beginning and 34.9MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 93.71ms. Allocated memory is still 125.8MB. Free memory was 34.9MB in the beginning and 27.4MB in the end (delta: 7.6MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * IcfgBuilder took 12017.32ms. Allocated memory was 125.8MB in the beginning and 3.2GB in the end (delta: 3.1GB). Free memory was 27.4MB in the beginning and 2.6GB in the end (delta: -2.6GB). Peak memory consumption was 2.2GB. Max. memory is 8.0GB. * TraceAbstraction took 645751.51ms. Allocated memory was 3.2GB in the beginning and 4.5GB in the end (delta: 1.3GB). Free memory was 2.6GB in the beginning and 1.6GB in the end (delta: 973.1MB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1022]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 1021]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 941]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 39 locations, 46 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 645.6s, OverallIterations: 15, TraceHistogramMax: 11, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 613.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6744 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6744 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11825 IncrementalHoareTripleChecker+Invalid, 12998 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1173 mSolverCounterUnsat, 0 mSDtfsCounter, 11825 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1061 GetRequests, 652 SyntacticMatches, 1 SemanticMatches, 408 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7639 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=210026occurred in iteration=14, InterpolantAutomatonStates: 299, 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.3s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 24.0s InterpolantComputationTime, 750 NumberOfCodeBlocks, 750 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 1059 ConstructedInterpolants, 21 QuantifiedInterpolants, 21416 SizeOfPredicates, 135 NumberOfNonLiveVariables, 22041 ConjunctsInSsa, 221 ConjunctsInUnsatCore, 38 InterpolantComputations, 5 PerfectInterpolantSequences, 158/1950 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