/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 20:39:27,305 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 20:39:27,350 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 20:39:27,354 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 20:39:27,355 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 20:39:27,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 20:39:27,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 20:39:27,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 20:39:27,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 20:39:27,377 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 20:39:27,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 20:39:27,377 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 20:39:27,377 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 20:39:27,377 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 20:39:27,378 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 20:39:27,378 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 20:39:27,379 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:39:27,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:39:27,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 20:39:27,379 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 20:39:27,380 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET [2025-04-13 20:39:27,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 20:39:27,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 20:39:27,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 20:39:27,602 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 20:39:27,603 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 20:39:27,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-13 20:39:28,875 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e921c99/595138597684431c91877cba88dca4e4/FLAGb6aa1fafc [2025-04-13 20:39:29,067 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 20:39:29,068 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2025-04-13 20:39:29,075 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e921c99/595138597684431c91877cba88dca4e4/FLAGb6aa1fafc [2025-04-13 20:39:30,075 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33e921c99/595138597684431c91877cba88dca4e4 [2025-04-13 20:39:30,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 20:39:30,078 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 20:39:30,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 20:39:30,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 20:39:30,082 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 20:39:30,082 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,083 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45f7b11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30, skipping insertion in model container [2025-04-13 20:39:30,083 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 20:39:30,264 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-04-13 20:39:30,271 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:39:30,282 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 20:39:30,313 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2592,2605] [2025-04-13 20:39:30,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 20:39:30,338 INFO L204 MainTranslator]: Completed translation [2025-04-13 20:39:30,340 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30 WrapperNode [2025-04-13 20:39:30,340 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 20:39:30,341 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 20:39:30,341 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 20:39:30,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 20:39:30,345 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,356 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,369 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-04-13 20:39:30,369 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 20:39:30,369 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 20:39:30,371 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 20:39:30,371 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 20:39:30,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,398 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 20:39:30,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,405 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,412 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,417 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 20:39:30,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 20:39:30,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 20:39:30,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 20:39:30,425 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (1/1) ... [2025-04-13 20:39:30,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 20:39:30,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:30,451 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 20:39:30,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 20:39:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 20:39:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 20:39:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 20:39:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 20:39:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 20:39:30,472 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 20:39:30,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 20:39:30,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 20:39:30,473 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 20:39:30,558 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 20:39:30,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 20:39:30,767 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 20:39:30,768 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 20:39:30,768 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 20:39:30,941 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:39:30,943 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:39:30,948 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 20:39:30,952 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 20:39:30,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:39:30 BoogieIcfgContainer [2025-04-13 20:39:30,952 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 20:39:30,953 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 20:39:30,953 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 20:39:30,956 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 20:39:30,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 08:39:30" (1/3) ... [2025-04-13 20:39:30,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e57af1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:39:30, skipping insertion in model container [2025-04-13 20:39:30,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 08:39:30" (2/3) ... [2025-04-13 20:39:30,957 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e57af1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 08:39:30, skipping insertion in model container [2025-04-13 20:39:30,957 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 08:39:30" (3/3) ... [2025-04-13 20:39:30,958 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2025-04-13 20:39:30,968 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 20:39:30,969 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-max-array.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 20:39:30,969 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 20:39:31,012 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 20:39:31,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:39:31,080 INFO L116 PetriNetUnfolderBase]: 7/29 cut-off events. [2025-04-13 20:39:31,083 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:39:31,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42 conditions, 29 events. 7/29 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 24. Up to 2 conditions per place. [2025-04-13 20:39:31,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 20:39:31,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 31 places, 28 transitions, 74 flow [2025-04-13 20:39:31,097 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 20:39:31,109 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;@db69220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 20:39:31,110 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 20:39:31,121 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 20:39:31,121 INFO L116 PetriNetUnfolderBase]: 7/27 cut-off events. [2025-04-13 20:39:31,121 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-13 20:39:31,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:31,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:31,122 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:31,125 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash -2140429607, now seen corresponding path program 1 times [2025-04-13 20:39:31,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:31,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331310013] [2025-04-13 20:39:31,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:31,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:31,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 20:39:31,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 20:39:31,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:31,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:31,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:31,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:31,375 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331310013] [2025-04-13 20:39:31,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331310013] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:31,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:31,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:39:31,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597970308] [2025-04-13 20:39:31,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:31,383 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:39:31,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:31,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:39:31,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:39:31,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:31,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 28 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:31,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:31,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:31,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:31,564 INFO L116 PetriNetUnfolderBase]: 511/703 cut-off events. [2025-04-13 20:39:31,564 INFO L117 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-04-13 20:39:31,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1474 conditions, 703 events. 511/703 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1974 event pairs, 306 based on Foata normal form. 0/498 useless extension candidates. Maximal degree in co-relation 1304. Up to 701 conditions per place. [2025-04-13 20:39:31,572 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2025-04-13 20:39:31,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 126 flow [2025-04-13 20:39:31,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:39:31,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:39:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:39:31,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:39:31,582 INFO L175 Difference]: Start difference. First operand has 31 places, 28 transitions, 74 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:39:31,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 126 flow [2025-04-13 20:39:31,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 27 transitions, 114 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-13 20:39:31,590 INFO L231 Difference]: Finished difference. Result has 27 places, 27 transitions, 62 flow [2025-04-13 20:39:31,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=27, PETRI_TRANSITIONS=27} [2025-04-13 20:39:31,594 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -4 predicate places. [2025-04-13 20:39:31,594 INFO L485 AbstractCegarLoop]: Abstraction has has 27 places, 27 transitions, 62 flow [2025-04-13 20:39:31,595 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:31,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:31,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:31,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 20:39:31,595 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:31,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:31,595 INFO L85 PathProgramCache]: Analyzing trace with hash -30261296, now seen corresponding path program 1 times [2025-04-13 20:39:31,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:31,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530807503] [2025-04-13 20:39:31,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:31,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:31,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 20:39:31,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 20:39:31,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:31,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:31,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:31,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530807503] [2025-04-13 20:39:31,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530807503] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:31,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:31,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 20:39:31,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978531379] [2025-04-13 20:39:31,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:31,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:39:31,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:31,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:39:31,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:39:31,667 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:31,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 27 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 20:39:31,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:31,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:31,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:31,759 INFO L116 PetriNetUnfolderBase]: 474/666 cut-off events. [2025-04-13 20:39:31,759 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:39:31,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1357 conditions, 666 events. 474/666 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1869 event pairs, 306 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 1347. Up to 664 conditions per place. [2025-04-13 20:39:31,764 INFO L140 encePairwiseOnDemand]: 30/32 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-04-13 20:39:31,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 26 transitions, 112 flow [2025-04-13 20:39:31,765 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:39:31,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:39:31,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 36 transitions. [2025-04-13 20:39:31,765 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.375 [2025-04-13 20:39:31,765 INFO L175 Difference]: Start difference. First operand has 27 places, 27 transitions, 62 flow. Second operand 3 states and 36 transitions. [2025-04-13 20:39:31,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 26 transitions, 112 flow [2025-04-13 20:39:31,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 26 transitions, 111 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:31,766 INFO L231 Difference]: Finished difference. Result has 28 places, 26 transitions, 61 flow [2025-04-13 20:39:31,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=28, PETRI_TRANSITIONS=26} [2025-04-13 20:39:31,767 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -3 predicate places. [2025-04-13 20:39:31,767 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 26 transitions, 61 flow [2025-04-13 20:39:31,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 20:39:31,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:31,767 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:31,767 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 20:39:31,767 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:31,768 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1024193485, now seen corresponding path program 1 times [2025-04-13 20:39:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:31,768 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408533495] [2025-04-13 20:39:31,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:31,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 20:39:31,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 20:39:31,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:31,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:31,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:31,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:31,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408533495] [2025-04-13 20:39:31,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408533495] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:31,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:31,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 20:39:31,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161343482] [2025-04-13 20:39:31,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:31,866 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 20:39:31,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:31,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 20:39:31,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 20:39:31,867 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:31,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:31,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:31,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:31,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:31,959 INFO L116 PetriNetUnfolderBase]: 474/667 cut-off events. [2025-04-13 20:39:31,959 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-13 20:39:31,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1360 conditions, 667 events. 474/667 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1874 event pairs, 306 based on Foata normal form. 1/501 useless extension candidates. Maximal degree in co-relation 1347. Up to 667 conditions per place. [2025-04-13 20:39:31,964 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 25 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2025-04-13 20:39:31,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 27 transitions, 117 flow [2025-04-13 20:39:31,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 20:39:31,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 20:39:31,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-13 20:39:31,965 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3854166666666667 [2025-04-13 20:39:31,965 INFO L175 Difference]: Start difference. First operand has 28 places, 26 transitions, 61 flow. Second operand 3 states and 37 transitions. [2025-04-13 20:39:31,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 27 transitions, 117 flow [2025-04-13 20:39:31,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:31,967 INFO L231 Difference]: Finished difference. Result has 30 places, 27 transitions, 72 flow [2025-04-13 20:39:31,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=27} [2025-04-13 20:39:31,968 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2025-04-13 20:39:31,968 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 27 transitions, 72 flow [2025-04-13 20:39:31,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:31,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:31,968 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:31,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 20:39:31,968 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:31,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:31,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1964779173, now seen corresponding path program 1 times [2025-04-13 20:39:31,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:31,970 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709122287] [2025-04-13 20:39:31,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:39:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:32,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:32,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:32,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:32,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:32,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709122287] [2025-04-13 20:39:32,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709122287] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:32,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:32,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:32,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261965810] [2025-04-13 20:39:32,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:32,721 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:32,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:32,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:32,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:32,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:32,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 72 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:32,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:32,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:32,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:33,136 INFO L116 PetriNetUnfolderBase]: 675/971 cut-off events. [2025-04-13 20:39:33,136 INFO L117 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-04-13 20:39:33,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 971 events. 675/971 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3424 event pairs, 31 based on Foata normal form. 1/750 useless extension candidates. Maximal degree in co-relation 1976. Up to 748 conditions per place. [2025-04-13 20:39:33,141 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 68 selfloop transitions, 31 changer transitions 4/103 dead transitions. [2025-04-13 20:39:33,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 103 transitions, 447 flow [2025-04-13 20:39:33,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 20:39:33,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-13 20:39:33,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 142 transitions. [2025-04-13 20:39:33,142 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.34134615384615385 [2025-04-13 20:39:33,142 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 72 flow. Second operand 13 states and 142 transitions. [2025-04-13 20:39:33,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 103 transitions, 447 flow [2025-04-13 20:39:33,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 103 transitions, 443 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:33,144 INFO L231 Difference]: Finished difference. Result has 48 places, 57 transitions, 252 flow [2025-04-13 20:39:33,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=252, PETRI_PLACES=48, PETRI_TRANSITIONS=57} [2025-04-13 20:39:33,144 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2025-04-13 20:39:33,144 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 57 transitions, 252 flow [2025-04-13 20:39:33,145 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:33,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:33,145 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:33,145 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 20:39:33,145 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:33,145 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1543824365, now seen corresponding path program 2 times [2025-04-13 20:39:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:33,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550641293] [2025-04-13 20:39:33,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:33,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:33,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:33,165 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:33,166 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:39:33,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:33,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:33,650 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550641293] [2025-04-13 20:39:33,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550641293] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:33,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:33,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:33,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824316216] [2025-04-13 20:39:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:33,651 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:33,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:33,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:33,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:33,651 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:33,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 57 transitions, 252 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:33,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:33,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:33,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:34,031 INFO L116 PetriNetUnfolderBase]: 715/1042 cut-off events. [2025-04-13 20:39:34,032 INFO L117 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2025-04-13 20:39:34,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3126 conditions, 1042 events. 715/1042 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3747 event pairs, 61 based on Foata normal form. 1/924 useless extension candidates. Maximal degree in co-relation 3100. Up to 903 conditions per place. [2025-04-13 20:39:34,040 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 75 selfloop transitions, 28 changer transitions 4/107 dead transitions. [2025-04-13 20:39:34,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 107 transitions, 652 flow [2025-04-13 20:39:34,040 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:39:34,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:39:34,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 115 transitions. [2025-04-13 20:39:34,041 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2994791666666667 [2025-04-13 20:39:34,041 INFO L175 Difference]: Start difference. First operand has 48 places, 57 transitions, 252 flow. Second operand 12 states and 115 transitions. [2025-04-13 20:39:34,041 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 107 transitions, 652 flow [2025-04-13 20:39:34,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 107 transitions, 650 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:34,051 INFO L231 Difference]: Finished difference. Result has 64 places, 78 transitions, 452 flow [2025-04-13 20:39:34,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=452, PETRI_PLACES=64, PETRI_TRANSITIONS=78} [2025-04-13 20:39:34,051 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 33 predicate places. [2025-04-13 20:39:34,051 INFO L485 AbstractCegarLoop]: Abstraction has has 64 places, 78 transitions, 452 flow [2025-04-13 20:39:34,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:34,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:34,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:34,052 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 20:39:34,052 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:34,052 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:34,052 INFO L85 PathProgramCache]: Analyzing trace with hash 103533417, now seen corresponding path program 3 times [2025-04-13 20:39:34,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:34,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145512370] [2025-04-13 20:39:34,053 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:34,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:34,059 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:34,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:34,066 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:39:34,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:34,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:34,520 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145512370] [2025-04-13 20:39:34,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145512370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:34,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:34,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:34,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543198496] [2025-04-13 20:39:34,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:34,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:34,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:34,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:34,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:34,521 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:34,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 78 transitions, 452 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:34,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:34,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:34,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:34,880 INFO L116 PetriNetUnfolderBase]: 821/1207 cut-off events. [2025-04-13 20:39:34,880 INFO L117 PetriNetUnfolderBase]: For 1294/1294 co-relation queries the response was YES. [2025-04-13 20:39:34,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4242 conditions, 1207 events. 821/1207 cut-off events. For 1294/1294 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4604 event pairs, 52 based on Foata normal form. 1/1081 useless extension candidates. Maximal degree in co-relation 4208. Up to 1006 conditions per place. [2025-04-13 20:39:34,888 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 95 selfloop transitions, 44 changer transitions 4/143 dead transitions. [2025-04-13 20:39:34,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 143 transitions, 1033 flow [2025-04-13 20:39:34,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:39:34,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:39:34,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 130 transitions. [2025-04-13 20:39:34,890 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3385416666666667 [2025-04-13 20:39:34,890 INFO L175 Difference]: Start difference. First operand has 64 places, 78 transitions, 452 flow. Second operand 12 states and 130 transitions. [2025-04-13 20:39:34,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 143 transitions, 1033 flow [2025-04-13 20:39:34,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 143 transitions, 1007 flow, removed 12 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:34,901 INFO L231 Difference]: Finished difference. Result has 81 places, 105 transitions, 772 flow [2025-04-13 20:39:34,901 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=772, PETRI_PLACES=81, PETRI_TRANSITIONS=105} [2025-04-13 20:39:34,901 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 50 predicate places. [2025-04-13 20:39:34,901 INFO L485 AbstractCegarLoop]: Abstraction has has 81 places, 105 transitions, 772 flow [2025-04-13 20:39:34,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:34,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:34,901 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:34,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 20:39:34,902 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:34,902 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:34,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1537397129, now seen corresponding path program 4 times [2025-04-13 20:39:34,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:34,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273988632] [2025-04-13 20:39:34,902 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:34,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:34,910 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:34,919 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:34,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:34,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:35,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:35,373 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273988632] [2025-04-13 20:39:35,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273988632] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:35,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:35,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:35,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720879394] [2025-04-13 20:39:35,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:35,375 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:35,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:35,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:35,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:35,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 105 transitions, 772 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:35,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:35,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:35,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:35,749 INFO L116 PetriNetUnfolderBase]: 912/1351 cut-off events. [2025-04-13 20:39:35,749 INFO L117 PetriNetUnfolderBase]: For 2657/2657 co-relation queries the response was YES. [2025-04-13 20:39:35,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5509 conditions, 1351 events. 912/1351 cut-off events. For 2657/2657 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 5277 event pairs, 101 based on Foata normal form. 1/1217 useless extension candidates. Maximal degree in co-relation 5466. Up to 1141 conditions per place. [2025-04-13 20:39:35,759 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 104 selfloop transitions, 56 changer transitions 4/164 dead transitions. [2025-04-13 20:39:35,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 164 transitions, 1420 flow [2025-04-13 20:39:35,759 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:39:35,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:39:35,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 126 transitions. [2025-04-13 20:39:35,761 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.328125 [2025-04-13 20:39:35,761 INFO L175 Difference]: Start difference. First operand has 81 places, 105 transitions, 772 flow. Second operand 12 states and 126 transitions. [2025-04-13 20:39:35,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 164 transitions, 1420 flow [2025-04-13 20:39:35,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 164 transitions, 1349 flow, removed 20 selfloop flow, removed 3 redundant places. [2025-04-13 20:39:35,775 INFO L231 Difference]: Finished difference. Result has 97 places, 131 transitions, 1137 flow [2025-04-13 20:39:35,775 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1137, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2025-04-13 20:39:35,776 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 66 predicate places. [2025-04-13 20:39:35,776 INFO L485 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1137 flow [2025-04-13 20:39:35,776 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:35,776 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:35,776 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:35,776 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 20:39:35,776 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:35,778 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:35,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1712378771, now seen corresponding path program 5 times [2025-04-13 20:39:35,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:35,778 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215803765] [2025-04-13 20:39:35,778 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:35,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:35,784 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:35,798 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:35,799 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:35,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:36,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:36,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:36,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215803765] [2025-04-13 20:39:36,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215803765] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:36,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469835915] [2025-04-13 20:39:36,293 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:36,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:36,295 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:36,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 20:39:36,341 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:36,359 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:36,359 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:36,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:36,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:39:36,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:36,419 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 20:39:36,615 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 20:39:36,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:36,667 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:37,203 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 20:39:37,207 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 20:39:37,245 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 20:39:37,248 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 20:39:37,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [469835915] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:37,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:39:37,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328036093] [2025-04-13 20:39:37,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:37,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:39:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:37,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:39:37,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:39:37,255 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:37,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1137 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:37,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:37,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:37,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:40,126 INFO L116 PetriNetUnfolderBase]: 1976/2985 cut-off events. [2025-04-13 20:39:40,126 INFO L117 PetriNetUnfolderBase]: For 9560/9560 co-relation queries the response was YES. [2025-04-13 20:39:40,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14064 conditions, 2985 events. 1976/2985 cut-off events. For 9560/9560 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 14756 event pairs, 78 based on Foata normal form. 6/2762 useless extension candidates. Maximal degree in co-relation 13953. Up to 1476 conditions per place. [2025-04-13 20:39:40,144 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 230 selfloop transitions, 352 changer transitions 3/585 dead transitions. [2025-04-13 20:39:40,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 585 transitions, 5428 flow [2025-04-13 20:39:40,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 20:39:40,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-04-13 20:39:40,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 560 transitions. [2025-04-13 20:39:40,146 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:39:40,147 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 1137 flow. Second operand 56 states and 560 transitions. [2025-04-13 20:39:40,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 585 transitions, 5428 flow [2025-04-13 20:39:40,182 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 585 transitions, 5207 flow, removed 109 selfloop flow, removed 1 redundant places. [2025-04-13 20:39:40,187 INFO L231 Difference]: Finished difference. Result has 159 places, 424 transitions, 4431 flow [2025-04-13 20:39:40,187 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=99, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=4431, PETRI_PLACES=159, PETRI_TRANSITIONS=424} [2025-04-13 20:39:40,188 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 128 predicate places. [2025-04-13 20:39:40,188 INFO L485 AbstractCegarLoop]: Abstraction has has 159 places, 424 transitions, 4431 flow [2025-04-13 20:39:40,188 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:40,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:40,188 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:40,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 20:39:40,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:40,393 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:40,393 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1603446899, now seen corresponding path program 6 times [2025-04-13 20:39:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:40,394 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143375146] [2025-04-13 20:39:40,394 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:39:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:40,403 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:40,412 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:40,412 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:39:40,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:40,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:40,674 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143375146] [2025-04-13 20:39:40,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143375146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:40,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:40,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:40,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800024662] [2025-04-13 20:39:40,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:40,675 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:40,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:40,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:40,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:40,676 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:40,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 424 transitions, 4431 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:40,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:40,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:40,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:41,207 INFO L116 PetriNetUnfolderBase]: 2055/3111 cut-off events. [2025-04-13 20:39:41,207 INFO L117 PetriNetUnfolderBase]: For 11053/11053 co-relation queries the response was YES. [2025-04-13 20:39:41,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16689 conditions, 3111 events. 2055/3111 cut-off events. For 11053/11053 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 15461 event pairs, 140 based on Foata normal form. 1/2895 useless extension candidates. Maximal degree in co-relation 16563. Up to 2833 conditions per place. [2025-04-13 20:39:41,231 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 372 selfloop transitions, 120 changer transitions 4/496 dead transitions. [2025-04-13 20:39:41,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 496 transitions, 6011 flow [2025-04-13 20:39:41,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:39:41,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:39:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 137 transitions. [2025-04-13 20:39:41,232 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.30580357142857145 [2025-04-13 20:39:41,233 INFO L175 Difference]: Start difference. First operand has 159 places, 424 transitions, 4431 flow. Second operand 14 states and 137 transitions. [2025-04-13 20:39:41,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 496 transitions, 6011 flow [2025-04-13 20:39:41,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 496 transitions, 4959 flow, removed 405 selfloop flow, removed 8 redundant places. [2025-04-13 20:39:41,361 INFO L231 Difference]: Finished difference. Result has 169 places, 465 transitions, 4201 flow [2025-04-13 20:39:41,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3438, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=4201, PETRI_PLACES=169, PETRI_TRANSITIONS=465} [2025-04-13 20:39:41,362 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 138 predicate places. [2025-04-13 20:39:41,362 INFO L485 AbstractCegarLoop]: Abstraction has has 169 places, 465 transitions, 4201 flow [2025-04-13 20:39:41,362 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:41,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:41,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:41,363 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 20:39:41,363 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:41,363 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:41,363 INFO L85 PathProgramCache]: Analyzing trace with hash -566136111, now seen corresponding path program 7 times [2025-04-13 20:39:41,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:41,363 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340440572] [2025-04-13 20:39:41,363 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:41,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:41,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:41,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:41,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:41,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:41,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:41,661 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340440572] [2025-04-13 20:39:41,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340440572] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:41,662 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [739717984] [2025-04-13 20:39:41,662 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:41,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:41,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:41,664 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:41,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 20:39:41,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:41,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:41,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:41,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:41,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:39:41,721 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:41,740 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 20:39:41,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 20:39:41,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:41,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:42,414 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 20:39:42,418 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 20:39:42,454 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 20:39:42,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 20:39:42,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:42,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [739717984] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:42,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:42,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:39:42,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951333263] [2025-04-13 20:39:42,464 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:42,464 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:39:42,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:42,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:39:42,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:39:42,465 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:42,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 465 transitions, 4201 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:42,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:42,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:42,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:44,734 INFO L116 PetriNetUnfolderBase]: 2989/4484 cut-off events. [2025-04-13 20:39:44,734 INFO L117 PetriNetUnfolderBase]: For 8781/8781 co-relation queries the response was YES. [2025-04-13 20:39:44,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19867 conditions, 4484 events. 2989/4484 cut-off events. For 8781/8781 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 23604 event pairs, 115 based on Foata normal form. 3/3997 useless extension candidates. Maximal degree in co-relation 19730. Up to 1947 conditions per place. [2025-04-13 20:39:44,755 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 269 selfloop transitions, 546 changer transitions 2/817 dead transitions. [2025-04-13 20:39:44,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 817 transitions, 8089 flow [2025-04-13 20:39:44,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:39:44,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:39:44,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 387 transitions. [2025-04-13 20:39:44,757 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3268581081081081 [2025-04-13 20:39:44,758 INFO L175 Difference]: Start difference. First operand has 169 places, 465 transitions, 4201 flow. Second operand 37 states and 387 transitions. [2025-04-13 20:39:44,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 817 transitions, 8089 flow [2025-04-13 20:39:44,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 817 transitions, 7839 flow, removed 91 selfloop flow, removed 2 redundant places. [2025-04-13 20:39:44,814 INFO L231 Difference]: Finished difference. Result has 218 places, 704 transitions, 7669 flow [2025-04-13 20:39:44,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=4011, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=462, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=334, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=7669, PETRI_PLACES=218, PETRI_TRANSITIONS=704} [2025-04-13 20:39:44,815 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 187 predicate places. [2025-04-13 20:39:44,815 INFO L485 AbstractCegarLoop]: Abstraction has has 218 places, 704 transitions, 7669 flow [2025-04-13 20:39:44,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:44,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:44,815 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:44,821 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 20:39:45,019 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-13 20:39:45,019 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:45,019 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:45,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1745409399, now seen corresponding path program 8 times [2025-04-13 20:39:45,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:45,020 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150825646] [2025-04-13 20:39:45,020 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:39:45,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:45,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:45,032 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:45,033 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:39:45,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:45,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:45,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:45,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150825646] [2025-04-13 20:39:45,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150825646] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:45,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:45,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:45,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929439195] [2025-04-13 20:39:45,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:45,273 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:45,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:45,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:45,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:45,273 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:45,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 704 transitions, 7669 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:45,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:45,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:45,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:45,978 INFO L116 PetriNetUnfolderBase]: 3053/4598 cut-off events. [2025-04-13 20:39:45,978 INFO L117 PetriNetUnfolderBase]: For 13506/13506 co-relation queries the response was YES. [2025-04-13 20:39:45,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25284 conditions, 4598 events. 3053/4598 cut-off events. For 13506/13506 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 24429 event pairs, 223 based on Foata normal form. 2/4217 useless extension candidates. Maximal degree in co-relation 25125. Up to 4243 conditions per place. [2025-04-13 20:39:46,003 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 617 selfloop transitions, 140 changer transitions 5/762 dead transitions. [2025-04-13 20:39:46,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 762 transitions, 9700 flow [2025-04-13 20:39:46,004 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 20:39:46,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-13 20:39:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 120 transitions. [2025-04-13 20:39:46,004 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:39:46,004 INFO L175 Difference]: Start difference. First operand has 218 places, 704 transitions, 7669 flow. Second operand 12 states and 120 transitions. [2025-04-13 20:39:46,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 762 transitions, 9700 flow [2025-04-13 20:39:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 762 transitions, 9078 flow, removed 210 selfloop flow, removed 10 redundant places. [2025-04-13 20:39:46,160 INFO L231 Difference]: Finished difference. Result has 225 places, 729 transitions, 7842 flow [2025-04-13 20:39:46,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7107, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=118, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=567, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7842, PETRI_PLACES=225, PETRI_TRANSITIONS=729} [2025-04-13 20:39:46,161 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 194 predicate places. [2025-04-13 20:39:46,161 INFO L485 AbstractCegarLoop]: Abstraction has has 225 places, 729 transitions, 7842 flow [2025-04-13 20:39:46,161 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:46,161 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:46,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:46,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 20:39:46,161 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:46,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:46,161 INFO L85 PathProgramCache]: Analyzing trace with hash 394219197, now seen corresponding path program 9 times [2025-04-13 20:39:46,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:46,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789702568] [2025-04-13 20:39:46,162 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:39:46,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:46,166 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:46,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:46,170 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:39:46,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:46,394 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789702568] [2025-04-13 20:39:46,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789702568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:46,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:46,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:46,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500680141] [2025-04-13 20:39:46,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:46,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:46,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:46,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:46,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:46,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:46,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 729 transitions, 7842 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:46,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:46,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:46,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:47,124 INFO L116 PetriNetUnfolderBase]: 3114/4701 cut-off events. [2025-04-13 20:39:47,124 INFO L117 PetriNetUnfolderBase]: For 12108/12108 co-relation queries the response was YES. [2025-04-13 20:39:47,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25295 conditions, 4701 events. 3114/4701 cut-off events. For 12108/12108 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 25242 event pairs, 226 based on Foata normal form. 1/4295 useless extension candidates. Maximal degree in co-relation 25133. Up to 4189 conditions per place. [2025-04-13 20:39:47,150 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 596 selfloop transitions, 185 changer transitions 5/786 dead transitions. [2025-04-13 20:39:47,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 786 transitions, 9807 flow [2025-04-13 20:39:47,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 114 transitions. [2025-04-13 20:39:47,151 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35625 [2025-04-13 20:39:47,151 INFO L175 Difference]: Start difference. First operand has 225 places, 729 transitions, 7842 flow. Second operand 10 states and 114 transitions. [2025-04-13 20:39:47,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 786 transitions, 9807 flow [2025-04-13 20:39:47,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 786 transitions, 9705 flow, removed 32 selfloop flow, removed 2 redundant places. [2025-04-13 20:39:47,249 INFO L231 Difference]: Finished difference. Result has 235 places, 753 transitions, 8450 flow [2025-04-13 20:39:47,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7752, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=8450, PETRI_PLACES=235, PETRI_TRANSITIONS=753} [2025-04-13 20:39:47,250 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 204 predicate places. [2025-04-13 20:39:47,250 INFO L485 AbstractCegarLoop]: Abstraction has has 235 places, 753 transitions, 8450 flow [2025-04-13 20:39:47,250 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:47,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:47,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:47,250 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 20:39:47,250 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:47,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash 578960107, now seen corresponding path program 10 times [2025-04-13 20:39:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:47,251 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116968182] [2025-04-13 20:39:47,251 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:39:47,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:47,255 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:47,261 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:47,261 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:39:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:47,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:47,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116968182] [2025-04-13 20:39:47,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116968182] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:47,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:47,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:39:47,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91358785] [2025-04-13 20:39:47,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:47,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:39:47,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:47,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:39:47,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:39:47,580 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:47,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 753 transitions, 8450 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:47,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:47,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:47,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:48,443 INFO L116 PetriNetUnfolderBase]: 3265/4902 cut-off events. [2025-04-13 20:39:48,443 INFO L117 PetriNetUnfolderBase]: For 14611/14611 co-relation queries the response was YES. [2025-04-13 20:39:48,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27317 conditions, 4902 events. 3265/4902 cut-off events. For 14611/14611 co-relation queries the response was YES. Maximal size of possible extension queue 380. Compared 26310 event pairs, 220 based on Foata normal form. 1/4476 useless extension candidates. Maximal degree in co-relation 27149. Up to 4434 conditions per place. [2025-04-13 20:39:48,468 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 621 selfloop transitions, 198 changer transitions 5/824 dead transitions. [2025-04-13 20:39:48,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 824 transitions, 10648 flow [2025-04-13 20:39:48,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 20:39:48,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-13 20:39:48,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2025-04-13 20:39:48,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36875 [2025-04-13 20:39:48,470 INFO L175 Difference]: Start difference. First operand has 235 places, 753 transitions, 8450 flow. Second operand 10 states and 118 transitions. [2025-04-13 20:39:48,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 824 transitions, 10648 flow [2025-04-13 20:39:48,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 824 transitions, 10430 flow, removed 11 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:48,609 INFO L231 Difference]: Finished difference. Result has 242 places, 784 transitions, 9060 flow [2025-04-13 20:39:48,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8232, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=753, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=172, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=9060, PETRI_PLACES=242, PETRI_TRANSITIONS=784} [2025-04-13 20:39:48,609 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 211 predicate places. [2025-04-13 20:39:48,609 INFO L485 AbstractCegarLoop]: Abstraction has has 242 places, 784 transitions, 9060 flow [2025-04-13 20:39:48,610 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:48,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:48,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:48,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 20:39:48,610 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:48,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:48,610 INFO L85 PathProgramCache]: Analyzing trace with hash -923400023, now seen corresponding path program 11 times [2025-04-13 20:39:48,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:48,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378010075] [2025-04-13 20:39:48,610 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:48,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:48,614 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:48,622 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:48,622 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:48,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:48,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:48,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:48,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378010075] [2025-04-13 20:39:48,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378010075] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:48,914 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247684722] [2025-04-13 20:39:48,914 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:39:48,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:48,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:48,916 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:48,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 20:39:48,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:48,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:48,973 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:39:48,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:48,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:39:48,975 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:48,991 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 20:39:49,109 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:39:49,110 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2025-04-13 20:39:49,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:49,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:49,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 20:39:49,668 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 20:39:49,694 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 20:39:49,696 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 20:39:49,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:49,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247684722] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:49,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:49,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:39:49,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682591682] [2025-04-13 20:39:49,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:49,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:39:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:49,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:39:49,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:39:49,700 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:49,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 784 transitions, 9060 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:49,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:49,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:49,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:52,888 INFO L116 PetriNetUnfolderBase]: 4813/7210 cut-off events. [2025-04-13 20:39:52,888 INFO L117 PetriNetUnfolderBase]: For 22679/22679 co-relation queries the response was YES. [2025-04-13 20:39:52,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41694 conditions, 7210 events. 4813/7210 cut-off events. For 22679/22679 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 41379 event pairs, 120 based on Foata normal form. 1/6601 useless extension candidates. Maximal degree in co-relation 41507. Up to 3501 conditions per place. [2025-04-13 20:39:52,942 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 342 selfloop transitions, 1096 changer transitions 2/1440 dead transitions. [2025-04-13 20:39:52,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 1440 transitions, 17852 flow [2025-04-13 20:39:52,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:39:52,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:39:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 629 transitions. [2025-04-13 20:39:52,945 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32760416666666664 [2025-04-13 20:39:52,945 INFO L175 Difference]: Start difference. First operand has 242 places, 784 transitions, 9060 flow. Second operand 60 states and 629 transitions. [2025-04-13 20:39:52,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 1440 transitions, 17852 flow [2025-04-13 20:39:53,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 1440 transitions, 17540 flow, removed 42 selfloop flow, removed 5 redundant places. [2025-04-13 20:39:53,212 INFO L231 Difference]: Finished difference. Result has 314 places, 1262 transitions, 17113 flow [2025-04-13 20:39:53,212 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8800, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=784, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=647, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=17113, PETRI_PLACES=314, PETRI_TRANSITIONS=1262} [2025-04-13 20:39:53,213 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 283 predicate places. [2025-04-13 20:39:53,213 INFO L485 AbstractCegarLoop]: Abstraction has has 314 places, 1262 transitions, 17113 flow [2025-04-13 20:39:53,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:53,213 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:53,213 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:53,218 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 20:39:53,413 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:53,414 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:53,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:53,414 INFO L85 PathProgramCache]: Analyzing trace with hash 980503197, now seen corresponding path program 12 times [2025-04-13 20:39:53,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:53,414 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863689270] [2025-04-13 20:39:53,414 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:39:53,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:53,419 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:39:53,425 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:39:53,425 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:39:53,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:53,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:39:53,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:53,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863689270] [2025-04-13 20:39:53,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863689270] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:39:53,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:39:53,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:39:53,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445952768] [2025-04-13 20:39:53,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:39:53,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:39:53,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:53,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:39:53,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:39:53,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:53,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 1262 transitions, 17113 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:53,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:53,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:53,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:55,310 INFO L116 PetriNetUnfolderBase]: 4868/7305 cut-off events. [2025-04-13 20:39:55,310 INFO L117 PetriNetUnfolderBase]: For 31366/31366 co-relation queries the response was YES. [2025-04-13 20:39:55,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50024 conditions, 7305 events. 4868/7305 cut-off events. For 31366/31366 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 42052 event pairs, 333 based on Foata normal form. 1/6708 useless extension candidates. Maximal degree in co-relation 49812. Up to 6943 conditions per place. [2025-04-13 20:39:55,365 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1132 selfloop transitions, 186 changer transitions 5/1323 dead transitions. [2025-04-13 20:39:55,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 1323 transitions, 20307 flow [2025-04-13 20:39:55,365 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 20:39:55,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-04-13 20:39:55,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 137 transitions. [2025-04-13 20:39:55,366 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28541666666666665 [2025-04-13 20:39:55,366 INFO L175 Difference]: Start difference. First operand has 314 places, 1262 transitions, 17113 flow. Second operand 15 states and 137 transitions. [2025-04-13 20:39:55,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 1323 transitions, 20307 flow [2025-04-13 20:39:56,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 1323 transitions, 19151 flow, removed 468 selfloop flow, removed 15 redundant places. [2025-04-13 20:39:56,092 INFO L231 Difference]: Finished difference. Result has 321 places, 1292 transitions, 16951 flow [2025-04-13 20:39:56,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=16017, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1085, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=16951, PETRI_PLACES=321, PETRI_TRANSITIONS=1292} [2025-04-13 20:39:56,093 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 290 predicate places. [2025-04-13 20:39:56,093 INFO L485 AbstractCegarLoop]: Abstraction has has 321 places, 1292 transitions, 16951 flow [2025-04-13 20:39:56,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:56,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:39:56,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:39:56,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 20:39:56,094 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:39:56,094 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:39:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1967556177, now seen corresponding path program 13 times [2025-04-13 20:39:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:39:56,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928778802] [2025-04-13 20:39:56,094 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:39:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:56,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:56,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:56,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:56,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:39:56,356 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928778802] [2025-04-13 20:39:56,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928778802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:39:56,357 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266654969] [2025-04-13 20:39:56,357 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:39:56,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:39:56,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:39:56,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:39:56,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 20:39:56,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 20:39:56,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:39:56,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:39:56,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:39:56,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:39:56,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:39:56,436 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 20:39:56,561 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 31 [2025-04-13 20:39:56,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:56,600 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:39:56,994 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 20:39:56,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 20:39:57,002 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 20:39:57,005 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 20:39:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:39:57,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266654969] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:39:57,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:39:57,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:39:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455827633] [2025-04-13 20:39:57,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:39:57,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:39:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:39:57,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:39:57,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:39:57,029 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:39:57,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 1292 transitions, 16951 flow. Second operand has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:39:57,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:39:57,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:39:57,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:39:59,681 INFO L116 PetriNetUnfolderBase]: 5781/8739 cut-off events. [2025-04-13 20:39:59,681 INFO L117 PetriNetUnfolderBase]: For 31112/31112 co-relation queries the response was YES. [2025-04-13 20:39:59,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55932 conditions, 8739 events. 5781/8739 cut-off events. For 31112/31112 co-relation queries the response was YES. Maximal size of possible extension queue 708. Compared 52537 event pairs, 146 based on Foata normal form. 16/7997 useless extension candidates. Maximal degree in co-relation 55832. Up to 4608 conditions per place. [2025-04-13 20:39:59,761 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 643 selfloop transitions, 916 changer transitions 1/1560 dead transitions. [2025-04-13 20:39:59,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1560 transitions, 22394 flow [2025-04-13 20:39:59,761 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-13 20:39:59,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-04-13 20:39:59,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 338 transitions. [2025-04-13 20:39:59,762 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.330078125 [2025-04-13 20:39:59,762 INFO L175 Difference]: Start difference. First operand has 321 places, 1292 transitions, 16951 flow. Second operand 32 states and 338 transitions. [2025-04-13 20:39:59,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1560 transitions, 22394 flow [2025-04-13 20:40:00,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 1560 transitions, 21653 flow, removed 180 selfloop flow, removed 20 redundant places. [2025-04-13 20:40:00,313 INFO L231 Difference]: Finished difference. Result has 333 places, 1403 transitions, 21071 flow [2025-04-13 20:40:00,314 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=13411, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1076, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=624, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=298, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=21071, PETRI_PLACES=333, PETRI_TRANSITIONS=1403} [2025-04-13 20:40:00,314 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 302 predicate places. [2025-04-13 20:40:00,314 INFO L485 AbstractCegarLoop]: Abstraction has has 333 places, 1403 transitions, 21071 flow [2025-04-13 20:40:00,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.24) internal successors, (131), 25 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:00,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:00,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:00,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:00,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-13 20:40:00,515 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:00,516 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:00,516 INFO L85 PathProgramCache]: Analyzing trace with hash 677362615, now seen corresponding path program 14 times [2025-04-13 20:40:00,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:00,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830055447] [2025-04-13 20:40:00,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:00,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:00,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:00,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:00,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:40:00,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:00,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:00,736 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830055447] [2025-04-13 20:40:00,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830055447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:00,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:00,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:40:00,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785087157] [2025-04-13 20:40:00,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:00,737 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:40:00,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:00,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:40:00,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:40:00,737 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:00,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 333 places, 1403 transitions, 21071 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:00,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:00,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:00,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:02,861 INFO L116 PetriNetUnfolderBase]: 5852/8862 cut-off events. [2025-04-13 20:40:02,862 INFO L117 PetriNetUnfolderBase]: For 49212/49212 co-relation queries the response was YES. [2025-04-13 20:40:02,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64943 conditions, 8862 events. 5852/8862 cut-off events. For 49212/49212 co-relation queries the response was YES. Maximal size of possible extension queue 745. Compared 53892 event pairs, 405 based on Foata normal form. 3/8081 useless extension candidates. Maximal degree in co-relation 64838. Up to 8513 conditions per place. [2025-04-13 20:40:02,927 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1306 selfloop transitions, 159 changer transitions 6/1471 dead transitions. [2025-04-13 20:40:02,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 346 places, 1471 transitions, 24816 flow [2025-04-13 20:40:02,927 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:40:02,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:40:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 130 transitions. [2025-04-13 20:40:02,928 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.29017857142857145 [2025-04-13 20:40:02,928 INFO L175 Difference]: Start difference. First operand has 333 places, 1403 transitions, 21071 flow. Second operand 14 states and 130 transitions. [2025-04-13 20:40:02,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 346 places, 1471 transitions, 24816 flow [2025-04-13 20:40:04,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 1471 transitions, 24318 flow, removed 213 selfloop flow, removed 8 redundant places. [2025-04-13 20:40:04,044 INFO L231 Difference]: Finished difference. Result has 343 places, 1442 transitions, 21710 flow [2025-04-13 20:40:04,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20581, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1403, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=126, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=21710, PETRI_PLACES=343, PETRI_TRANSITIONS=1442} [2025-04-13 20:40:04,045 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 312 predicate places. [2025-04-13 20:40:04,045 INFO L485 AbstractCegarLoop]: Abstraction has has 343 places, 1442 transitions, 21710 flow [2025-04-13 20:40:04,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:04,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:04,045 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:04,045 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 20:40:04,045 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:04,046 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:04,046 INFO L85 PathProgramCache]: Analyzing trace with hash 36701691, now seen corresponding path program 15 times [2025-04-13 20:40:04,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:04,046 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531644496] [2025-04-13 20:40:04,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:04,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:04,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:04,055 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 20:40:04,055 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 20:40:04,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:04,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:04,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:04,250 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531644496] [2025-04-13 20:40:04,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531644496] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:04,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:04,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 20:40:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149129329] [2025-04-13 20:40:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:04,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:04,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:04,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:04,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:04,251 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:04,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1442 transitions, 21710 flow. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:04,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:04,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:04,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:06,513 INFO L116 PetriNetUnfolderBase]: 6458/9772 cut-off events. [2025-04-13 20:40:06,514 INFO L117 PetriNetUnfolderBase]: For 56570/56570 co-relation queries the response was YES. [2025-04-13 20:40:06,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71449 conditions, 9772 events. 6458/9772 cut-off events. For 56570/56570 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 60019 event pairs, 344 based on Foata normal form. 2/8908 useless extension candidates. Maximal degree in co-relation 71342. Up to 7015 conditions per place. [2025-04-13 20:40:06,592 INFO L140 encePairwiseOnDemand]: 18/32 looper letters, 991 selfloop transitions, 715 changer transitions 1/1707 dead transitions. [2025-04-13 20:40:06,593 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1707 transitions, 28623 flow [2025-04-13 20:40:06,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:40:06,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:40:06,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 162 transitions. [2025-04-13 20:40:06,598 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.36160714285714285 [2025-04-13 20:40:06,599 INFO L175 Difference]: Start difference. First operand has 343 places, 1442 transitions, 21710 flow. Second operand 14 states and 162 transitions. [2025-04-13 20:40:06,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1707 transitions, 28623 flow [2025-04-13 20:40:07,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1707 transitions, 28234 flow, removed 127 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:07,795 INFO L231 Difference]: Finished difference. Result has 357 places, 1615 transitions, 26826 flow [2025-04-13 20:40:07,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21323, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1442, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=552, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=784, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=26826, PETRI_PLACES=357, PETRI_TRANSITIONS=1615} [2025-04-13 20:40:07,796 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 326 predicate places. [2025-04-13 20:40:07,796 INFO L485 AbstractCegarLoop]: Abstraction has has 357 places, 1615 transitions, 26826 flow [2025-04-13 20:40:07,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:07,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:07,797 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:07,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 20:40:07,797 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:07,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1649546299, now seen corresponding path program 16 times [2025-04-13 20:40:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:07,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496349065] [2025-04-13 20:40:07,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:07,801 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:07,805 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:07,806 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:40:07,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:08,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:08,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:08,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496349065] [2025-04-13 20:40:08,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496349065] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:08,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:08,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:40:08,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805257920] [2025-04-13 20:40:08,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:08,043 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:40:08,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:08,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:40:08,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:40:08,044 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:08,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 1615 transitions, 26826 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:08,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:08,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:08,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:10,424 INFO L116 PetriNetUnfolderBase]: 6544/9934 cut-off events. [2025-04-13 20:40:10,424 INFO L117 PetriNetUnfolderBase]: For 73433/73433 co-relation queries the response was YES. [2025-04-13 20:40:10,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78948 conditions, 9934 events. 6544/9934 cut-off events. For 73433/73433 co-relation queries the response was YES. Maximal size of possible extension queue 828. Compared 61461 event pairs, 464 based on Foata normal form. 2/9046 useless extension candidates. Maximal degree in co-relation 78834. Up to 9599 conditions per place. [2025-04-13 20:40:10,501 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 1534 selfloop transitions, 133 changer transitions 3/1670 dead transitions. [2025-04-13 20:40:10,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 367 places, 1670 transitions, 30876 flow [2025-04-13 20:40:10,501 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:40:10,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:40:10,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2025-04-13 20:40:10,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3068181818181818 [2025-04-13 20:40:10,502 INFO L175 Difference]: Start difference. First operand has 357 places, 1615 transitions, 26826 flow. Second operand 11 states and 108 transitions. [2025-04-13 20:40:10,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 367 places, 1670 transitions, 30876 flow [2025-04-13 20:40:12,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 1670 transitions, 30333 flow, removed 192 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:12,159 INFO L231 Difference]: Finished difference. Result has 365 places, 1646 transitions, 27262 flow [2025-04-13 20:40:12,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=26285, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1615, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=103, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1483, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=27262, PETRI_PLACES=365, PETRI_TRANSITIONS=1646} [2025-04-13 20:40:12,160 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 334 predicate places. [2025-04-13 20:40:12,160 INFO L485 AbstractCegarLoop]: Abstraction has has 365 places, 1646 transitions, 27262 flow [2025-04-13 20:40:12,160 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:12,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:12,161 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:12,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 20:40:12,161 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:12,161 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1339703679, now seen corresponding path program 17 times [2025-04-13 20:40:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:12,161 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889286604] [2025-04-13 20:40:12,161 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:12,164 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:12,168 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:12,168 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:12,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:12,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:12,428 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889286604] [2025-04-13 20:40:12,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889286604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:12,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932216866] [2025-04-13 20:40:12,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:12,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:12,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:12,430 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:12,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 20:40:12,465 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 20:40:12,477 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 20:40:12,477 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:12,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:12,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 20:40:12,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:12,496 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 20:40:12,606 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:40:12,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 39 [2025-04-13 20:40:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:12,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:13,127 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 20:40:13,128 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 20:40:13,150 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 20:40:13,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 20:40:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:13,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932216866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:13,157 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:13,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 20:40:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730087019] [2025-04-13 20:40:13,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:13,158 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 20:40:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:13,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 20:40:13,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2025-04-13 20:40:13,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:13,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 1646 transitions, 27262 flow. Second operand has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:13,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:13,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:13,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:17,829 INFO L116 PetriNetUnfolderBase]: 7857/11899 cut-off events. [2025-04-13 20:40:17,829 INFO L117 PetriNetUnfolderBase]: For 86463/86463 co-relation queries the response was YES. [2025-04-13 20:40:17,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94259 conditions, 11899 events. 7857/11899 cut-off events. For 86463/86463 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 75444 event pairs, 262 based on Foata normal form. 2/10810 useless extension candidates. Maximal degree in co-relation 94140. Up to 6832 conditions per place. [2025-04-13 20:40:17,937 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 907 selfloop transitions, 1302 changer transitions 3/2212 dead transitions. [2025-04-13 20:40:17,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 2212 transitions, 39700 flow [2025-04-13 20:40:17,938 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:40:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:40:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 505 transitions. [2025-04-13 20:40:17,939 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3287760416666667 [2025-04-13 20:40:17,939 INFO L175 Difference]: Start difference. First operand has 365 places, 1646 transitions, 27262 flow. Second operand 48 states and 505 transitions. [2025-04-13 20:40:17,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 2212 transitions, 39700 flow [2025-04-13 20:40:20,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 409 places, 2212 transitions, 39359 flow, removed 117 selfloop flow, removed 3 redundant places. [2025-04-13 20:40:20,046 INFO L231 Difference]: Finished difference. Result has 426 places, 2051 transitions, 38020 flow [2025-04-13 20:40:20,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=26983, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=970, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=38020, PETRI_PLACES=426, PETRI_TRANSITIONS=2051} [2025-04-13 20:40:20,047 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 395 predicate places. [2025-04-13 20:40:20,048 INFO L485 AbstractCegarLoop]: Abstraction has has 426 places, 2051 transitions, 38020 flow [2025-04-13 20:40:20,048 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.28) internal successors, (132), 25 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:20,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:20,048 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:20,053 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 20:40:20,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:20,249 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:20,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:20,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1807895827, now seen corresponding path program 18 times [2025-04-13 20:40:20,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:20,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541583206] [2025-04-13 20:40:20,250 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:40:20,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:20,254 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 21 statements into 2 equivalence classes. [2025-04-13 20:40:20,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 20:40:20,257 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 20:40:20,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:20,426 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541583206] [2025-04-13 20:40:20,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541583206] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:20,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:20,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 20:40:20,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478651361] [2025-04-13 20:40:20,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:20,426 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 20:40:20,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:20,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 20:40:20,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 20:40:20,427 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:20,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 426 places, 2051 transitions, 38020 flow. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:20,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:20,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:20,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:24,672 INFO L116 PetriNetUnfolderBase]: 8366/12710 cut-off events. [2025-04-13 20:40:24,672 INFO L117 PetriNetUnfolderBase]: For 119696/119696 co-relation queries the response was YES. [2025-04-13 20:40:24,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112728 conditions, 12710 events. 8366/12710 cut-off events. For 119696/119696 co-relation queries the response was YES. Maximal size of possible extension queue 1122. Compared 82254 event pairs, 278 based on Foata normal form. 2/11576 useless extension candidates. Maximal degree in co-relation 112591. Up to 9568 conditions per place. [2025-04-13 20:40:24,804 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1383 selfloop transitions, 986 changer transitions 6/2375 dead transitions. [2025-04-13 20:40:24,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2375 transitions, 48029 flow [2025-04-13 20:40:24,804 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 20:40:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-13 20:40:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 206 transitions. [2025-04-13 20:40:24,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3786764705882353 [2025-04-13 20:40:24,805 INFO L175 Difference]: Start difference. First operand has 426 places, 2051 transitions, 38020 flow. Second operand 17 states and 206 transitions. [2025-04-13 20:40:24,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2375 transitions, 48029 flow [2025-04-13 20:40:28,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 2375 transitions, 46224 flow, removed 681 selfloop flow, removed 11 redundant places. [2025-04-13 20:40:28,503 INFO L231 Difference]: Finished difference. Result has 437 places, 2259 transitions, 43790 flow [2025-04-13 20:40:28,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=36468, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=785, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=43790, PETRI_PLACES=437, PETRI_TRANSITIONS=2259} [2025-04-13 20:40:28,504 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 406 predicate places. [2025-04-13 20:40:28,504 INFO L485 AbstractCegarLoop]: Abstraction has has 437 places, 2259 transitions, 43790 flow [2025-04-13 20:40:28,505 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:28,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:28,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:28,505 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 20:40:28,505 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:28,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:28,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1181415785, now seen corresponding path program 19 times [2025-04-13 20:40:28,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:28,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495066977] [2025-04-13 20:40:28,505 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:40:28,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:28,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:40:28,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:40:28,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:28,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:28,541 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:28,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:28,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495066977] [2025-04-13 20:40:28,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495066977] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:28,541 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009840065] [2025-04-13 20:40:28,541 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:40:28,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:28,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:28,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:40:28,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 20:40:28,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-13 20:40:28,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 20:40:28,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:28,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:28,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 20:40:28,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:28,629 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:28,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:28,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009840065] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:28,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:40:28,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 11 [2025-04-13 20:40:28,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449921979] [2025-04-13 20:40:28,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:28,660 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:40:28,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:28,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:40:28,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:40:28,661 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:28,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 2259 transitions, 43790 flow. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:32,864 INFO L116 PetriNetUnfolderBase]: 9286/13775 cut-off events. [2025-04-13 20:40:32,864 INFO L117 PetriNetUnfolderBase]: For 156499/156499 co-relation queries the response was YES. [2025-04-13 20:40:32,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125388 conditions, 13775 events. 9286/13775 cut-off events. For 156499/156499 co-relation queries the response was YES. Maximal size of possible extension queue 1011. Compared 85391 event pairs, 2187 based on Foata normal form. 214/13249 useless extension candidates. Maximal degree in co-relation 125248. Up to 7749 conditions per place. [2025-04-13 20:40:33,005 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 2510 selfloop transitions, 103 changer transitions 1/2614 dead transitions. [2025-04-13 20:40:33,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 2614 transitions, 54716 flow [2025-04-13 20:40:33,005 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:33,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2025-04-13 20:40:33,005 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.453125 [2025-04-13 20:40:33,006 INFO L175 Difference]: Start difference. First operand has 437 places, 2259 transitions, 43790 flow. Second operand 6 states and 87 transitions. [2025-04-13 20:40:33,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 2614 transitions, 54716 flow [2025-04-13 20:40:36,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 2614 transitions, 53589 flow, removed 460 selfloop flow, removed 6 redundant places. [2025-04-13 20:40:36,516 INFO L231 Difference]: Finished difference. Result has 438 places, 2186 transitions, 41719 flow [2025-04-13 20:40:36,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=40846, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=41719, PETRI_PLACES=438, PETRI_TRANSITIONS=2186} [2025-04-13 20:40:36,517 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 407 predicate places. [2025-04-13 20:40:36,517 INFO L485 AbstractCegarLoop]: Abstraction has has 438 places, 2186 transitions, 41719 flow [2025-04-13 20:40:36,517 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:36,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:36,518 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:36,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:36,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:36,718 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:36,719 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:36,719 INFO L85 PathProgramCache]: Analyzing trace with hash -1737830654, now seen corresponding path program 1 times [2025-04-13 20:40:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:36,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381343426] [2025-04-13 20:40:36,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:36,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:36,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:36,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:36,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:36,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381343426] [2025-04-13 20:40:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381343426] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:36,754 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [532767778] [2025-04-13 20:40:36,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:36,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:36,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:36,756 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 20:40:36,758 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 20:40:36,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:36,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:36,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:36,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:36,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:40:36,805 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:36,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [532767778] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:36,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:40:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916796340] [2025-04-13 20:40:36,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:36,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:40:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:36,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:40:36,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:40:36,863 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:36,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 2186 transitions, 41719 flow. Second operand has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:36,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:36,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:36,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:40,198 INFO L116 PetriNetUnfolderBase]: 6848/10405 cut-off events. [2025-04-13 20:40:40,198 INFO L117 PetriNetUnfolderBase]: For 120211/120211 co-relation queries the response was YES. [2025-04-13 20:40:40,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93806 conditions, 10405 events. 6848/10405 cut-off events. For 120211/120211 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 64615 event pairs, 1736 based on Foata normal form. 132/10113 useless extension candidates. Maximal degree in co-relation 93666. Up to 6026 conditions per place. [2025-04-13 20:40:40,301 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1894 selfloop transitions, 98 changer transitions 40/2032 dead transitions. [2025-04-13 20:40:40,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 2032 transitions, 42583 flow [2025-04-13 20:40:40,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:40,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 84 transitions. [2025-04-13 20:40:40,302 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4375 [2025-04-13 20:40:40,302 INFO L175 Difference]: Start difference. First operand has 438 places, 2186 transitions, 41719 flow. Second operand 6 states and 84 transitions. [2025-04-13 20:40:40,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 2032 transitions, 42583 flow [2025-04-13 20:40:42,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 2032 transitions, 42166 flow, removed 39 selfloop flow, removed 10 redundant places. [2025-04-13 20:40:42,508 INFO L231 Difference]: Finished difference. Result has 419 places, 1787 transitions, 34323 flow [2025-04-13 20:40:42,509 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=34424, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1813, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=88, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=34323, PETRI_PLACES=419, PETRI_TRANSITIONS=1787} [2025-04-13 20:40:42,509 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 388 predicate places. [2025-04-13 20:40:42,509 INFO L485 AbstractCegarLoop]: Abstraction has has 419 places, 1787 transitions, 34323 flow [2025-04-13 20:40:42,509 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,509 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:42,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:42,516 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 20:40:42,710 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:42,710 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:42,711 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 192594206, now seen corresponding path program 1 times [2025-04-13 20:40:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:42,711 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198179249] [2025-04-13 20:40:42,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:42,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:42,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:42,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:42,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:42,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:42,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:42,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198179249] [2025-04-13 20:40:42,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198179249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:42,743 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133910392] [2025-04-13 20:40:42,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:42,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:42,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:42,745 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 20:40:42,747 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 20:40:42,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:42,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:42,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:40:42,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:42,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:42,830 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:42,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:42,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133910392] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:42,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:42,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-04-13 20:40:42,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370174470] [2025-04-13 20:40:42,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:42,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 20:40:42,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:42,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 20:40:42,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-13 20:40:42,859 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:42,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1787 transitions, 34323 flow. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:42,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:42,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:42,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:45,229 INFO L116 PetriNetUnfolderBase]: 5090/7745 cut-off events. [2025-04-13 20:40:45,229 INFO L117 PetriNetUnfolderBase]: For 91123/91123 co-relation queries the response was YES. [2025-04-13 20:40:45,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69696 conditions, 7745 events. 5090/7745 cut-off events. For 91123/91123 co-relation queries the response was YES. Maximal size of possible extension queue 533. Compared 45532 event pairs, 1192 based on Foata normal form. 181/7584 useless extension candidates. Maximal degree in co-relation 69562. Up to 4676 conditions per place. [2025-04-13 20:40:45,320 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 1435 selfloop transitions, 34 changer transitions 20/1489 dead transitions. [2025-04-13 20:40:45,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 1489 transitions, 30791 flow [2025-04-13 20:40:45,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2025-04-13 20:40:45,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.421875 [2025-04-13 20:40:45,321 INFO L175 Difference]: Start difference. First operand has 419 places, 1787 transitions, 34323 flow. Second operand 6 states and 81 transitions. [2025-04-13 20:40:45,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 1489 transitions, 30791 flow [2025-04-13 20:40:47,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 1489 transitions, 29365 flow, removed 395 selfloop flow, removed 15 redundant places. [2025-04-13 20:40:47,080 INFO L231 Difference]: Finished difference. Result has 392 places, 1365 transitions, 24564 flow [2025-04-13 20:40:47,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24631, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1374, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1340, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=24564, PETRI_PLACES=392, PETRI_TRANSITIONS=1365} [2025-04-13 20:40:47,081 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 361 predicate places. [2025-04-13 20:40:47,081 INFO L485 AbstractCegarLoop]: Abstraction has has 392 places, 1365 transitions, 24564 flow [2025-04-13 20:40:47,081 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:47,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:47,081 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:47,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 20:40:47,285 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,SelfDestructingSolverStorable23 [2025-04-13 20:40:47,286 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:47,286 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:47,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1430856016, now seen corresponding path program 1 times [2025-04-13 20:40:47,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:47,286 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868972539] [2025-04-13 20:40:47,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:47,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:47,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:47,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:47,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:47,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:47,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:47,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:47,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868972539] [2025-04-13 20:40:47,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868972539] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:47,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260407185] [2025-04-13 20:40:47,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:40:47,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:47,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:47,326 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 20:40:47,328 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 20:40:47,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 20:40:47,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 20:40:47,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:40:47,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:47,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 20:40:47,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:47,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:47,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:40:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260407185] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:47,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 20:40:47,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571853307] [2025-04-13 20:40:47,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:47,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:40:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:47,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:40:47,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:40:47,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:47,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 392 places, 1365 transitions, 24564 flow. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:47,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:47,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:47,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:48,984 INFO L116 PetriNetUnfolderBase]: 4493/6850 cut-off events. [2025-04-13 20:40:48,984 INFO L117 PetriNetUnfolderBase]: For 67694/67694 co-relation queries the response was YES. [2025-04-13 20:40:49,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60468 conditions, 6850 events. 4493/6850 cut-off events. For 67694/67694 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 39684 event pairs, 1230 based on Foata normal form. 216/6728 useless extension candidates. Maximal degree in co-relation 60343. Up to 6161 conditions per place. [2025-04-13 20:40:49,051 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1152 selfloop transitions, 3 changer transitions 144/1299 dead transitions. [2025-04-13 20:40:49,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 1299 transitions, 26010 flow [2025-04-13 20:40:49,051 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2025-04-13 20:40:49,052 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3697916666666667 [2025-04-13 20:40:49,052 INFO L175 Difference]: Start difference. First operand has 392 places, 1365 transitions, 24564 flow. Second operand 6 states and 71 transitions. [2025-04-13 20:40:49,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 1299 transitions, 26010 flow [2025-04-13 20:40:49,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 1299 transitions, 25670 flow, removed 63 selfloop flow, removed 14 redundant places. [2025-04-13 20:40:49,948 INFO L231 Difference]: Finished difference. Result has 381 places, 1155 transitions, 20512 flow [2025-04-13 20:40:49,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=22971, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20512, PETRI_PLACES=381, PETRI_TRANSITIONS=1155} [2025-04-13 20:40:49,949 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 350 predicate places. [2025-04-13 20:40:49,949 INFO L485 AbstractCegarLoop]: Abstraction has has 381 places, 1155 transitions, 20512 flow [2025-04-13 20:40:49,949 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:49,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:49,949 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:49,955 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 20:40:50,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-04-13 20:40:50,150 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:50,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:50,150 INFO L85 PathProgramCache]: Analyzing trace with hash -770963628, now seen corresponding path program 2 times [2025-04-13 20:40:50,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:50,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113063111] [2025-04-13 20:40:50,150 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:40:50,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:50,154 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:50,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-13 20:40:50,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 20:40:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:50,177 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:50,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:50,177 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113063111] [2025-04-13 20:40:50,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113063111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:50,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:50,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:40:50,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564775490] [2025-04-13 20:40:50,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:50,178 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:40:50,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:50,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:40:50,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:40:50,178 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:50,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 1155 transitions, 20512 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:50,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:50,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:50,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:51,482 INFO L116 PetriNetUnfolderBase]: 4361/6406 cut-off events. [2025-04-13 20:40:51,483 INFO L117 PetriNetUnfolderBase]: For 54841/54841 co-relation queries the response was YES. [2025-04-13 20:40:51,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56135 conditions, 6406 events. 4361/6406 cut-off events. For 54841/54841 co-relation queries the response was YES. Maximal size of possible extension queue 478. Compared 34393 event pairs, 330 based on Foata normal form. 10/6066 useless extension candidates. Maximal degree in co-relation 56019. Up to 4160 conditions per place. [2025-04-13 20:40:51,532 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 1213 selfloop transitions, 117 changer transitions 0/1330 dead transitions. [2025-04-13 20:40:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 1330 transitions, 25878 flow [2025-04-13 20:40:51,533 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 20:40:51,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-13 20:40:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2025-04-13 20:40:51,533 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5052083333333334 [2025-04-13 20:40:51,533 INFO L175 Difference]: Start difference. First operand has 381 places, 1155 transitions, 20512 flow. Second operand 6 states and 97 transitions. [2025-04-13 20:40:51,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 1330 transitions, 25878 flow [2025-04-13 20:40:52,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 1330 transitions, 25124 flow, removed 126 selfloop flow, removed 28 redundant places. [2025-04-13 20:40:52,141 INFO L231 Difference]: Finished difference. Result has 323 places, 1157 transitions, 20229 flow [2025-04-13 20:40:52,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=19791, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1036, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=20229, PETRI_PLACES=323, PETRI_TRANSITIONS=1157} [2025-04-13 20:40:52,142 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 292 predicate places. [2025-04-13 20:40:52,142 INFO L485 AbstractCegarLoop]: Abstraction has has 323 places, 1157 transitions, 20229 flow [2025-04-13 20:40:52,142 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:52,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:52,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:52,142 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-13 20:40:52,142 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:52,142 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:52,142 INFO L85 PathProgramCache]: Analyzing trace with hash 180811978, now seen corresponding path program 3 times [2025-04-13 20:40:52,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:52,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237360891] [2025-04-13 20:40:52,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:52,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:52,146 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:52,149 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:52,149 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:52,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:52,181 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:52,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:52,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237360891] [2025-04-13 20:40:52,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237360891] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:52,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415829536] [2025-04-13 20:40:52,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:40:52,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:52,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:52,184 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 20:40:52,184 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 20:40:52,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:52,233 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:52,233 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:40:52,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:52,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:40:52,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:52,274 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:40:52,274 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 20:40:52,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415829536] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:52,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:40:52,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 20:40:52,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819504797] [2025-04-13 20:40:52,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:52,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:40:52,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:52,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:40:52,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:40:52,314 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:52,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 1157 transitions, 20229 flow. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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 20:40:52,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:52,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:52,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:53,441 INFO L116 PetriNetUnfolderBase]: 4457/6565 cut-off events. [2025-04-13 20:40:53,441 INFO L117 PetriNetUnfolderBase]: For 62000/62000 co-relation queries the response was YES. [2025-04-13 20:40:53,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56802 conditions, 6565 events. 4457/6565 cut-off events. For 62000/62000 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 35458 event pairs, 473 based on Foata normal form. 41/6256 useless extension candidates. Maximal degree in co-relation 56702. Up to 4743 conditions per place. [2025-04-13 20:40:53,502 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1083 selfloop transitions, 199 changer transitions 0/1282 dead transitions. [2025-04-13 20:40:53,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 1282 transitions, 24889 flow [2025-04-13 20:40:53,502 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:40:53,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:40:53,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 78 transitions. [2025-04-13 20:40:53,502 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3482142857142857 [2025-04-13 20:40:53,502 INFO L175 Difference]: Start difference. First operand has 323 places, 1157 transitions, 20229 flow. Second operand 7 states and 78 transitions. [2025-04-13 20:40:53,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 1282 transitions, 24889 flow [2025-04-13 20:40:54,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 1282 transitions, 24716 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-04-13 20:40:54,262 INFO L231 Difference]: Finished difference. Result has 328 places, 1196 transitions, 21717 flow [2025-04-13 20:40:54,262 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=20053, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=160, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=958, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=21717, PETRI_PLACES=328, PETRI_TRANSITIONS=1196} [2025-04-13 20:40:54,263 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 297 predicate places. [2025-04-13 20:40:54,263 INFO L485 AbstractCegarLoop]: Abstraction has has 328 places, 1196 transitions, 21717 flow [2025-04-13 20:40:54,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 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 20:40:54,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:54,263 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:54,268 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 20:40:54,463 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,SelfDestructingSolverStorable26 [2025-04-13 20:40:54,464 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:54,464 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash -405978444, now seen corresponding path program 4 times [2025-04-13 20:40:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:54,464 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060372236] [2025-04-13 20:40:54,464 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:40:54,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:54,468 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:54,469 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 20:40:54,469 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 20:40:54,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:54,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:54,493 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060372236] [2025-04-13 20:40:54,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060372236] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 20:40:54,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 20:40:54,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 20:40:54,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585829326] [2025-04-13 20:40:54,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:40:54,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 20:40:54,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:54,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 20:40:54,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 20:40:54,493 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:54,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 1196 transitions, 21717 flow. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:54,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:54,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:54,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:55,921 INFO L116 PetriNetUnfolderBase]: 4919/7197 cut-off events. [2025-04-13 20:40:55,922 INFO L117 PetriNetUnfolderBase]: For 75964/75964 co-relation queries the response was YES. [2025-04-13 20:40:55,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64080 conditions, 7197 events. 4919/7197 cut-off events. For 75964/75964 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 39104 event pairs, 180 based on Foata normal form. 12/6945 useless extension candidates. Maximal degree in co-relation 63979. Up to 4245 conditions per place. [2025-04-13 20:40:55,996 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 1347 selfloop transitions, 246 changer transitions 0/1593 dead transitions. [2025-04-13 20:40:55,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 1593 transitions, 31375 flow [2025-04-13 20:40:55,996 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 20:40:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 20:40:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 133 transitions. [2025-04-13 20:40:55,996 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4618055555555556 [2025-04-13 20:40:55,996 INFO L175 Difference]: Start difference. First operand has 328 places, 1196 transitions, 21717 flow. Second operand 9 states and 133 transitions. [2025-04-13 20:40:55,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 1593 transitions, 31375 flow [2025-04-13 20:40:56,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 332 places, 1593 transitions, 31286 flow, removed 40 selfloop flow, removed 4 redundant places. [2025-04-13 20:40:56,974 INFO L231 Difference]: Finished difference. Result has 338 places, 1287 transitions, 24328 flow [2025-04-13 20:40:56,975 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=21684, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=163, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=24328, PETRI_PLACES=338, PETRI_TRANSITIONS=1287} [2025-04-13 20:40:56,975 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 307 predicate places. [2025-04-13 20:40:56,975 INFO L485 AbstractCegarLoop]: Abstraction has has 338 places, 1287 transitions, 24328 flow [2025-04-13 20:40:56,976 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:56,976 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:56,976 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:56,976 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-13 20:40:56,976 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:56,976 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:56,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1806899670, now seen corresponding path program 5 times [2025-04-13 20:40:56,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:56,976 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91635332] [2025-04-13 20:40:56,976 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:56,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:56,981 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:56,983 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:56,983 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:56,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:57,016 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:40:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:57,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91635332] [2025-04-13 20:40:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91635332] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:57,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1293594955] [2025-04-13 20:40:57,016 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:40:57,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:57,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:57,018 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 20:40:57,019 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 20:40:57,065 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:57,079 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:57,079 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:40:57,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:57,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 20:40:57,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:40:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:57,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:40:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:57,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1293594955] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:40:57,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:40:57,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-04-13 20:40:57,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813802625] [2025-04-13 20:40:57,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:40:57,144 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 20:40:57,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:40:57,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 20:40:57,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-04-13 20:40:57,145 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:40:57,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 1287 transitions, 24328 flow. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:57,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:40:57,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:40:57,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:40:58,690 INFO L116 PetriNetUnfolderBase]: 4853/7095 cut-off events. [2025-04-13 20:40:58,690 INFO L117 PetriNetUnfolderBase]: For 93870/93870 co-relation queries the response was YES. [2025-04-13 20:40:58,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65342 conditions, 7095 events. 4853/7095 cut-off events. For 93870/93870 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 38439 event pairs, 407 based on Foata normal form. 70/6993 useless extension candidates. Maximal degree in co-relation 65236. Up to 4221 conditions per place. [2025-04-13 20:40:58,744 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 1351 selfloop transitions, 129 changer transitions 0/1480 dead transitions. [2025-04-13 20:40:58,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 1480 transitions, 30519 flow [2025-04-13 20:40:58,745 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 20:40:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-13 20:40:58,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2025-04-13 20:40:58,745 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3153409090909091 [2025-04-13 20:40:58,745 INFO L175 Difference]: Start difference. First operand has 338 places, 1287 transitions, 24328 flow. Second operand 11 states and 111 transitions. [2025-04-13 20:40:58,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 1480 transitions, 30519 flow [2025-04-13 20:40:59,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 1480 transitions, 30083 flow, removed 126 selfloop flow, removed 3 redundant places. [2025-04-13 20:40:59,647 INFO L231 Difference]: Finished difference. Result has 344 places, 1265 transitions, 23979 flow [2025-04-13 20:40:59,648 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23273, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=116, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=23979, PETRI_PLACES=344, PETRI_TRANSITIONS=1265} [2025-04-13 20:40:59,648 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 313 predicate places. [2025-04-13 20:40:59,648 INFO L485 AbstractCegarLoop]: Abstraction has has 344 places, 1265 transitions, 23979 flow [2025-04-13 20:40:59,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:40:59,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:40:59,649 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:40:59,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 20:40:59,849 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,SelfDestructingSolverStorable28 [2025-04-13 20:40:59,849 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:40:59,850 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:40:59,850 INFO L85 PathProgramCache]: Analyzing trace with hash -547528286, now seen corresponding path program 6 times [2025-04-13 20:40:59,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:40:59,850 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576160363] [2025-04-13 20:40:59,850 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:40:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:40:59,854 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:59,861 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:59,861 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:40:59,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:59,895 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:40:59,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:40:59,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576160363] [2025-04-13 20:40:59,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576160363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:40:59,895 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699630754] [2025-04-13 20:40:59,895 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:40:59,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:40:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:40:59,897 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 20:40:59,899 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 20:40:59,939 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 20:40:59,956 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 20:40:59,957 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:40:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:40:59,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 20:40:59,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:00,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:00,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:00,073 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 20:41:00,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699630754] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:00,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 20:41:00,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 14 [2025-04-13 20:41:00,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598177032] [2025-04-13 20:41:00,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 20:41:00,073 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 20:41:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:00,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 20:41:00,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2025-04-13 20:41:00,074 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:00,074 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 1265 transitions, 23979 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:00,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:00,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:00,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:01,615 INFO L116 PetriNetUnfolderBase]: 5071/7355 cut-off events. [2025-04-13 20:41:01,615 INFO L117 PetriNetUnfolderBase]: For 100737/100737 co-relation queries the response was YES. [2025-04-13 20:41:01,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67204 conditions, 7355 events. 5071/7355 cut-off events. For 100737/100737 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 39001 event pairs, 520 based on Foata normal form. 114/7245 useless extension candidates. Maximal degree in co-relation 67095. Up to 4451 conditions per place. [2025-04-13 20:41:01,699 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 1075 selfloop transitions, 287 changer transitions 0/1362 dead transitions. [2025-04-13 20:41:01,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 1362 transitions, 28322 flow [2025-04-13 20:41:01,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 20:41:01,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-13 20:41:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 79 transitions. [2025-04-13 20:41:01,700 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35267857142857145 [2025-04-13 20:41:01,700 INFO L175 Difference]: Start difference. First operand has 344 places, 1265 transitions, 23979 flow. Second operand 7 states and 79 transitions. [2025-04-13 20:41:01,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 1362 transitions, 28322 flow [2025-04-13 20:41:02,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 1362 transitions, 28253 flow, removed 31 selfloop flow, removed 8 redundant places. [2025-04-13 20:41:02,808 INFO L231 Difference]: Finished difference. Result has 336 places, 1238 transitions, 24860 flow [2025-04-13 20:41:02,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=23213, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=267, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=24860, PETRI_PLACES=336, PETRI_TRANSITIONS=1238} [2025-04-13 20:41:02,809 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 305 predicate places. [2025-04-13 20:41:02,809 INFO L485 AbstractCegarLoop]: Abstraction has has 336 places, 1238 transitions, 24860 flow [2025-04-13 20:41:02,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 7 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:02,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:02,810 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:02,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 20:41:03,014 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:03,014 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:03,014 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -958099991, now seen corresponding path program 1 times [2025-04-13 20:41:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:03,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089992290] [2025-04-13 20:41:03,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:03,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:03,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:03,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:03,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:03,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:03,680 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 20:41:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:03,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089992290] [2025-04-13 20:41:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089992290] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:03,680 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1943350347] [2025-04-13 20:41:03,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:41:03,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:03,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:03,682 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:03,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 20:41:03,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:41:03,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:03,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:41:03,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:03,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:41:03,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:03,780 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 20:41:04,269 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:04,269 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 77 [2025-04-13 20:41:04,333 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 20:41:04,333 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:05,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:41:05,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:05,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-13 20:41:05,818 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2025-04-13 20:41:05,823 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:05,823 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2025-04-13 20:41:05,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:05,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1943350347] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:05,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:05,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 36 [2025-04-13 20:41:05,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362089541] [2025-04-13 20:41:05,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:05,988 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:41:05,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:05,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:41:05,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1253, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:41:05,989 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:05,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 336 places, 1238 transitions, 24860 flow. Second operand has 38 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 38 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:05,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:05,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:05,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:10,884 INFO L116 PetriNetUnfolderBase]: 6154/8992 cut-off events. [2025-04-13 20:41:10,884 INFO L117 PetriNetUnfolderBase]: For 133618/133618 co-relation queries the response was YES. [2025-04-13 20:41:10,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82398 conditions, 8992 events. 6154/8992 cut-off events. For 133618/133618 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 49865 event pairs, 305 based on Foata normal form. 4/8809 useless extension candidates. Maximal degree in co-relation 82290. Up to 7334 conditions per place. [2025-04-13 20:41:10,977 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1170 selfloop transitions, 464 changer transitions 11/1645 dead transitions. [2025-04-13 20:41:10,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 375 places, 1645 transitions, 33726 flow [2025-04-13 20:41:10,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 20:41:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2025-04-13 20:41:10,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 400 transitions. [2025-04-13 20:41:10,979 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:41:10,979 INFO L175 Difference]: Start difference. First operand has 336 places, 1238 transitions, 24860 flow. Second operand 40 states and 400 transitions. [2025-04-13 20:41:10,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 375 places, 1645 transitions, 33726 flow [2025-04-13 20:41:12,503 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 1645 transitions, 33613 flow, removed 47 selfloop flow, removed 5 redundant places. [2025-04-13 20:41:12,523 INFO L231 Difference]: Finished difference. Result has 385 places, 1456 transitions, 29843 flow [2025-04-13 20:41:12,524 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=24805, PETRI_DIFFERENCE_MINUEND_PLACES=331, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=299, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=890, PETRI_DIFFERENCE_SUBTRAHEND_STATES=40, PETRI_FLOW=29843, PETRI_PLACES=385, PETRI_TRANSITIONS=1456} [2025-04-13 20:41:12,524 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 354 predicate places. [2025-04-13 20:41:12,524 INFO L485 AbstractCegarLoop]: Abstraction has has 385 places, 1456 transitions, 29843 flow [2025-04-13 20:41:12,524 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.7894736842105265) internal successors, (182), 38 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:12,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:12,525 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:12,530 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 20:41:12,725 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-13 20:41:12,725 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:12,726 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:12,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1804761133, now seen corresponding path program 2 times [2025-04-13 20:41:12,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:12,726 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184732567] [2025-04-13 20:41:12,726 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:12,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:12,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:12,736 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:12,736 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:13,237 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:13,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:13,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184732567] [2025-04-13 20:41:13,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1184732567] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:13,238 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397199124] [2025-04-13 20:41:13,238 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:41:13,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:13,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:13,240 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:13,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 20:41:13,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:13,290 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:13,291 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:13,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:13,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:41:13,292 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:13,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:13,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:13,703 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:13,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 185 treesize of output 89 [2025-04-13 20:41:13,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:13,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:14,524 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:14,525 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-13 20:41:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:14,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397199124] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:14,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:14,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 30 [2025-04-13 20:41:14,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185607096] [2025-04-13 20:41:14,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:14,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 20:41:14,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:14,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 20:41:14,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-04-13 20:41:14,719 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:14,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 1456 transitions, 29843 flow. Second operand has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:14,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:14,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:14,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:19,766 INFO L116 PetriNetUnfolderBase]: 7584/11105 cut-off events. [2025-04-13 20:41:19,767 INFO L117 PetriNetUnfolderBase]: For 190970/190970 co-relation queries the response was YES. [2025-04-13 20:41:19,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104938 conditions, 11105 events. 7584/11105 cut-off events. For 190970/190970 co-relation queries the response was YES. Maximal size of possible extension queue 691. Compared 63901 event pairs, 357 based on Foata normal form. 3/10834 useless extension candidates. Maximal degree in co-relation 104817. Up to 7827 conditions per place. [2025-04-13 20:41:19,878 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1208 selfloop transitions, 722 changer transitions 13/1943 dead transitions. [2025-04-13 20:41:19,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 1943 transitions, 40851 flow [2025-04-13 20:41:19,879 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 20:41:19,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2025-04-13 20:41:19,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 477 transitions. [2025-04-13 20:41:19,880 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.310546875 [2025-04-13 20:41:19,880 INFO L175 Difference]: Start difference. First operand has 385 places, 1456 transitions, 29843 flow. Second operand 48 states and 477 transitions. [2025-04-13 20:41:19,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 1943 transitions, 40851 flow [2025-04-13 20:41:22,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 1943 transitions, 39240 flow, removed 642 selfloop flow, removed 8 redundant places. [2025-04-13 20:41:22,135 INFO L231 Difference]: Finished difference. Result has 436 places, 1686 transitions, 34286 flow [2025-04-13 20:41:22,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=28451, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=527, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=831, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=34286, PETRI_PLACES=436, PETRI_TRANSITIONS=1686} [2025-04-13 20:41:22,136 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 405 predicate places. [2025-04-13 20:41:22,137 INFO L485 AbstractCegarLoop]: Abstraction has has 436 places, 1686 transitions, 34286 flow [2025-04-13 20:41:22,137 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 4.78125) internal successors, (153), 32 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:22,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:22,137 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:22,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 20:41:22,337 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:22,337 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:22,338 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1909963041, now seen corresponding path program 3 times [2025-04-13 20:41:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:22,338 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314278197] [2025-04-13 20:41:22,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:22,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:22,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:22,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:22,348 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:41:22,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:22,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:22,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314278197] [2025-04-13 20:41:22,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314278197] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:22,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449096776] [2025-04-13 20:41:22,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:41:22,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:22,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:22,853 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:22,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 20:41:22,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:22,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:22,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:41:22,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:22,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:41:22,909 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:23,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:23,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:41:23,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:23,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 166 treesize of output 82 [2025-04-13 20:41:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:23,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:24,037 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:24,038 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-13 20:41:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:24,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449096776] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:24,209 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:24,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 29 [2025-04-13 20:41:24,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889689885] [2025-04-13 20:41:24,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:24,209 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:41:24,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:24,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:41:24,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:41:24,210 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:24,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 1686 transitions, 34286 flow. Second operand has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:24,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:24,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:24,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:31,136 INFO L116 PetriNetUnfolderBase]: 8288/12304 cut-off events. [2025-04-13 20:41:31,136 INFO L117 PetriNetUnfolderBase]: For 225698/225698 co-relation queries the response was YES. [2025-04-13 20:41:31,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119404 conditions, 12304 events. 8288/12304 cut-off events. For 225698/225698 co-relation queries the response was YES. Maximal size of possible extension queue 772. Compared 73743 event pairs, 317 based on Foata normal form. 3/12021 useless extension candidates. Maximal degree in co-relation 119270. Up to 8253 conditions per place. [2025-04-13 20:41:31,265 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1202 selfloop transitions, 994 changer transitions 15/2211 dead transitions. [2025-04-13 20:41:31,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 2211 transitions, 47053 flow [2025-04-13 20:41:31,265 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:41:31,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:41:31,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 612 transitions. [2025-04-13 20:41:31,267 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31875 [2025-04-13 20:41:31,267 INFO L175 Difference]: Start difference. First operand has 436 places, 1686 transitions, 34286 flow. Second operand 60 states and 612 transitions. [2025-04-13 20:41:31,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 2211 transitions, 47053 flow [2025-04-13 20:41:34,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 484 places, 2211 transitions, 45784 flow, removed 530 selfloop flow, removed 9 redundant places. [2025-04-13 20:41:34,356 INFO L231 Difference]: Finished difference. Result has 507 places, 1948 transitions, 41513 flow [2025-04-13 20:41:34,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=33206, PETRI_DIFFERENCE_MINUEND_PLACES=425, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=779, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=859, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=41513, PETRI_PLACES=507, PETRI_TRANSITIONS=1948} [2025-04-13 20:41:34,357 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 476 predicate places. [2025-04-13 20:41:34,357 INFO L485 AbstractCegarLoop]: Abstraction has has 507 places, 1948 transitions, 41513 flow [2025-04-13 20:41:34,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.806451612903226) internal successors, (149), 31 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:34,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:34,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:34,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 20:41:34,558 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:34,558 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:34,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:34,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1431714387, now seen corresponding path program 4 times [2025-04-13 20:41:34,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:34,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721134182] [2025-04-13 20:41:34,559 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:34,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:34,568 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:34,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:34,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:34,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:35,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:35,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:35,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721134182] [2025-04-13 20:41:35,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721134182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:35,067 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084076354] [2025-04-13 20:41:35,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:41:35,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:35,069 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:35,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 20:41:35,108 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:35,121 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:35,121 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:41:35,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:35,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:41:35,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:35,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:35,618 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 20:41:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:41:35,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:36,245 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:36,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 109 [2025-04-13 20:41:36,448 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:36,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084076354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:36,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:36,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2025-04-13 20:41:36,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968361320] [2025-04-13 20:41:36,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:36,449 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:41:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:36,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:41:36,450 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=927, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:41:36,450 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:36,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 507 places, 1948 transitions, 41513 flow. Second operand has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:36,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:36,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:36,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:42,308 INFO L116 PetriNetUnfolderBase]: 8821/13097 cut-off events. [2025-04-13 20:41:42,308 INFO L117 PetriNetUnfolderBase]: For 264546/264546 co-relation queries the response was YES. [2025-04-13 20:41:42,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131195 conditions, 13097 events. 8821/13097 cut-off events. For 264546/264546 co-relation queries the response was YES. Maximal size of possible extension queue 810. Compared 79102 event pairs, 491 based on Foata normal form. 2/12799 useless extension candidates. Maximal degree in co-relation 131040. Up to 11348 conditions per place. [2025-04-13 20:41:42,463 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1661 selfloop transitions, 502 changer transitions 6/2169 dead transitions. [2025-04-13 20:41:42,463 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 2169 transitions, 48351 flow [2025-04-13 20:41:42,464 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 20:41:42,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2025-04-13 20:41:42,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 361 transitions. [2025-04-13 20:41:42,465 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3223214285714286 [2025-04-13 20:41:42,465 INFO L175 Difference]: Start difference. First operand has 507 places, 1948 transitions, 41513 flow. Second operand 35 states and 361 transitions. [2025-04-13 20:41:42,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 2169 transitions, 48351 flow [2025-04-13 20:41:46,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 2169 transitions, 46241 flow, removed 773 selfloop flow, removed 20 redundant places. [2025-04-13 20:41:46,614 INFO L231 Difference]: Finished difference. Result has 531 places, 2029 transitions, 42199 flow [2025-04-13 20:41:46,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=39670, PETRI_DIFFERENCE_MINUEND_PLACES=484, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=432, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=35, PETRI_FLOW=42199, PETRI_PLACES=531, PETRI_TRANSITIONS=2029} [2025-04-13 20:41:46,616 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 500 predicate places. [2025-04-13 20:41:46,616 INFO L485 AbstractCegarLoop]: Abstraction has has 531 places, 2029 transitions, 42199 flow [2025-04-13 20:41:46,616 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:46,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:41:46,616 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:41:46,624 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 20:41:46,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 20:41:46,817 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:41:46,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:41:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash -187769697, now seen corresponding path program 5 times [2025-04-13 20:41:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:41:46,818 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70765934] [2025-04-13 20:41:46,818 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:41:46,823 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:46,830 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:46,830 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:46,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:47,607 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:41:47,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:41:47,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70765934] [2025-04-13 20:41:47,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70765934] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:41:47,607 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283567588] [2025-04-13 20:41:47,607 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:41:47,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:41:47,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:41:47,609 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:41:47,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 20:41:47,656 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:41:47,670 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:41:47,670 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:41:47,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:41:47,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:41:47,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:41:48,093 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:41:48,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 20:41:48,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:48,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:41:48,731 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:41:48,731 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 159 [2025-04-13 20:41:49,353 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:41:49,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283567588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:41:49,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:41:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 20:41:49,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97800499] [2025-04-13 20:41:49,354 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:41:49,354 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:41:49,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:41:49,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:41:49,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1009, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:41:49,355 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:41:49,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 2029 transitions, 42199 flow. Second operand has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:41:49,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:41:49,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:41:49,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:41:56,677 INFO L116 PetriNetUnfolderBase]: 9457/14019 cut-off events. [2025-04-13 20:41:56,678 INFO L117 PetriNetUnfolderBase]: For 285473/285473 co-relation queries the response was YES. [2025-04-13 20:41:56,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141503 conditions, 14019 events. 9457/14019 cut-off events. For 285473/285473 co-relation queries the response was YES. Maximal size of possible extension queue 849. Compared 85403 event pairs, 444 based on Foata normal form. 1/13667 useless extension candidates. Maximal degree in co-relation 141338. Up to 10912 conditions per place. [2025-04-13 20:41:56,856 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1586 selfloop transitions, 786 changer transitions 5/2377 dead transitions. [2025-04-13 20:41:56,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 2377 transitions, 52523 flow [2025-04-13 20:41:56,857 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 20:41:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-04-13 20:41:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 445 transitions. [2025-04-13 20:41:56,862 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3234011627906977 [2025-04-13 20:41:56,862 INFO L175 Difference]: Start difference. First operand has 531 places, 2029 transitions, 42199 flow. Second operand 43 states and 445 transitions. [2025-04-13 20:41:56,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 2377 transitions, 52523 flow [2025-04-13 20:42:00,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 563 places, 2377 transitions, 51667 flow, removed 295 selfloop flow, removed 10 redundant places. [2025-04-13 20:42:00,981 INFO L231 Difference]: Finished difference. Result has 574 places, 2160 transitions, 46140 flow [2025-04-13 20:42:00,982 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=41368, PETRI_DIFFERENCE_MINUEND_PLACES=521, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=673, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=46140, PETRI_PLACES=574, PETRI_TRANSITIONS=2160} [2025-04-13 20:42:00,983 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 543 predicate places. [2025-04-13 20:42:00,983 INFO L485 AbstractCegarLoop]: Abstraction has has 574 places, 2160 transitions, 46140 flow [2025-04-13 20:42:00,983 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.0588235294117645) internal successors, (172), 34 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:00,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:00,983 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:00,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 20:42:01,183 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:01,184 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:01,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:01,185 INFO L85 PathProgramCache]: Analyzing trace with hash 597873487, now seen corresponding path program 6 times [2025-04-13 20:42:01,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:01,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510516046] [2025-04-13 20:42:01,185 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:01,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:01,189 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:01,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:01,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:01,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:01,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:01,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510516046] [2025-04-13 20:42:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510516046] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:01,792 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983967370] [2025-04-13 20:42:01,793 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:42:01,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:01,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:01,794 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:01,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 20:42:01,836 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:42:01,850 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:01,850 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:42:01,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:01,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:42:01,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:02,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:02,318 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:02,321 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:02,321 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 87 [2025-04-13 20:42:02,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:02,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:03,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:03,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:42:03,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:42:03,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983967370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:03,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:03,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 20:42:03,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908248715] [2025-04-13 20:42:03,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:03,373 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:42:03,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:03,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:42:03,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:42:03,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:03,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 2160 transitions, 46140 flow. Second operand has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:03,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:03,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:03,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:10,918 INFO L116 PetriNetUnfolderBase]: 10159/15020 cut-off events. [2025-04-13 20:42:10,918 INFO L117 PetriNetUnfolderBase]: For 318057/318057 co-relation queries the response was YES. [2025-04-13 20:42:11,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155719 conditions, 15020 events. 10159/15020 cut-off events. For 318057/318057 co-relation queries the response was YES. Maximal size of possible extension queue 888. Compared 91878 event pairs, 356 based on Foata normal form. 2/14590 useless extension candidates. Maximal degree in co-relation 155545. Up to 10845 conditions per place. [2025-04-13 20:42:11,123 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 1555 selfloop transitions, 1002 changer transitions 9/2566 dead transitions. [2025-04-13 20:42:11,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 2566 transitions, 58140 flow [2025-04-13 20:42:11,124 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:42:11,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:42:11,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 478 transitions. [2025-04-13 20:42:11,128 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32472826086956524 [2025-04-13 20:42:11,128 INFO L175 Difference]: Start difference. First operand has 574 places, 2160 transitions, 46140 flow. Second operand 46 states and 478 transitions. [2025-04-13 20:42:11,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 2566 transitions, 58140 flow [2025-04-13 20:42:15,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 2566 transitions, 56658 flow, removed 392 selfloop flow, removed 16 redundant places. [2025-04-13 20:42:15,911 INFO L231 Difference]: Finished difference. Result has 612 places, 2341 transitions, 51914 flow [2025-04-13 20:42:15,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=44809, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=828, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=51914, PETRI_PLACES=612, PETRI_TRANSITIONS=2341} [2025-04-13 20:42:15,913 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 581 predicate places. [2025-04-13 20:42:15,913 INFO L485 AbstractCegarLoop]: Abstraction has has 612 places, 2341 transitions, 51914 flow [2025-04-13 20:42:15,914 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 4.705882352941177) internal successors, (160), 34 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:15,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:15,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:15,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-04-13 20:42:16,114 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:16,114 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:16,115 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:16,115 INFO L85 PathProgramCache]: Analyzing trace with hash -997800787, now seen corresponding path program 7 times [2025-04-13 20:42:16,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:16,115 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779941676] [2025-04-13 20:42:16,115 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:16,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:16,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:16,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:16,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:16,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:16,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:16,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779941676] [2025-04-13 20:42:16,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779941676] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:16,726 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971940786] [2025-04-13 20:42:16,726 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:42:16,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:16,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:16,728 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:16,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 20:42:16,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:16,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:16,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:16,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:16,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-13 20:42:16,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:16,821 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 20:42:17,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:42:17,147 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:17,147 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 85 [2025-04-13 20:42:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:17,337 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:18,628 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:42:18,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:18,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-13 20:42:18,705 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 260 treesize of output 228 [2025-04-13 20:42:18,710 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:18,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 345 treesize of output 283 [2025-04-13 20:42:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:18,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971940786] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:18,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:18,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 34 [2025-04-13 20:42:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049673172] [2025-04-13 20:42:18,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:18,877 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:42:18,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:18,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:42:18,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1109, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:42:18,878 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:18,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 2341 transitions, 51914 flow. Second operand has 36 states, 36 states have (on average 4.75) internal successors, (171), 36 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:18,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:18,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:18,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:30,480 INFO L116 PetriNetUnfolderBase]: 11455/16847 cut-off events. [2025-04-13 20:42:30,481 INFO L117 PetriNetUnfolderBase]: For 374663/374663 co-relation queries the response was YES. [2025-04-13 20:42:30,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181315 conditions, 16847 events. 11455/16847 cut-off events. For 374663/374663 co-relation queries the response was YES. Maximal size of possible extension queue 978. Compared 103568 event pairs, 433 based on Foata normal form. 2/16263 useless extension candidates. Maximal degree in co-relation 181132. Up to 12801 conditions per place. [2025-04-13 20:42:30,684 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1819 selfloop transitions, 1027 changer transitions 5/2851 dead transitions. [2025-04-13 20:42:30,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 2851 transitions, 66386 flow [2025-04-13 20:42:30,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2025-04-13 20:42:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2025-04-13 20:42:30,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 611 transitions. [2025-04-13 20:42:30,686 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3182291666666667 [2025-04-13 20:42:30,686 INFO L175 Difference]: Start difference. First operand has 612 places, 2341 transitions, 51914 flow. Second operand 60 states and 611 transitions. [2025-04-13 20:42:30,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 2851 transitions, 66386 flow [2025-04-13 20:42:37,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 2851 transitions, 64465 flow, removed 648 selfloop flow, removed 14 redundant places. [2025-04-13 20:42:37,149 INFO L231 Difference]: Finished difference. Result has 680 places, 2656 transitions, 59741 flow [2025-04-13 20:42:37,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=50147, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=762, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1467, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=59741, PETRI_PLACES=680, PETRI_TRANSITIONS=2656} [2025-04-13 20:42:37,151 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 649 predicate places. [2025-04-13 20:42:37,151 INFO L485 AbstractCegarLoop]: Abstraction has has 680 places, 2656 transitions, 59741 flow [2025-04-13 20:42:37,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.75) internal successors, (171), 36 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:37,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:42:37,151 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:42:37,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 20:42:37,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:37,352 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:42:37,353 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:42:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 2034870863, now seen corresponding path program 1 times [2025-04-13 20:42:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:42:37,353 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399735047] [2025-04-13 20:42:37,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:37,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:42:37,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:37,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:37,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:37,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:38,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:38,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:42:38,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399735047] [2025-04-13 20:42:38,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399735047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:42:38,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592554525] [2025-04-13 20:42:38,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 20:42:38,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:42:38,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:42:38,086 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:42:38,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 20:42:38,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:42:38,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:42:38,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:42:38,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:42:38,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:42:38,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:42:38,176 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 19 treesize of output 1 [2025-04-13 20:42:38,639 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:38,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 77 [2025-04-13 20:42:38,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:42:38,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:42:41,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:42:41,068 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:41,068 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-13 20:42:41,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2025-04-13 20:42:41,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:42:41,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2025-04-13 20:42:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:42:41,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592554525] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:42:41,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:42:41,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 11] total 37 [2025-04-13 20:42:41,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234734623] [2025-04-13 20:42:41,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:42:41,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:42:41,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:42:41,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:42:41,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1331, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:42:41,298 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:42:41,298 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 2656 transitions, 59741 flow. Second operand has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:42:41,299 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:42:41,299 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:42:41,299 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:42:53,237 INFO L116 PetriNetUnfolderBase]: 11758/17311 cut-off events. [2025-04-13 20:42:53,237 INFO L117 PetriNetUnfolderBase]: For 427036/427036 co-relation queries the response was YES. [2025-04-13 20:42:53,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193838 conditions, 17311 events. 11758/17311 cut-off events. For 427036/427036 co-relation queries the response was YES. Maximal size of possible extension queue 1003. Compared 107087 event pairs, 623 based on Foata normal form. 1/16776 useless extension candidates. Maximal degree in co-relation 193632. Up to 14286 conditions per place. [2025-04-13 20:42:53,685 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 2027 selfloop transitions, 876 changer transitions 2/2905 dead transitions. [2025-04-13 20:42:53,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 2905 transitions, 69451 flow [2025-04-13 20:42:53,685 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 20:42:53,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-13 20:42:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 444 transitions. [2025-04-13 20:42:53,686 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3016304347826087 [2025-04-13 20:42:53,686 INFO L175 Difference]: Start difference. First operand has 680 places, 2656 transitions, 59741 flow. Second operand 46 states and 444 transitions. [2025-04-13 20:42:53,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 2905 transitions, 69451 flow [2025-04-13 20:43:01,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 2905 transitions, 66351 flow, removed 1242 selfloop flow, removed 14 redundant places. [2025-04-13 20:43:01,354 INFO L231 Difference]: Finished difference. Result has 722 places, 2743 transitions, 60948 flow [2025-04-13 20:43:01,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=56655, PETRI_DIFFERENCE_MINUEND_PLACES=666, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=797, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1843, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=60948, PETRI_PLACES=722, PETRI_TRANSITIONS=2743} [2025-04-13 20:43:01,356 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 691 predicate places. [2025-04-13 20:43:01,356 INFO L485 AbstractCegarLoop]: Abstraction has has 722 places, 2743 transitions, 60948 flow [2025-04-13 20:43:01,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.871794871794871) internal successors, (190), 39 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:01,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:01,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:01,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-04-13 20:43:01,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-04-13 20:43:01,557 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:01,559 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:01,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1805355779, now seen corresponding path program 8 times [2025-04-13 20:43:01,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:01,559 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320366914] [2025-04-13 20:43:01,559 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:01,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:01,563 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:01,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:01,570 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:01,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:02,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320366914] [2025-04-13 20:43:02,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320366914] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:02,014 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112154270] [2025-04-13 20:43:02,014 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:02,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:02,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:02,016 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:43:02,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 20:43:02,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:02,072 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:02,072 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:02,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:02,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:43:02,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:02,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:43:02,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:43:02,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:02,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 87 [2025-04-13 20:43:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:43:02,741 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:03,320 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:03,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:43:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:03,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112154270] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:03,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:03,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 20:43:03,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419886125] [2025-04-13 20:43:03,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:03,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:43:03,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:03,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:43:03,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:43:03,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:03,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 2743 transitions, 60948 flow. Second operand has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:03,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:03,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:03,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:13,293 INFO L116 PetriNetUnfolderBase]: 11853/17494 cut-off events. [2025-04-13 20:43:13,293 INFO L117 PetriNetUnfolderBase]: For 432567/432567 co-relation queries the response was YES. [2025-04-13 20:43:13,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 193864 conditions, 17494 events. 11853/17494 cut-off events. For 432567/432567 co-relation queries the response was YES. Maximal size of possible extension queue 1004. Compared 108860 event pairs, 483 based on Foata normal form. 3/16949 useless extension candidates. Maximal degree in co-relation 193646. Up to 13408 conditions per place. [2025-04-13 20:43:13,579 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 1971 selfloop transitions, 991 changer transitions 13/2975 dead transitions. [2025-04-13 20:43:13,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 765 places, 2975 transitions, 69846 flow [2025-04-13 20:43:13,580 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 20:43:13,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-13 20:43:13,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 439 transitions. [2025-04-13 20:43:13,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3117897727272727 [2025-04-13 20:43:13,581 INFO L175 Difference]: Start difference. First operand has 722 places, 2743 transitions, 60948 flow. Second operand 44 states and 439 transitions. [2025-04-13 20:43:13,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 765 places, 2975 transitions, 69846 flow [2025-04-13 20:43:21,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 755 places, 2975 transitions, 68446 flow, removed 597 selfloop flow, removed 10 redundant places. [2025-04-13 20:43:21,263 INFO L231 Difference]: Finished difference. Result has 757 places, 2779 transitions, 62460 flow [2025-04-13 20:43:21,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=59555, PETRI_DIFFERENCE_MINUEND_PLACES=712, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2743, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=959, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1779, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=62460, PETRI_PLACES=757, PETRI_TRANSITIONS=2779} [2025-04-13 20:43:21,265 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 726 predicate places. [2025-04-13 20:43:21,265 INFO L485 AbstractCegarLoop]: Abstraction has has 757 places, 2779 transitions, 62460 flow [2025-04-13 20:43:21,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.714285714285714) internal successors, (165), 35 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:21,265 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:21,265 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:21,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 20:43:21,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-04-13 20:43:21,466 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:21,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:21,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1731406829, now seen corresponding path program 9 times [2025-04-13 20:43:21,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:21,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161327106] [2025-04-13 20:43:21,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:21,474 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:21,484 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:21,484 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:22,339 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:43:22,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:22,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161327106] [2025-04-13 20:43:22,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161327106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:22,339 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718687556] [2025-04-13 20:43:22,339 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:43:22,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:22,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:22,341 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:43:22,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 20:43:22,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:22,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:22,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:43:22,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:22,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:43:22,403 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:23,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:43:23,107 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:23,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 20:43:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:23,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:24,013 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:24,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:43:24,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:24,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718687556] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:24,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:24,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 20:43:24,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756240008] [2025-04-13 20:43:24,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:24,333 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:43:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:24,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:43:24,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=1101, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:43:24,334 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:24,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 757 places, 2779 transitions, 62460 flow. Second operand has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:24,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:24,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:24,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:34,085 INFO L116 PetriNetUnfolderBase]: 11854/17492 cut-off events. [2025-04-13 20:43:34,086 INFO L117 PetriNetUnfolderBase]: For 441764/441764 co-relation queries the response was YES. [2025-04-13 20:43:34,387 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194978 conditions, 17492 events. 11854/17492 cut-off events. For 441764/441764 co-relation queries the response was YES. Maximal size of possible extension queue 1002. Compared 108802 event pairs, 462 based on Foata normal form. 2/16941 useless extension candidates. Maximal degree in co-relation 194757. Up to 13425 conditions per place. [2025-04-13 20:43:34,470 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1967 selfloop transitions, 981 changer transitions 8/2956 dead transitions. [2025-04-13 20:43:34,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 791 places, 2956 transitions, 70464 flow [2025-04-13 20:43:34,470 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-04-13 20:43:34,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2025-04-13 20:43:34,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2025-04-13 20:43:34,471 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3158783783783784 [2025-04-13 20:43:34,471 INFO L175 Difference]: Start difference. First operand has 757 places, 2779 transitions, 62460 flow. Second operand 37 states and 374 transitions. [2025-04-13 20:43:34,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 791 places, 2956 transitions, 70464 flow [2025-04-13 20:43:42,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 780 places, 2956 transitions, 69217 flow, removed 318 selfloop flow, removed 11 redundant places. [2025-04-13 20:43:42,104 INFO L231 Difference]: Finished difference. Result has 781 places, 2781 transitions, 63346 flow [2025-04-13 20:43:42,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=61322, PETRI_DIFFERENCE_MINUEND_PLACES=744, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2778, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=978, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1799, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=63346, PETRI_PLACES=781, PETRI_TRANSITIONS=2781} [2025-04-13 20:43:42,106 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 750 predicate places. [2025-04-13 20:43:42,106 INFO L485 AbstractCegarLoop]: Abstraction has has 781 places, 2781 transitions, 63346 flow [2025-04-13 20:43:42,106 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:42,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:43:42,106 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:43:42,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 20:43:42,307 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 20:43:42,307 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:43:42,308 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:43:42,308 INFO L85 PathProgramCache]: Analyzing trace with hash -847913891, now seen corresponding path program 2 times [2025-04-13 20:43:42,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:43:42,308 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249064389] [2025-04-13 20:43:42,308 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:42,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:43:42,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:42,473 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:42,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:42,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:43:43,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:43:43,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249064389] [2025-04-13 20:43:43,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249064389] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:43:43,008 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373494993] [2025-04-13 20:43:43,008 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:43:43,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:43:43,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:43:43,010 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:43:43,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 20:43:43,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:43:43,075 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:43:43,075 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:43:43,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:43:43,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:43:43,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:43:43,116 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 20:43:43,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:43:43,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:43,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 85 [2025-04-13 20:43:43,874 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 20:43:43,874 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:43:45,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2025-04-13 20:43:45,974 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:45,974 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2025-04-13 20:43:46,168 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:43:46,171 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:43:46,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 1 [2025-04-13 20:43:46,173 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:43:46,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373494993] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:43:46,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:43:46,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 38 [2025-04-13 20:43:46,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138790851] [2025-04-13 20:43:46,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:43:46,173 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 20:43:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:43:46,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 20:43:46,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1362, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 20:43:46,174 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:43:46,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 781 places, 2781 transitions, 63346 flow. Second operand has 40 states, 40 states have (on average 4.75) internal successors, (190), 40 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:43:46,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:43:46,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:43:46,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:43:59,659 INFO L116 PetriNetUnfolderBase]: 12148/17929 cut-off events. [2025-04-13 20:43:59,660 INFO L117 PetriNetUnfolderBase]: For 469918/469918 co-relation queries the response was YES. [2025-04-13 20:43:59,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 202442 conditions, 17929 events. 12148/17929 cut-off events. For 469918/469918 co-relation queries the response was YES. Maximal size of possible extension queue 1023. Compared 111869 event pairs, 514 based on Foata normal form. 2/17378 useless extension candidates. Maximal degree in co-relation 202219. Up to 13074 conditions per place. [2025-04-13 20:43:59,977 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1637 selfloop transitions, 1554 changer transitions 10/3201 dead transitions. [2025-04-13 20:43:59,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 840 places, 3201 transitions, 76610 flow [2025-04-13 20:43:59,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 20:43:59,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-04-13 20:43:59,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 607 transitions. [2025-04-13 20:43:59,983 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3109631147540984 [2025-04-13 20:43:59,983 INFO L175 Difference]: Start difference. First operand has 781 places, 2781 transitions, 63346 flow. Second operand 61 states and 607 transitions. [2025-04-13 20:43:59,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 840 places, 3201 transitions, 76610 flow [2025-04-13 20:44:07,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 813 places, 3201 transitions, 75640 flow, removed 17 selfloop flow, removed 27 redundant places. [2025-04-13 20:44:07,377 INFO L231 Difference]: Finished difference. Result has 828 places, 2978 transitions, 71631 flow [2025-04-13 20:44:07,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=62422, PETRI_DIFFERENCE_MINUEND_PLACES=753, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2781, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=61, PETRI_FLOW=71631, PETRI_PLACES=828, PETRI_TRANSITIONS=2978} [2025-04-13 20:44:07,379 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 797 predicate places. [2025-04-13 20:44:07,379 INFO L485 AbstractCegarLoop]: Abstraction has has 828 places, 2978 transitions, 71631 flow [2025-04-13 20:44:07,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.75) internal successors, (190), 40 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:07,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:07,379 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:07,385 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-04-13 20:44:07,579 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:07,580 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:07,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash -886975847, now seen corresponding path program 3 times [2025-04-13 20:44:07,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:07,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736546868] [2025-04-13 20:44:07,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:07,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:07,586 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:07,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:07,603 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:07,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:08,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:08,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736546868] [2025-04-13 20:44:08,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736546868] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:08,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668933998] [2025-04-13 20:44:08,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:44:08,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:08,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:08,165 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:44:08,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 20:44:08,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:08,223 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:08,223 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:44:08,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:08,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-04-13 20:44:08,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:08,261 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 20:44:08,877 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:44:08,881 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:08,881 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 85 [2025-04-13 20:44:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:44:09,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:11,216 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:44:11,221 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:11,221 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-13 20:44:11,320 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2025-04-13 20:44:11,325 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:11,325 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2025-04-13 20:44:11,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:11,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668933998] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:11,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:11,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 13] total 38 [2025-04-13 20:44:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998433260] [2025-04-13 20:44:11,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:11,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-04-13 20:44:11,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:11,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-04-13 20:44:11,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1364, Unknown=0, NotChecked=0, Total=1560 [2025-04-13 20:44:11,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:11,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 828 places, 2978 transitions, 71631 flow. Second operand has 40 states, 40 states have (on average 4.775) internal successors, (191), 40 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:11,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:11,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:11,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:44:24,546 INFO L116 PetriNetUnfolderBase]: 12163/17964 cut-off events. [2025-04-13 20:44:24,546 INFO L117 PetriNetUnfolderBase]: For 519767/519767 co-relation queries the response was YES. [2025-04-13 20:44:24,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212541 conditions, 17964 events. 12163/17964 cut-off events. For 519767/519767 co-relation queries the response was YES. Maximal size of possible extension queue 1022. Compared 112284 event pairs, 499 based on Foata normal form. 2/17413 useless extension candidates. Maximal degree in co-relation 212302. Up to 13106 conditions per place. [2025-04-13 20:44:24,870 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 1636 selfloop transitions, 1543 changer transitions 10/3189 dead transitions. [2025-04-13 20:44:24,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 875 places, 3189 transitions, 80320 flow [2025-04-13 20:44:24,870 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:44:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:44:24,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 523 transitions. [2025-04-13 20:44:24,871 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.326875 [2025-04-13 20:44:24,871 INFO L175 Difference]: Start difference. First operand has 828 places, 2978 transitions, 71631 flow. Second operand 50 states and 523 transitions. [2025-04-13 20:44:24,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 875 places, 3189 transitions, 80320 flow [2025-04-13 20:44:34,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 845 places, 3189 transitions, 78111 flow, removed 689 selfloop flow, removed 30 redundant places. [2025-04-13 20:44:34,174 INFO L231 Difference]: Finished difference. Result has 849 places, 2983 transitions, 72719 flow [2025-04-13 20:44:34,176 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=69448, PETRI_DIFFERENCE_MINUEND_PLACES=796, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1540, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1438, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=72719, PETRI_PLACES=849, PETRI_TRANSITIONS=2983} [2025-04-13 20:44:34,176 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 818 predicate places. [2025-04-13 20:44:34,176 INFO L485 AbstractCegarLoop]: Abstraction has has 849 places, 2983 transitions, 72719 flow [2025-04-13 20:44:34,176 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 4.775) internal successors, (191), 40 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:34,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:44:34,176 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:44:34,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 20:44:34,377 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:34,377 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:44:34,378 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:44:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1583105497, now seen corresponding path program 4 times [2025-04-13 20:44:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:44:34,378 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962388345] [2025-04-13 20:44:34,378 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:34,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:44:34,382 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:34,387 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:34,387 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:34,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:34,950 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:34,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:44:34,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962388345] [2025-04-13 20:44:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962388345] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:44:34,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1190525570] [2025-04-13 20:44:34,951 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:44:34,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:44:34,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:44:34,952 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:44:34,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 20:44:34,997 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:44:35,012 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:44:35,012 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:44:35,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:44:35,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:44:35,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:44:35,477 INFO L325 Elim1Store]: treesize reduction 10, result has 71.4 percent of original size [2025-04-13 20:44:35,477 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 101 [2025-04-13 20:44:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:44:35,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:44:36,218 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:44:36,218 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 391 treesize of output 161 [2025-04-13 20:44:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:44:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1190525570] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:44:36,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:44:36,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 10] total 33 [2025-04-13 20:44:36,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109553495] [2025-04-13 20:44:36,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:44:36,777 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 20:44:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:44:36,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 20:44:36,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 20:44:36,777 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:44:36,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 849 places, 2983 transitions, 72719 flow. Second operand has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:44:36,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:44:36,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:44:36,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:00,043 INFO L116 PetriNetUnfolderBase]: 16675/24402 cut-off events. [2025-04-13 20:45:00,043 INFO L117 PetriNetUnfolderBase]: For 801724/801724 co-relation queries the response was YES. [2025-04-13 20:45:00,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301916 conditions, 24402 events. 16675/24402 cut-off events. For 801724/801724 co-relation queries the response was YES. Maximal size of possible extension queue 1295. Compared 156102 event pairs, 602 based on Foata normal form. 2/23669 useless extension candidates. Maximal degree in co-relation 301677. Up to 13508 conditions per place. [2025-04-13 20:45:00,483 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 2017 selfloop transitions, 2667 changer transitions 1/4685 dead transitions. [2025-04-13 20:45:00,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 4685 transitions, 120848 flow [2025-04-13 20:45:00,483 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2025-04-13 20:45:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2025-04-13 20:45:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 1099 transitions. [2025-04-13 20:45:00,485 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.306640625 [2025-04-13 20:45:00,485 INFO L175 Difference]: Start difference. First operand has 849 places, 2983 transitions, 72719 flow. Second operand 112 states and 1099 transitions. [2025-04-13 20:45:00,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 4685 transitions, 120848 flow [2025-04-13 20:45:16,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 919 places, 4685 transitions, 118002 flow, removed 152 selfloop flow, removed 39 redundant places. [2025-04-13 20:45:16,712 INFO L231 Difference]: Finished difference. Result has 953 places, 4154 transitions, 108788 flow [2025-04-13 20:45:16,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=70481, PETRI_DIFFERENCE_MINUEND_PLACES=808, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2983, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1560, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=112, PETRI_FLOW=108788, PETRI_PLACES=953, PETRI_TRANSITIONS=4154} [2025-04-13 20:45:16,714 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 922 predicate places. [2025-04-13 20:45:16,714 INFO L485 AbstractCegarLoop]: Abstraction has has 953 places, 4154 transitions, 108788 flow [2025-04-13 20:45:16,715 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 4.9714285714285715) internal successors, (174), 35 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:16,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:45:16,715 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:45:16,721 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 20:45:16,915 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2025-04-13 20:45:16,915 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:45:16,916 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:45:16,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2031137449, now seen corresponding path program 10 times [2025-04-13 20:45:16,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:45:16,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766748221] [2025-04-13 20:45:16,917 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:16,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:45:16,922 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:45:16,927 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:16,927 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:16,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:17,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:17,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:45:17,346 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766748221] [2025-04-13 20:45:17,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766748221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:45:17,347 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666049526] [2025-04-13 20:45:17,347 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:45:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:45:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:45:17,348 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:45:17,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 20:45:17,398 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:45:17,412 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:45:17,412 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:45:17,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:45:17,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:45:17,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:45:17,909 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:17,909 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 20:45:17,972 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:45:17,972 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:45:18,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:45:18,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 109 [2025-04-13 20:45:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:45:18,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666049526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:45:18,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:45:18,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 10] total 31 [2025-04-13 20:45:18,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722647637] [2025-04-13 20:45:18,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:45:18,711 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:45:18,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:45:18,712 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:45:18,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:45:18,712 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:45:18,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 4154 transitions, 108788 flow. Second operand has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:45:18,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:45:18,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:45:18,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:45:36,445 INFO L116 PetriNetUnfolderBase]: 16784/24632 cut-off events. [2025-04-13 20:45:36,446 INFO L117 PetriNetUnfolderBase]: For 889336/889336 co-relation queries the response was YES. [2025-04-13 20:45:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318658 conditions, 24632 events. 16784/24632 cut-off events. For 889336/889336 co-relation queries the response was YES. Maximal size of possible extension queue 1299. Compared 158404 event pairs, 1105 based on Foata normal form. 2/23893 useless extension candidates. Maximal degree in co-relation 318386. Up to 22126 conditions per place. [2025-04-13 20:45:37,320 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3626 selfloop transitions, 676 changer transitions 8/4310 dead transitions. [2025-04-13 20:45:37,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 4310 transitions, 119485 flow [2025-04-13 20:45:37,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:45:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:45:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 331 transitions. [2025-04-13 20:45:37,321 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3336693548387097 [2025-04-13 20:45:37,321 INFO L175 Difference]: Start difference. First operand has 953 places, 4154 transitions, 108788 flow. Second operand 31 states and 331 transitions. [2025-04-13 20:45:37,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 4310 transitions, 119485 flow [2025-04-13 20:46:01,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 4310 transitions, 111868 flow, removed 3451 selfloop flow, removed 24 redundant places. [2025-04-13 20:46:01,791 INFO L231 Difference]: Finished difference. Result has 966 places, 4184 transitions, 103822 flow [2025-04-13 20:46:01,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=101451, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=648, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=103822, PETRI_PLACES=966, PETRI_TRANSITIONS=4184} [2025-04-13 20:46:01,794 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 935 predicate places. [2025-04-13 20:46:01,795 INFO L485 AbstractCegarLoop]: Abstraction has has 966 places, 4184 transitions, 103822 flow [2025-04-13 20:46:01,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.818181818181818) internal successors, (159), 33 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:01,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:01,795 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:01,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 20:46:01,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2025-04-13 20:46:01,996 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:01,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:01,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1171073627, now seen corresponding path program 11 times [2025-04-13 20:46:01,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:01,997 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507209421] [2025-04-13 20:46:01,997 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:01,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:02,001 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:46:02,007 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:46:02,007 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:02,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:46:02,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:02,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507209421] [2025-04-13 20:46:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507209421] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:02,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119916826] [2025-04-13 20:46:02,664 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:02,666 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:02,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 20:46:02,717 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:46:02,730 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:46:02,730 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:02,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:02,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:46:02,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:03,240 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:03,241 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 77 [2025-04-13 20:46:03,363 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:03,363 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:03,954 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:03,955 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 233 treesize of output 109 [2025-04-13 20:46:04,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:04,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2119916826] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:04,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:04,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 34 [2025-04-13 20:46:04,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394904368] [2025-04-13 20:46:04,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:04,203 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:46:04,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:04,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:46:04,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:46:04,204 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:04,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 4184 transitions, 103822 flow. Second operand has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:04,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:04,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:04,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:46:23,013 INFO L116 PetriNetUnfolderBase]: 16963/24923 cut-off events. [2025-04-13 20:46:23,013 INFO L117 PetriNetUnfolderBase]: For 738261/738261 co-relation queries the response was YES. [2025-04-13 20:46:23,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304960 conditions, 24923 events. 16963/24923 cut-off events. For 738261/738261 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 160990 event pairs, 1089 based on Foata normal form. 2/24174 useless extension candidates. Maximal degree in co-relation 304682. Up to 20525 conditions per place. [2025-04-13 20:46:23,689 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3275 selfloop transitions, 1132 changer transitions 7/4414 dead transitions. [2025-04-13 20:46:23,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1009 places, 4414 transitions, 115578 flow [2025-04-13 20:46:23,690 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 20:46:23,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-04-13 20:46:23,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 445 transitions. [2025-04-13 20:46:23,690 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31605113636363635 [2025-04-13 20:46:23,691 INFO L175 Difference]: Start difference. First operand has 966 places, 4184 transitions, 103822 flow. Second operand 44 states and 445 transitions. [2025-04-13 20:46:23,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1009 places, 4414 transitions, 115578 flow [2025-04-13 20:46:40,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 991 places, 4414 transitions, 114377 flow, removed 174 selfloop flow, removed 18 redundant places. [2025-04-13 20:46:40,766 INFO L231 Difference]: Finished difference. Result has 1003 places, 4245 transitions, 106717 flow [2025-04-13 20:46:40,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=102644, PETRI_DIFFERENCE_MINUEND_PLACES=948, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1074, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3099, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=106717, PETRI_PLACES=1003, PETRI_TRANSITIONS=4245} [2025-04-13 20:46:40,769 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 972 predicate places. [2025-04-13 20:46:40,769 INFO L485 AbstractCegarLoop]: Abstraction has has 1003 places, 4245 transitions, 106717 flow [2025-04-13 20:46:40,769 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.944444444444445) internal successors, (178), 36 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:40,769 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:46:40,769 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:46:40,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 20:46:40,970 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:40,970 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:46:40,971 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:46:40,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1418889817, now seen corresponding path program 5 times [2025-04-13 20:46:40,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:46:40,971 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479006466] [2025-04-13 20:46:40,971 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:40,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:46:40,975 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:46:40,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:46:40,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:40,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,471 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 20:46:41,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:46:41,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479006466] [2025-04-13 20:46:41,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479006466] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:46:41,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202212259] [2025-04-13 20:46:41,472 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:46:41,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:46:41,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:46:41,474 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:46:41,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 20:46:41,520 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:46:41,533 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:46:41,534 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:46:41,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:46:41,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 20:46:41,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:46:41,994 INFO L325 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-04-13 20:46:41,995 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 176 treesize of output 101 [2025-04-13 20:46:42,256 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:42,256 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:46:42,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:46:42,638 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 281 treesize of output 93 [2025-04-13 20:46:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:46:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202212259] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:46:42,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:46:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 8] total 24 [2025-04-13 20:46:42,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291746969] [2025-04-13 20:46:42,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:46:42,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 20:46:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:46:42,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 20:46:42,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2025-04-13 20:46:42,666 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:46:42,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1003 places, 4245 transitions, 106717 flow. Second operand has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:46:42,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:46:42,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:46:42,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:01,772 INFO L116 PetriNetUnfolderBase]: 17318/25526 cut-off events. [2025-04-13 20:47:01,773 INFO L117 PetriNetUnfolderBase]: For 779596/779596 co-relation queries the response was YES. [2025-04-13 20:47:02,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318677 conditions, 25526 events. 17318/25526 cut-off events. For 779596/779596 co-relation queries the response was YES. Maximal size of possible extension queue 1339. Compared 166674 event pairs, 1006 based on Foata normal form. 10/24788 useless extension candidates. Maximal degree in co-relation 318388. Up to 23362 conditions per place. [2025-04-13 20:47:02,335 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 3698 selfloop transitions, 695 changer transitions 8/4401 dead transitions. [2025-04-13 20:47:02,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 4401 transitions, 119222 flow [2025-04-13 20:47:02,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 20:47:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-04-13 20:47:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 169 transitions. [2025-04-13 20:47:02,336 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37723214285714285 [2025-04-13 20:47:02,337 INFO L175 Difference]: Start difference. First operand has 1003 places, 4245 transitions, 106717 flow. Second operand 14 states and 169 transitions. [2025-04-13 20:47:02,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 4401 transitions, 119222 flow [2025-04-13 20:47:19,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 4401 transitions, 117623 flow, removed 270 selfloop flow, removed 27 redundant places. [2025-04-13 20:47:19,957 INFO L231 Difference]: Finished difference. Result has 993 places, 4344 transitions, 109994 flow [2025-04-13 20:47:19,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=105118, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=603, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=109994, PETRI_PLACES=993, PETRI_TRANSITIONS=4344} [2025-04-13 20:47:19,960 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 962 predicate places. [2025-04-13 20:47:19,960 INFO L485 AbstractCegarLoop]: Abstraction has has 993 places, 4344 transitions, 109994 flow [2025-04-13 20:47:19,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.1923076923076925) internal successors, (135), 26 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:19,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:47:19,960 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:47:19,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 20:47:20,161 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:20,161 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:47:20,162 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:47:20,162 INFO L85 PathProgramCache]: Analyzing trace with hash 697888269, now seen corresponding path program 12 times [2025-04-13 20:47:20,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:47:20,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62889594] [2025-04-13 20:47:20,162 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:47:20,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:47:20,167 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:20,172 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:20,172 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:47:20,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:47:20,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:47:20,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62889594] [2025-04-13 20:47:20,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62889594] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:47:20,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834269840] [2025-04-13 20:47:20,722 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:47:20,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:47:20,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:47:20,723 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:47:20,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 20:47:20,770 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:47:20,784 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:47:20,784 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:47:20,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:47:20,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:47:20,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:47:21,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:21,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:47:21,310 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:21,310 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 84 [2025-04-13 20:47:21,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:21,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:47:22,157 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:47:22,158 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:47:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:47:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834269840] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:47:22,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:47:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 20:47:22,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17548714] [2025-04-13 20:47:22,335 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:47:22,335 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 20:47:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:47:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 20:47:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 20:47:22,335 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:47:22,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 4344 transitions, 109994 flow. Second operand has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:47:22,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:47:22,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:47:22,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:47:44,592 INFO L116 PetriNetUnfolderBase]: 17430/25709 cut-off events. [2025-04-13 20:47:44,592 INFO L117 PetriNetUnfolderBase]: For 802897/802897 co-relation queries the response was YES. [2025-04-13 20:47:45,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322642 conditions, 25709 events. 17430/25709 cut-off events. For 802897/802897 co-relation queries the response was YES. Maximal size of possible extension queue 1340. Compared 168485 event pairs, 838 based on Foata normal form. 2/24942 useless extension candidates. Maximal degree in co-relation 322350. Up to 20746 conditions per place. [2025-04-13 20:47:45,468 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 3193 selfloop transitions, 1406 changer transitions 10/4609 dead transitions. [2025-04-13 20:47:45,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1046 places, 4609 transitions, 122721 flow [2025-04-13 20:47:45,468 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-04-13 20:47:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-04-13 20:47:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 525 transitions. [2025-04-13 20:47:45,469 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3038194444444444 [2025-04-13 20:47:45,469 INFO L175 Difference]: Start difference. First operand has 993 places, 4344 transitions, 109994 flow. Second operand 54 states and 525 transitions. [2025-04-13 20:47:45,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1046 places, 4609 transitions, 122721 flow [2025-04-13 20:48:03,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1038 places, 4609 transitions, 121681 flow, removed 196 selfloop flow, removed 8 redundant places. [2025-04-13 20:48:04,057 INFO L231 Difference]: Finished difference. Result has 1048 places, 4396 transitions, 113570 flow [2025-04-13 20:48:04,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=108980, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4344, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1366, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=113570, PETRI_PLACES=1048, PETRI_TRANSITIONS=4396} [2025-04-13 20:48:04,059 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1017 predicate places. [2025-04-13 20:48:04,059 INFO L485 AbstractCegarLoop]: Abstraction has has 1048 places, 4396 transitions, 113570 flow [2025-04-13 20:48:04,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.722222222222222) internal successors, (170), 36 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:04,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:04,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:04,065 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 20:48:04,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:04,260 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:04,261 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:04,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1234131613, now seen corresponding path program 13 times [2025-04-13 20:48:04,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:04,261 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619609550] [2025-04-13 20:48:04,261 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:48:04,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:04,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:48:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:48:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:04,876 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:48:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:04,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619609550] [2025-04-13 20:48:04,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619609550] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:04,877 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [633279856] [2025-04-13 20:48:04,877 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 20:48:04,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:04,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:04,879 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:48:04,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 20:48:04,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 20:48:04,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:04,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 20:48:04,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:04,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-04-13 20:48:04,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:04,997 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 19 treesize of output 1 [2025-04-13 20:48:05,465 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:05,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 93 [2025-04-13 20:48:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:05,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:07,019 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2025-04-13 20:48:07,023 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:07,023 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 158 [2025-04-13 20:48:07,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 230 [2025-04-13 20:48:07,090 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:07,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 347 treesize of output 283 [2025-04-13 20:48:07,256 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:48:07,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [633279856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:07,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:07,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 12] total 37 [2025-04-13 20:48:07,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684927870] [2025-04-13 20:48:07,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:07,257 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-13 20:48:07,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:07,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-13 20:48:07,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=0, NotChecked=0, Total=1482 [2025-04-13 20:48:07,258 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:48:07,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1048 places, 4396 transitions, 113570 flow. Second operand has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:07,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:07,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:48:07,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:48:27,194 INFO L116 PetriNetUnfolderBase]: 17473/25777 cut-off events. [2025-04-13 20:48:27,194 INFO L117 PetriNetUnfolderBase]: For 854493/854493 co-relation queries the response was YES. [2025-04-13 20:48:27,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329316 conditions, 25777 events. 17473/25777 cut-off events. For 854493/854493 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 168607 event pairs, 1039 based on Foata normal form. 3/25309 useless extension candidates. Maximal degree in co-relation 329013. Up to 24128 conditions per place. [2025-04-13 20:48:28,013 INFO L140 encePairwiseOnDemand]: 15/32 looper letters, 3823 selfloop transitions, 661 changer transitions 7/4491 dead transitions. [2025-04-13 20:48:28,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1075 places, 4491 transitions, 123353 flow [2025-04-13 20:48:28,014 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-13 20:48:28,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-04-13 20:48:28,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 310 transitions. [2025-04-13 20:48:28,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3125 [2025-04-13 20:48:28,015 INFO L175 Difference]: Start difference. First operand has 1048 places, 4396 transitions, 113570 flow. Second operand 31 states and 310 transitions. [2025-04-13 20:48:28,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1075 places, 4491 transitions, 123353 flow [2025-04-13 20:48:48,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1048 places, 4491 transitions, 120691 flow, removed 362 selfloop flow, removed 27 redundant places. [2025-04-13 20:48:48,176 INFO L231 Difference]: Finished difference. Result has 1053 places, 4409 transitions, 112826 flow [2025-04-13 20:48:48,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=110907, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4395, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=651, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3742, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=112826, PETRI_PLACES=1053, PETRI_TRANSITIONS=4409} [2025-04-13 20:48:48,179 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1022 predicate places. [2025-04-13 20:48:48,179 INFO L485 AbstractCegarLoop]: Abstraction has has 1053 places, 4409 transitions, 112826 flow [2025-04-13 20:48:48,179 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 4.82051282051282) internal successors, (188), 39 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:48,179 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:48:48,179 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:48:48,185 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 20:48:48,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2025-04-13 20:48:48,380 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:48:48,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:48:48,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1233306327, now seen corresponding path program 14 times [2025-04-13 20:48:48,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:48:48,381 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366993609] [2025-04-13 20:48:48,381 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:48:48,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:48:48,385 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:48,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:48,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:48,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:48,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:48:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:48:48,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366993609] [2025-04-13 20:48:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366993609] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:48:48,945 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475164994] [2025-04-13 20:48:48,945 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 20:48:48,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:48:48,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:48:48,947 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:48:48,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 20:48:48,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:48:49,010 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:48:49,010 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:48:49,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:48:49,011 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 20:48:49,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:48:49,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:48:49,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:48:49,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:49,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 87 [2025-04-13 20:48:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:48:49,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:48:50,429 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:48:50,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 203 treesize of output 107 [2025-04-13 20:48:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:48:50,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475164994] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:48:50,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:48:50,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 36 [2025-04-13 20:48:50,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372573468] [2025-04-13 20:48:50,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:48:50,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-04-13 20:48:50,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:48:50,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-04-13 20:48:50,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1251, Unknown=0, NotChecked=0, Total=1406 [2025-04-13 20:48:50,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:48:50,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1053 places, 4409 transitions, 112826 flow. Second operand has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:48:50,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:48:50,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:48:50,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:49:17,678 INFO L116 PetriNetUnfolderBase]: 17604/26007 cut-off events. [2025-04-13 20:49:17,679 INFO L117 PetriNetUnfolderBase]: For 850149/850149 co-relation queries the response was YES. [2025-04-13 20:49:18,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333234 conditions, 26007 events. 17604/26007 cut-off events. For 850149/850149 co-relation queries the response was YES. Maximal size of possible extension queue 1347. Compared 171209 event pairs, 667 based on Foata normal form. 3/25539 useless extension candidates. Maximal degree in co-relation 332927. Up to 19435 conditions per place. [2025-04-13 20:49:18,412 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 3073 selfloop transitions, 1718 changer transitions 15/4806 dead transitions. [2025-04-13 20:49:18,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1135 places, 4806 transitions, 128416 flow [2025-04-13 20:49:18,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2025-04-13 20:49:18,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2025-04-13 20:49:18,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 784 transitions. [2025-04-13 20:49:18,414 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2916666666666667 [2025-04-13 20:49:18,414 INFO L175 Difference]: Start difference. First operand has 1053 places, 4409 transitions, 112826 flow. Second operand 84 states and 784 transitions. [2025-04-13 20:49:18,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1135 places, 4806 transitions, 128416 flow [2025-04-13 20:49:38,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1112 places, 4806 transitions, 127069 flow, removed 228 selfloop flow, removed 23 redundant places. [2025-04-13 20:49:38,666 INFO L231 Difference]: Finished difference. Result has 1126 places, 4500 transitions, 118101 flow [2025-04-13 20:49:38,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=111504, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1627, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=2759, PETRI_DIFFERENCE_SUBTRAHEND_STATES=84, PETRI_FLOW=118101, PETRI_PLACES=1126, PETRI_TRANSITIONS=4500} [2025-04-13 20:49:38,668 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1095 predicate places. [2025-04-13 20:49:38,668 INFO L485 AbstractCegarLoop]: Abstraction has has 1126 places, 4500 transitions, 118101 flow [2025-04-13 20:49:38,668 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 4.815789473684211) internal successors, (183), 38 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:38,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:49:38,669 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:49:38,674 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2025-04-13 20:49:38,869 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 20:49:38,869 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:49:38,870 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:49:38,870 INFO L85 PathProgramCache]: Analyzing trace with hash 116780123, now seen corresponding path program 15 times [2025-04-13 20:49:38,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:49:38,870 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430276595] [2025-04-13 20:49:38,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:49:38,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:49:38,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:49:38,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:38,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:49:38,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:39,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:39,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:49:39,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430276595] [2025-04-13 20:49:39,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430276595] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:49:39,430 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509894399] [2025-04-13 20:49:39,430 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 20:49:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:49:39,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:49:39,432 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:49:39,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 20:49:39,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:49:39,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:49:39,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 20:49:39,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:49:39,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:49:39,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:49:40,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 20:49:40,084 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:40,084 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 82 [2025-04-13 20:49:40,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:40,244 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:49:40,938 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:49:40,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:49:41,199 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:49:41,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [509894399] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:49:41,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:49:41,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 31 [2025-04-13 20:49:41,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303196389] [2025-04-13 20:49:41,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:49:41,200 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 20:49:41,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:49:41,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 20:49:41,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 20:49:41,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:49:41,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1126 places, 4500 transitions, 118101 flow. Second operand has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:49:41,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:49:41,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:49:41,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:02,879 INFO L116 PetriNetUnfolderBase]: 17605/26005 cut-off events. [2025-04-13 20:50:02,880 INFO L117 PetriNetUnfolderBase]: For 883158/883158 co-relation queries the response was YES. [2025-04-13 20:50:03,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340527 conditions, 26005 events. 17605/26005 cut-off events. For 883158/883158 co-relation queries the response was YES. Maximal size of possible extension queue 1345. Compared 171072 event pairs, 895 based on Foata normal form. 2/25539 useless extension candidates. Maximal degree in co-relation 340207. Up to 21232 conditions per place. [2025-04-13 20:50:03,771 INFO L140 encePairwiseOnDemand]: 17/32 looper letters, 3351 selfloop transitions, 1319 changer transitions 8/4678 dead transitions. [2025-04-13 20:50:03,771 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1161 places, 4678 transitions, 129607 flow [2025-04-13 20:50:03,771 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2025-04-13 20:50:03,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2025-04-13 20:50:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 420 transitions. [2025-04-13 20:50:03,772 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.33653846153846156 [2025-04-13 20:50:03,772 INFO L175 Difference]: Start difference. First operand has 1126 places, 4500 transitions, 118101 flow. Second operand 39 states and 420 transitions. [2025-04-13 20:50:03,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1161 places, 4678 transitions, 129607 flow [2025-04-13 20:50:25,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1110 places, 4678 transitions, 127280 flow, removed 453 selfloop flow, removed 51 redundant places. [2025-04-13 20:50:25,639 INFO L231 Difference]: Finished difference. Result has 1111 places, 4502 transitions, 119052 flow [2025-04-13 20:50:25,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=115776, PETRI_DIFFERENCE_MINUEND_PLACES=1072, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1316, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=39, PETRI_FLOW=119052, PETRI_PLACES=1111, PETRI_TRANSITIONS=4502} [2025-04-13 20:50:25,641 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1080 predicate places. [2025-04-13 20:50:25,641 INFO L485 AbstractCegarLoop]: Abstraction has has 1111 places, 4502 transitions, 119052 flow [2025-04-13 20:50:25,642 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 4.757575757575758) internal successors, (157), 33 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:25,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:50:25,642 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:50:25,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Ended with exit code 0 [2025-04-13 20:50:25,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 20:50:25,842 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:50:25,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:50:25,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1978278415, now seen corresponding path program 16 times [2025-04-13 20:50:25,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:50:25,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591554514] [2025-04-13 20:50:25,843 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:50:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:50:25,848 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:50:25,853 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:25,853 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:50:25,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:26,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:50:26,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:50:26,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591554514] [2025-04-13 20:50:26,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591554514] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:50:26,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257654620] [2025-04-13 20:50:26,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 20:50:26,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:50:26,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:50:26,386 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:50:26,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 20:50:26,434 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:50:26,448 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:50:26,448 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 20:50:26,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:50:26,449 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 20:50:26,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:50:26,933 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:26,933 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 77 [2025-04-13 20:50:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 20:50:26,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:50:27,466 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:50:27,466 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 159 [2025-04-13 20:50:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:50:27,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257654620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:50:27,997 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:50:27,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 29 [2025-04-13 20:50:27,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639592565] [2025-04-13 20:50:27,997 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:50:27,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 20:50:27,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:50:27,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 20:50:27,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=830, Unknown=0, NotChecked=0, Total=930 [2025-04-13 20:50:27,998 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:50:27,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1111 places, 4502 transitions, 119052 flow. Second operand has 31 states, 31 states have (on average 4.967741935483871) internal successors, (154), 31 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:50:27,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:50:27,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:50:27,998 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:50:49,760 INFO L116 PetriNetUnfolderBase]: 17617/26019 cut-off events. [2025-04-13 20:50:49,760 INFO L117 PetriNetUnfolderBase]: For 901252/901252 co-relation queries the response was YES. [2025-04-13 20:50:50,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 343908 conditions, 26019 events. 17617/26019 cut-off events. For 901252/901252 co-relation queries the response was YES. Maximal size of possible extension queue 1348. Compared 170973 event pairs, 1035 based on Foata normal form. 1/25548 useless extension candidates. Maximal degree in co-relation 343599. Up to 23638 conditions per place. [2025-04-13 20:50:50,269 INFO L140 encePairwiseOnDemand]: 16/32 looper letters, 3858 selfloop transitions, 776 changer transitions 3/4637 dead transitions. [2025-04-13 20:50:50,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1150 places, 4637 transitions, 129663 flow [2025-04-13 20:50:50,270 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 20:50:50,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-13 20:50:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 423 transitions. [2025-04-13 20:50:50,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.31473214285714285 [2025-04-13 20:50:50,271 INFO L175 Difference]: Start difference. First operand has 1111 places, 4502 transitions, 119052 flow. Second operand 42 states and 423 transitions. [2025-04-13 20:50:50,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1150 places, 4637 transitions, 129663 flow [2025-04-13 20:51:10,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1120 places, 4637 transitions, 128656 flow, removed 9 selfloop flow, removed 30 redundant places. [2025-04-13 20:51:10,923 INFO L231 Difference]: Finished difference. Result has 1123 places, 4514 transitions, 120029 flow [2025-04-13 20:51:10,925 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118038, PETRI_DIFFERENCE_MINUEND_PLACES=1079, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4501, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=763, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=120029, PETRI_PLACES=1123, PETRI_TRANSITIONS=4514} [2025-04-13 20:51:10,926 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1092 predicate places. [2025-04-13 20:51:10,926 INFO L485 AbstractCegarLoop]: Abstraction has has 1123 places, 4514 transitions, 120029 flow [2025-04-13 20:51:10,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 4.967741935483871) internal successors, (154), 31 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:10,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:51:10,926 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:51:10,932 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 20:51:11,127 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-13 20:51:11,127 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:51:11,128 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:51:11,128 INFO L85 PathProgramCache]: Analyzing trace with hash -426345981, now seen corresponding path program 17 times [2025-04-13 20:51:11,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:51:11,128 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722639269] [2025-04-13 20:51:11,128 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:51:11,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:51:11,132 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:11,137 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:11,137 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:11,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:11,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 20:51:11,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:51:11,905 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722639269] [2025-04-13 20:51:11,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722639269] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:51:11,906 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778831800] [2025-04-13 20:51:11,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 20:51:11,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:51:11,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:51:11,907 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:51:11,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 20:51:11,956 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:51:11,969 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:51:11,969 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 20:51:11,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:51:11,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 20:51:11,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:51:12,297 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 20:51:12,297 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 85 [2025-04-13 20:51:12,501 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:51:12,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:51:12,973 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:51:12,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 315 treesize of output 159 [2025-04-13 20:51:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:51:13,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778831800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:51:13,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:51:13,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 20:51:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685764194] [2025-04-13 20:51:13,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:51:13,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 20:51:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:51:13,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 20:51:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 20:51:13,443 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:51:13,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1123 places, 4514 transitions, 120029 flow. Second operand has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 34 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:51:13,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:51:13,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:51:13,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 20:51:37,288 INFO L116 PetriNetUnfolderBase]: 18142/26808 cut-off events. [2025-04-13 20:51:37,289 INFO L117 PetriNetUnfolderBase]: For 970398/970398 co-relation queries the response was YES. [2025-04-13 20:51:38,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358613 conditions, 26808 events. 18142/26808 cut-off events. For 970398/970398 co-relation queries the response was YES. Maximal size of possible extension queue 1417. Compared 177295 event pairs, 944 based on Foata normal form. 1/26322 useless extension candidates. Maximal degree in co-relation 358301. Up to 21960 conditions per place. [2025-04-13 20:51:38,315 INFO L140 encePairwiseOnDemand]: 14/32 looper letters, 3478 selfloop transitions, 1412 changer transitions 4/4894 dead transitions. [2025-04-13 20:51:38,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1172 places, 4894 transitions, 138357 flow [2025-04-13 20:51:38,315 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 20:51:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2025-04-13 20:51:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 526 transitions. [2025-04-13 20:51:38,316 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.32875 [2025-04-13 20:51:38,316 INFO L175 Difference]: Start difference. First operand has 1123 places, 4514 transitions, 120029 flow. Second operand 50 states and 526 transitions. [2025-04-13 20:51:38,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1172 places, 4894 transitions, 138357 flow [2025-04-13 20:52:00,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1138 places, 4894 transitions, 136984 flow, removed 181 selfloop flow, removed 34 redundant places. [2025-04-13 20:52:00,714 INFO L231 Difference]: Finished difference. Result has 1149 places, 4696 transitions, 127864 flow [2025-04-13 20:52:00,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=118668, PETRI_DIFFERENCE_MINUEND_PLACES=1089, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=4514, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1255, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=3198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=127864, PETRI_PLACES=1149, PETRI_TRANSITIONS=4696} [2025-04-13 20:52:00,716 INFO L279 CegarLoopForPetriNet]: 31 programPoint places, 1118 predicate places. [2025-04-13 20:52:00,716 INFO L485 AbstractCegarLoop]: Abstraction has has 1149 places, 4696 transitions, 127864 flow [2025-04-13 20:52:00,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 5.029411764705882) internal successors, (171), 34 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:00,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 20:52:00,717 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 20:52:00,723 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 20:52:00,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:00,917 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 20:52:00,918 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 20:52:00,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1032131803, now seen corresponding path program 18 times [2025-04-13 20:52:00,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 20:52:00,918 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513570482] [2025-04-13 20:52:00,918 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:52:00,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 20:52:00,922 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:52:00,928 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:52:00,929 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:52:00,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 20:52:01,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513570482] [2025-04-13 20:52:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513570482] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 20:52:01,333 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266043144] [2025-04-13 20:52:01,333 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 20:52:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 20:52:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 20:52:01,335 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 20:52:01,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 20:52:01,385 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 20:52:01,398 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 20:52:01,399 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 20:52:01,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 20:52:01,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 20:52:01,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 20:52:02,014 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:02,014 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 93 [2025-04-13 20:52:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:02,381 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 20:52:03,105 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 20:52:03,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 219 treesize of output 111 [2025-04-13 20:52:03,322 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 20:52:03,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266043144] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 20:52:03,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 20:52:03,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 35 [2025-04-13 20:52:03,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416730259] [2025-04-13 20:52:03,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 20:52:03,323 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 20:52:03,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 20:52:03,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 20:52:03,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1145, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 20:52:03,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 32 [2025-04-13 20:52:03,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1149 places, 4696 transitions, 127864 flow. Second operand has 37 states, 37 states have (on average 4.8108108108108105) internal successors, (178), 37 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 20:52:03,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 20:52:03,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 32 [2025-04-13 20:52:03,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-04-13 20:52:27,580 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 20:52:27,580 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 20:52:28,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 20:52:28,086 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 20:52:28,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Ended with exit code 0 [2025-04-13 20:52:28,286 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2025-04-13 20:52:28,287 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 3/32 universal loopers) in iteration 53,while PetriNetUnfolder was constructing finite prefix that currently has 380892 conditions, 27702 events (18803/27701 cut-off events. For 1100763/1100763 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 184619 event pairs, 837 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 380570. Up to 21977 conditions per place.). [2025-04-13 20:52:28,289 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 20:52:28,289 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 20:52:28,289 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 20:52:28,289 INFO L422 BasicCegarLoop]: Path program histogram: [19, 18, 6, 5, 1, 1, 1, 1, 1] [2025-04-13 20:52:28,298 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 20:52:28,298 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 20:52:28,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 08:52:28 BasicIcfg [2025-04-13 20:52:28,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 20:52:28,303 INFO L158 Benchmark]: Toolchain (without parser) took 778225.05ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 100.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2025-04-13 20:52:28,303 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:52:28,303 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.33ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.7MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 20:52:28,303 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 20:52:28,303 INFO L158 Benchmark]: Boogie Preprocessor took 54.69ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 20:52:28,304 INFO L158 Benchmark]: RCFGBuilder took 527.48ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 35.3MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 20:52:28,304 INFO L158 Benchmark]: TraceAbstraction took 777349.32ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 34.5MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. [2025-04-13 20:52:28,304 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.15ms. Allocated memory is still 167.8MB. Free memory is still 96.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 261.33ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.7MB in the end (delta: 14.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.28ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 82.9MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.69ms. Allocated memory is still 142.6MB. Free memory was 82.9MB in the beginning and 80.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 527.48ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 35.3MB in the end (delta: 45.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 777349.32ms. Allocated memory was 142.6MB in the beginning and 4.9GB in the end (delta: 4.7GB). Free memory was 34.5MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 4.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 3/32 universal loopers) in iteration 53,while PetriNetUnfolder was constructing finite prefix that currently has 380892 conditions, 27702 events (18803/27701 cut-off events. For 1100763/1100763 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 184619 event pairs, 837 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 380570. Up to 21977 conditions per place.). - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 3/32 universal loopers) in iteration 53,while PetriNetUnfolder was constructing finite prefix that currently has 380892 conditions, 27702 events (18803/27701 cut-off events. For 1100763/1100763 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 184619 event pairs, 837 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 380570. Up to 21977 conditions per place.). - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 3/32 universal loopers) in iteration 53,while PetriNetUnfolder was constructing finite prefix that currently has 380892 conditions, 27702 events (18803/27701 cut-off events. For 1100763/1100763 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 184619 event pairs, 837 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 380570. Up to 21977 conditions per place.). - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (37states, 3/32 universal loopers) in iteration 53,while PetriNetUnfolder was constructing finite prefix that currently has 380892 conditions, 27702 events (18803/27701 cut-off events. For 1100763/1100763 co-relation queries the response was YES. Maximal size of possible extension queue 1458. Compared 184619 event pairs, 837 based on Foata normal form. 0/27297 useless extension candidates. Maximal degree in co-relation 380570. Up to 21977 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 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: 777.3s, OverallIterations: 53, TraceHistogramMax: 2, PathProgramHistogramMax: 19, EmptinessCheckTime: 0.0s, AutomataDifference: 700.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11484 SdHoareTripleChecker+Valid, 43.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11484 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 37.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2083 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79231 IncrementalHoareTripleChecker+Invalid, 81314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2083 mSolverCounterUnsat, 0 mSDtfsCounter, 79231 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3189 GetRequests, 1037 SyntacticMatches, 22 SemanticMatches, 2130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38699 ImplicationChecksByTransitivity, 77.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=127864occurred in iteration=52, InterpolantAutomatonStates: 1543, 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, 0.9s SatisfiabilityAnalysisTime, 66.2s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 141 NumberOfCheckSat, 2728 ConstructedInterpolants, 0 QuantifiedInterpolants, 111398 SizeOfPredicates, 470 NumberOfNonLiveVariables, 6436 ConjunctsInSsa, 836 ConjunctsInUnsatCore, 123 InterpolantComputations, 21 PerfectInterpolantSequences, 190/459 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