./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:52:38,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:52:38,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-13 21:52:38,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:52:38,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:52:38,314 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:52:38,315 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:52:38,315 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:52:38,315 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-13 21:52:38,315 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-13 21:52:38,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:52:38,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:52:38,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:52:38,316 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:52:38,317 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:52:38,317 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:52:38,318 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:52:38,318 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:52:38,319 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-13 21:52:38,319 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:52:38,319 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:38,319 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:52:38,320 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4f5c6e2b4939ff0e3b5a44ab7f8c3e5d18f7e9fd12beb8fad487ea501e8fa48b [2025-03-13 21:52:38,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:52:38,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:52:38,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:52:38,568 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:52:38,568 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:52:38,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-13 21:52:39,721 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c20039fcf/deb74929e65443cfa85563034728ecdd/FLAG8468064cd [2025-03-13 21:52:39,948 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:52:39,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c [2025-03-13 21:52:39,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c20039fcf/deb74929e65443cfa85563034728ecdd/FLAG8468064cd [2025-03-13 21:52:39,968 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c20039fcf/deb74929e65443cfa85563034728ecdd [2025-03-13 21:52:39,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:52:39,971 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:52:39,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:39,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:52:39,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:52:39,976 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:39" (1/1) ... [2025-03-13 21:52:39,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e006298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:39, skipping insertion in model container [2025-03-13 21:52:39,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:52:39" (1/1) ... [2025-03-13 21:52:39,989 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:52:40,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2500,2513] [2025-03-13 21:52:40,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:40,127 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:52:40,141 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/unroll-cond-2.wvr.c[2500,2513] [2025-03-13 21:52:40,148 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:52:40,162 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:52:40,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40 WrapperNode [2025-03-13 21:52:40,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:52:40,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:40,166 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:52:40,166 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:52:40,170 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,195 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 125 [2025-03-13 21:52:40,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:52:40,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:52:40,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:52:40,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:52:40,202 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,205 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,220 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 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-03-13 21:52:40,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,229 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:52:40,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:52:40,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:52:40,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:52:40,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (1/1) ... [2025-03-13 21:52:40,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:52:40,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:40,255 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-03-13 21:52:40,256 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-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 21:52:40,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 21:52:40,273 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:52:40,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-13 21:52:40,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-13 21:52:40,274 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:52:40,359 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:52:40,361 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:52:40,595 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:52:40,596 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:52:40,596 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:52:40,813 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:52:40,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:40 BoogieIcfgContainer [2025-03-13 21:52:40,814 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:52:40,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:52:40,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:52:40,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:52:40,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:52:39" (1/3) ... [2025-03-13 21:52:40,821 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da8f7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:40, skipping insertion in model container [2025-03-13 21:52:40,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:52:40" (2/3) ... [2025-03-13 21:52:40,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da8f7b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:52:40, skipping insertion in model container [2025-03-13 21:52:40,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:52:40" (3/3) ... [2025-03-13 21:52:40,823 INFO L128 eAbstractionObserver]: Analyzing ICFG unroll-cond-2.wvr.c [2025-03-13 21:52:40,835 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:52:40,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG unroll-cond-2.wvr.c that has 3 procedures, 18 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-13 21:52:40,837 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:52:40,879 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 21:52:40,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 24 places, 20 transitions, 54 flow [2025-03-13 21:52:40,931 INFO L124 PetriNetUnfolderBase]: 3/18 cut-off events. [2025-03-13 21:52:40,933 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:40,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27 conditions, 18 events. 3/18 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 10 event pairs, 0 based on Foata normal form. 0/14 useless extension candidates. Maximal degree in co-relation 11. Up to 2 conditions per place. [2025-03-13 21:52:40,937 INFO L82 GeneralOperation]: Start removeDead. Operand has 24 places, 20 transitions, 54 flow [2025-03-13 21:52:40,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 21 places, 17 transitions, 46 flow [2025-03-13 21:52:40,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:52:40,959 INFO L333 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;@7b9a503f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:52:40,959 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-03-13 21:52:40,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:52:40,969 INFO L124 PetriNetUnfolderBase]: 3/16 cut-off events. [2025-03-13 21:52:40,969 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:40,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:40,970 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:40,970 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:40,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash -2133698059, now seen corresponding path program 1 times [2025-03-13 21:52:40,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:40,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839680718] [2025-03-13 21:52:40,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:40,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:41,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-13 21:52:41,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-13 21:52:41,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:41,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:41,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:41,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:41,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839680718] [2025-03-13 21:52:41,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839680718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:41,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:41,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:52:41,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171156507] [2025-03-13 21:52:41,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:41,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:52:41,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:41,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:52:41,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:52:41,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:41,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 17 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:41,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:41,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:41,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:41,373 INFO L124 PetriNetUnfolderBase]: 38/71 cut-off events. [2025-03-13 21:52:41,373 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-13 21:52:41,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157 conditions, 71 events. 38/71 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 118 event pairs, 22 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 120. Up to 70 conditions per place. [2025-03-13 21:52:41,376 INFO L140 encePairwiseOnDemand]: 17/20 looper letters, 15 selfloop transitions, 2 changer transitions 0/18 dead transitions. [2025-03-13 21:52:41,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 18 transitions, 82 flow [2025-03-13 21:52:41,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:52:41,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:52:41,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 27 transitions. [2025-03-13 21:52:41,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-13 21:52:41,388 INFO L175 Difference]: Start difference. First operand has 21 places, 17 transitions, 46 flow. Second operand 3 states and 27 transitions. [2025-03-13 21:52:41,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 18 transitions, 82 flow [2025-03-13 21:52:41,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 19 places, 18 transitions, 74 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 21:52:41,394 INFO L231 Difference]: Finished difference. Result has 20 places, 18 transitions, 50 flow [2025-03-13 21:52:41,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=20, PETRI_TRANSITIONS=18} [2025-03-13 21:52:41,400 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, -1 predicate places. [2025-03-13 21:52:41,401 INFO L471 AbstractCegarLoop]: Abstraction has has 20 places, 18 transitions, 50 flow [2025-03-13 21:52:41,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 21:52:41,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:41,401 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:41,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:52:41,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:41,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:41,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1137419098, now seen corresponding path program 1 times [2025-03-13 21:52:41,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:41,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10384828] [2025-03-13 21:52:41,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:41,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-13 21:52:41,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:52:41,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:41,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:41,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:41,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:41,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10384828] [2025-03-13 21:52:41,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10384828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:41,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:41,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:41,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487727132] [2025-03-13 21:52:41,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:41,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:41,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:41,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:41,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:41,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:41,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 20 places, 18 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:41,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:41,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:41,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:41,764 INFO L124 PetriNetUnfolderBase]: 65/123 cut-off events. [2025-03-13 21:52:41,764 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 21:52:41,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 123 events. 65/123 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 326 event pairs, 22 based on Foata normal form. 0/94 useless extension candidates. Maximal degree in co-relation 248. Up to 71 conditions per place. [2025-03-13 21:52:41,766 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 5 changer transitions 0/38 dead transitions. [2025-03-13 21:52:41,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 38 transitions, 169 flow [2025-03-13 21:52:41,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:52:41,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:52:41,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-13 21:52:41,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:52:41,768 INFO L175 Difference]: Start difference. First operand has 20 places, 18 transitions, 50 flow. Second operand 5 states and 52 transitions. [2025-03-13 21:52:41,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 38 transitions, 169 flow [2025-03-13 21:52:41,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 38 transitions, 165 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:41,769 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 82 flow [2025-03-13 21:52:41,770 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=19, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=82, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-13 21:52:41,770 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 5 predicate places. [2025-03-13 21:52:41,770 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 82 flow [2025-03-13 21:52:41,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:41,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:41,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:41,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:52:41,772 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:41,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1140594968, now seen corresponding path program 2 times [2025-03-13 21:52:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967847455] [2025-03-13 21:52:41,773 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:41,784 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:52:41,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:52:41,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 21:52:41,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:41,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:41,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:41,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967847455] [2025-03-13 21:52:41,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967847455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:41,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:41,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:41,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511204328] [2025-03-13 21:52:41,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:41,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:41,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:41,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:41,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:41,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:41,937 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 82 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:41,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:41,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:41,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:42,086 INFO L124 PetriNetUnfolderBase]: 98/180 cut-off events. [2025-03-13 21:52:42,086 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2025-03-13 21:52:42,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 180 events. 98/180 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 535 event pairs, 22 based on Foata normal form. 2/147 useless extension candidates. Maximal degree in co-relation 508. Up to 78 conditions per place. [2025-03-13 21:52:42,087 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 12 changer transitions 0/49 dead transitions. [2025-03-13 21:52:42,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 49 transitions, 278 flow [2025-03-13 21:52:42,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:52:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:52:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 62 transitions. [2025-03-13 21:52:42,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2025-03-13 21:52:42,091 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 82 flow. Second operand 6 states and 62 transitions. [2025-03-13 21:52:42,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 49 transitions, 278 flow [2025-03-13 21:52:42,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 49 transitions, 261 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:42,093 INFO L231 Difference]: Finished difference. Result has 34 places, 31 transitions, 163 flow [2025-03-13 21:52:42,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=163, PETRI_PLACES=34, PETRI_TRANSITIONS=31} [2025-03-13 21:52:42,093 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 13 predicate places. [2025-03-13 21:52:42,093 INFO L471 AbstractCegarLoop]: Abstraction has has 34 places, 31 transitions, 163 flow [2025-03-13 21:52:42,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:42,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:42,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:52:42,094 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:42,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1792718990, now seen corresponding path program 3 times [2025-03-13 21:52:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:42,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055586568] [2025-03-13 21:52:42,095 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:42,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:42,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:52:42,116 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:52:42,116 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-13 21:52:42,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:42,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:42,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055586568] [2025-03-13 21:52:42,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055586568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:42,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:42,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:42,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565706633] [2025-03-13 21:52:42,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:42,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:42,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:42,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:42,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:42,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:42,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 31 transitions, 163 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:42,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:42,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:42,330 INFO L124 PetriNetUnfolderBase]: 107/194 cut-off events. [2025-03-13 21:52:42,330 INFO L125 PetriNetUnfolderBase]: For 291/291 co-relation queries the response was YES. [2025-03-13 21:52:42,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 194 events. 107/194 cut-off events. For 291/291 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 607 event pairs, 25 based on Foata normal form. 3/169 useless extension candidates. Maximal degree in co-relation 699. Up to 102 conditions per place. [2025-03-13 21:52:42,332 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 36 selfloop transitions, 14 changer transitions 0/51 dead transitions. [2025-03-13 21:52:42,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 51 transitions, 362 flow [2025-03-13 21:52:42,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:52:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:52:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 52 transitions. [2025-03-13 21:52:42,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.52 [2025-03-13 21:52:42,333 INFO L175 Difference]: Start difference. First operand has 34 places, 31 transitions, 163 flow. Second operand 5 states and 52 transitions. [2025-03-13 21:52:42,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 51 transitions, 362 flow [2025-03-13 21:52:42,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 51 transitions, 348 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-03-13 21:52:42,337 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 255 flow [2025-03-13 21:52:42,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=255, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-13 21:52:42,337 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 20 predicate places. [2025-03-13 21:52:42,337 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 255 flow [2025-03-13 21:52:42,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:42,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:42,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:52:42,338 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:42,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:42,338 INFO L85 PathProgramCache]: Analyzing trace with hash -364242682, now seen corresponding path program 4 times [2025-03-13 21:52:42,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:42,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751021926] [2025-03-13 21:52:42,338 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:42,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:42,347 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:52:42,353 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:52:42,353 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:42,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:42,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:42,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:42,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751021926] [2025-03-13 21:52:42,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751021926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:42,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:42,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:42,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475598454] [2025-03-13 21:52:42,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:42,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:52:42,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:42,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:52:42,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:52:42,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:42,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-03-13 21:52:42,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:42,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:42,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:42,587 INFO L124 PetriNetUnfolderBase]: 104/191 cut-off events. [2025-03-13 21:52:42,587 INFO L125 PetriNetUnfolderBase]: For 513/513 co-relation queries the response was YES. [2025-03-13 21:52:42,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 797 conditions, 191 events. 104/191 cut-off events. For 513/513 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 561 event pairs, 15 based on Foata normal form. 3/171 useless extension candidates. Maximal degree in co-relation 771. Up to 144 conditions per place. [2025-03-13 21:52:42,589 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 35 selfloop transitions, 18 changer transitions 0/54 dead transitions. [2025-03-13 21:52:42,589 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 459 flow [2025-03-13 21:52:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:52:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:52:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2025-03-13 21:52:42,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2025-03-13 21:52:42,590 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 255 flow. Second operand 6 states and 58 transitions. [2025-03-13 21:52:42,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 459 flow [2025-03-13 21:52:42,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 441 flow, removed 4 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:42,597 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 358 flow [2025-03-13 21:52:42,598 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-03-13 21:52:42,599 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 27 predicate places. [2025-03-13 21:52:42,599 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 358 flow [2025-03-13 21:52:42,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 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-03-13 21:52:42,599 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:42,600 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:42,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:52:42,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:42,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:42,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1709602100, now seen corresponding path program 5 times [2025-03-13 21:52:42,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:42,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141061487] [2025-03-13 21:52:42,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:42,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:42,607 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:52:42,621 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-13 21:52:42,621 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:42,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:42,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:42,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141061487] [2025-03-13 21:52:42,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141061487] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:42,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:42,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:42,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634287573] [2025-03-13 21:52:42,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:42,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:42,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:42,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:42,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:42,715 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:42,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 358 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:42,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:42,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:42,785 INFO L124 PetriNetUnfolderBase]: 105/194 cut-off events. [2025-03-13 21:52:42,786 INFO L125 PetriNetUnfolderBase]: For 520/520 co-relation queries the response was YES. [2025-03-13 21:52:42,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 194 events. 105/194 cut-off events. For 520/520 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 604 event pairs, 25 based on Foata normal form. 2/173 useless extension candidates. Maximal degree in co-relation 835. Up to 104 conditions per place. [2025-03-13 21:52:42,787 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 38 selfloop transitions, 16 changer transitions 0/55 dead transitions. [2025-03-13 21:52:42,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 55 transitions, 506 flow [2025-03-13 21:52:42,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:52:42,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:52:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2025-03-13 21:52:42,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.51 [2025-03-13 21:52:42,790 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 358 flow. Second operand 5 states and 51 transitions. [2025-03-13 21:52:42,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 55 transitions, 506 flow [2025-03-13 21:52:42,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 55 transitions, 451 flow, removed 14 selfloop flow, removed 2 redundant places. [2025-03-13 21:52:42,794 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 345 flow [2025-03-13 21:52:42,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=345, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2025-03-13 21:52:42,795 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 30 predicate places. [2025-03-13 21:52:42,796 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 345 flow [2025-03-13 21:52:42,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:42,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:42,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:52:42,797 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:42,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:42,797 INFO L85 PathProgramCache]: Analyzing trace with hash -281125792, now seen corresponding path program 6 times [2025-03-13 21:52:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383576172] [2025-03-13 21:52:42,797 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:42,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:42,805 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 15 statements into 2 equivalence classes. [2025-03-13 21:52:42,813 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 14 of 15 statements. [2025-03-13 21:52:42,816 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-13 21:52:42,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:42,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:42,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383576172] [2025-03-13 21:52:42,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383576172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:52:42,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:52:42,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:52:42,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259712030] [2025-03-13 21:52:42,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:52:42,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:52:42,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:42,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:52:42,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 21:52:42,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:42,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:42,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:42,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:42,975 INFO L124 PetriNetUnfolderBase]: 104/187 cut-off events. [2025-03-13 21:52:42,975 INFO L125 PetriNetUnfolderBase]: For 749/749 co-relation queries the response was YES. [2025-03-13 21:52:42,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 187 events. 104/187 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 549 event pairs, 36 based on Foata normal form. 2/166 useless extension candidates. Maximal degree in co-relation 800. Up to 145 conditions per place. [2025-03-13 21:52:42,977 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 32 selfloop transitions, 18 changer transitions 0/51 dead transitions. [2025-03-13 21:52:42,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 51 transitions, 465 flow [2025-03-13 21:52:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:52:42,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:52:42,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2025-03-13 21:52:42,978 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-13 21:52:42,978 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 345 flow. Second operand 5 states and 47 transitions. [2025-03-13 21:52:42,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 51 transitions, 465 flow [2025-03-13 21:52:42,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 51 transitions, 429 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-13 21:52:42,980 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 349 flow [2025-03-13 21:52:42,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=349, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2025-03-13 21:52:42,981 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 32 predicate places. [2025-03-13 21:52:42,981 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 349 flow [2025-03-13 21:52:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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-03-13 21:52:42,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:42,981 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:42,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:52:42,981 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:42,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:42,981 INFO L85 PathProgramCache]: Analyzing trace with hash -322472478, now seen corresponding path program 1 times [2025-03-13 21:52:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:42,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278546933] [2025-03-13 21:52:42,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:42,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:42,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:52:42,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:42,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:42,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:43,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278546933] [2025-03-13 21:52:43,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278546933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:43,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1420126380] [2025-03-13 21:52:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:43,217 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-03-13 21:52:43,219 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-03-13 21:52:43,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:52:43,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:43,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:43,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:43,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-13 21:52:43,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:43,448 INFO L378 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 15 treesize of output 7 [2025-03-13 21:52:43,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:43,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:43,660 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:43,660 INFO L378 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 42 treesize of output 22 [2025-03-13 21:52:43,716 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:43,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1420126380] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:43,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:43,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-03-13 21:52:43,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323150306] [2025-03-13 21:52:43,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:43,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-13 21:52:43,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:43,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-13 21:52:43,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-13 21:52:43,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:43,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 349 flow. Second operand has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 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-03-13 21:52:43,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:43,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:43,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:43,992 INFO L124 PetriNetUnfolderBase]: 143/259 cut-off events. [2025-03-13 21:52:43,992 INFO L125 PetriNetUnfolderBase]: For 679/679 co-relation queries the response was YES. [2025-03-13 21:52:43,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1073 conditions, 259 events. 143/259 cut-off events. For 679/679 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 860 event pairs, 5 based on Foata normal form. 1/225 useless extension candidates. Maximal degree in co-relation 1041. Up to 158 conditions per place. [2025-03-13 21:52:43,994 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 50 selfloop transitions, 28 changer transitions 3/82 dead transitions. [2025-03-13 21:52:43,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 82 transitions, 662 flow [2025-03-13 21:52:43,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-13 21:52:43,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-13 21:52:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 94 transitions. [2025-03-13 21:52:43,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47 [2025-03-13 21:52:43,996 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 349 flow. Second operand 10 states and 94 transitions. [2025-03-13 21:52:43,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 82 transitions, 662 flow [2025-03-13 21:52:43,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 616 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-13 21:52:44,002 INFO L231 Difference]: Finished difference. Result has 63 places, 55 transitions, 477 flow [2025-03-13 21:52:44,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=477, PETRI_PLACES=63, PETRI_TRANSITIONS=55} [2025-03-13 21:52:44,002 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 42 predicate places. [2025-03-13 21:52:44,002 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 55 transitions, 477 flow [2025-03-13 21:52:44,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.4375) internal successors, (87), 16 states have internal predecessors, (87), 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-03-13 21:52:44,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:44,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:44,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:44,203 WARN L453 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-03-13 21:52:44,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:44,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:44,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1086186189, now seen corresponding path program 1 times [2025-03-13 21:52:44,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:44,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908882827] [2025-03-13 21:52:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:44,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:52:44,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:44,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:44,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:44,312 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:44,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908882827] [2025-03-13 21:52:44,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908882827] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:44,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509374922] [2025-03-13 21:52:44,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:52:44,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:44,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:44,315 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-03-13 21:52:44,316 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-03-13 21:52:44,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 21:52:44,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:44,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:52:44,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:44,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-13 21:52:44,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:44,392 INFO L378 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-03-13 21:52:44,604 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:44,605 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 17 [2025-03-13 21:52:44,619 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:44,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:45,067 INFO L378 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 72 treesize of output 64 [2025-03-13 21:52:45,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:45,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 116 [2025-03-13 21:52:45,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:45,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509374922] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:45,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:45,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 22 [2025-03-13 21:52:45,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141148371] [2025-03-13 21:52:45,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:45,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 21:52:45,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:45,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 21:52:45,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2025-03-13 21:52:45,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:45,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 55 transitions, 477 flow. Second operand has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 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-03-13 21:52:45,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:45,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:45,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:46,486 INFO L124 PetriNetUnfolderBase]: 313/553 cut-off events. [2025-03-13 21:52:46,487 INFO L125 PetriNetUnfolderBase]: For 1544/1544 co-relation queries the response was YES. [2025-03-13 21:52:46,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 553 events. 313/553 cut-off events. For 1544/1544 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2323 event pairs, 20 based on Foata normal form. 5/521 useless extension candidates. Maximal degree in co-relation 2319. Up to 151 conditions per place. [2025-03-13 21:52:46,492 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 76 selfloop transitions, 56 changer transitions 54/187 dead transitions. [2025-03-13 21:52:46,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 187 transitions, 1600 flow [2025-03-13 21:52:46,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-13 21:52:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-13 21:52:46,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 239 transitions. [2025-03-13 21:52:46,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4425925925925926 [2025-03-13 21:52:46,495 INFO L175 Difference]: Start difference. First operand has 63 places, 55 transitions, 477 flow. Second operand 27 states and 239 transitions. [2025-03-13 21:52:46,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 187 transitions, 1600 flow [2025-03-13 21:52:46,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 187 transitions, 1531 flow, removed 23 selfloop flow, removed 4 redundant places. [2025-03-13 21:52:46,505 INFO L231 Difference]: Finished difference. Result has 96 places, 80 transitions, 844 flow [2025-03-13 21:52:46,506 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=844, PETRI_PLACES=96, PETRI_TRANSITIONS=80} [2025-03-13 21:52:46,507 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 75 predicate places. [2025-03-13 21:52:46,507 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 80 transitions, 844 flow [2025-03-13 21:52:46,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.045454545454546) internal successors, (111), 22 states have internal predecessors, (111), 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-03-13 21:52:46,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:46,507 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:46,513 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-03-13 21:52:46,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-13 21:52:46,708 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:46,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:46,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1231180416, now seen corresponding path program 2 times [2025-03-13 21:52:46,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:46,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270036415] [2025-03-13 21:52:46,709 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:46,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:46,717 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-13 21:52:46,729 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:46,729 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:46,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:46,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270036415] [2025-03-13 21:52:46,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270036415] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:46,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706142935] [2025-03-13 21:52:46,928 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:46,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:46,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:46,929 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-03-13 21:52:46,931 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-03-13 21:52:46,970 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-13 21:52:46,984 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:46,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:46,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:46,985 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:52:46,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:47,083 INFO L378 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 15 treesize of output 7 [2025-03-13 21:52:47,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:47,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:47,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:47,181 INFO L378 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 48 treesize of output 33 [2025-03-13 21:52:47,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:47,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706142935] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:47,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:47,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-13 21:52:47,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699315584] [2025-03-13 21:52:47,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:47,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:52:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:47,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:52:47,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:52:47,253 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:47,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 80 transitions, 844 flow. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-03-13 21:52:47,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:47,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:47,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:47,530 INFO L124 PetriNetUnfolderBase]: 232/414 cut-off events. [2025-03-13 21:52:47,531 INFO L125 PetriNetUnfolderBase]: For 1666/1666 co-relation queries the response was YES. [2025-03-13 21:52:47,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2139 conditions, 414 events. 232/414 cut-off events. For 1666/1666 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1601 event pairs, 22 based on Foata normal form. 1/415 useless extension candidates. Maximal degree in co-relation 2078. Up to 306 conditions per place. [2025-03-13 21:52:47,534 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 63 selfloop transitions, 40 changer transitions 3/107 dead transitions. [2025-03-13 21:52:47,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 107 transitions, 1163 flow [2025-03-13 21:52:47,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:52:47,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:52:47,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2025-03-13 21:52:47,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41363636363636364 [2025-03-13 21:52:47,535 INFO L175 Difference]: Start difference. First operand has 96 places, 80 transitions, 844 flow. Second operand 11 states and 91 transitions. [2025-03-13 21:52:47,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 107 transitions, 1163 flow [2025-03-13 21:52:47,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 1011 flow, removed 31 selfloop flow, removed 14 redundant places. [2025-03-13 21:52:47,542 INFO L231 Difference]: Finished difference. Result has 87 places, 85 transitions, 848 flow [2025-03-13 21:52:47,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=848, PETRI_PLACES=87, PETRI_TRANSITIONS=85} [2025-03-13 21:52:47,542 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 66 predicate places. [2025-03-13 21:52:47,542 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 85 transitions, 848 flow [2025-03-13 21:52:47,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 14 states have internal predecessors, (76), 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-03-13 21:52:47,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:47,543 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:47,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-13 21:52:47,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:47,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:47,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:47,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1269177040, now seen corresponding path program 3 times [2025-03-13 21:52:47,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:47,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201160637] [2025-03-13 21:52:47,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:47,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:47,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-13 21:52:47,761 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:47,761 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:47,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:47,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:47,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201160637] [2025-03-13 21:52:47,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201160637] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:47,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120577719] [2025-03-13 21:52:47,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:47,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:47,902 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-03-13 21:52:47,903 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-03-13 21:52:47,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-13 21:52:47,948 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 21:52:47,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:47,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:47,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-13 21:52:47,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:48,056 INFO L378 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 15 treesize of output 7 [2025-03-13 21:52:48,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:48,061 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:48,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:48,118 INFO L378 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 77 treesize of output 69 [2025-03-13 21:52:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120577719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:48,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-13 21:52:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941172568] [2025-03-13 21:52:48,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:48,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:52:48,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:48,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:52:48,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:52:48,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:48,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 85 transitions, 848 flow. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-03-13 21:52:48,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:48,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:48,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:48,468 INFO L124 PetriNetUnfolderBase]: 242/459 cut-off events. [2025-03-13 21:52:48,468 INFO L125 PetriNetUnfolderBase]: For 1704/1704 co-relation queries the response was YES. [2025-03-13 21:52:48,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2219 conditions, 459 events. 242/459 cut-off events. For 1704/1704 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 1971 event pairs, 0 based on Foata normal form. 1/460 useless extension candidates. Maximal degree in co-relation 2139. Up to 234 conditions per place. [2025-03-13 21:52:48,472 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 69 selfloop transitions, 52 changer transitions 8/130 dead transitions. [2025-03-13 21:52:48,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 130 transitions, 1372 flow [2025-03-13 21:52:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:52:48,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:52:48,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 107 transitions. [2025-03-13 21:52:48,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3821428571428571 [2025-03-13 21:52:48,473 INFO L175 Difference]: Start difference. First operand has 87 places, 85 transitions, 848 flow. Second operand 14 states and 107 transitions. [2025-03-13 21:52:48,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 130 transitions, 1372 flow [2025-03-13 21:52:48,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 130 transitions, 1219 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-03-13 21:52:48,479 INFO L231 Difference]: Finished difference. Result has 92 places, 98 transitions, 980 flow [2025-03-13 21:52:48,479 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=39, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=980, PETRI_PLACES=92, PETRI_TRANSITIONS=98} [2025-03-13 21:52:48,479 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 71 predicate places. [2025-03-13 21:52:48,479 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 98 transitions, 980 flow [2025-03-13 21:52:48,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 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-03-13 21:52:48,480 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:48,480 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:48,485 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-03-13 21:52:48,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:48,680 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:48,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:48,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1403750990, now seen corresponding path program 4 times [2025-03-13 21:52:48,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:48,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623678905] [2025-03-13 21:52:48,681 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:48,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:48,685 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:48,692 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:48,692 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:48,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:48,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623678905] [2025-03-13 21:52:48,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623678905] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:48,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648300720] [2025-03-13 21:52:48,839 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:48,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:48,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:48,841 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-03-13 21:52:48,843 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-03-13 21:52:48,889 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:48,902 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:48,902 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:48,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:48,903 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:52:48,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:48,926 INFO L378 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-03-13 21:52:49,074 INFO L378 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 15 treesize of output 7 [2025-03-13 21:52:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:49,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:49,457 INFO L378 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 33 treesize of output 29 [2025-03-13 21:52:49,463 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:49,464 INFO L378 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 62 treesize of output 41 [2025-03-13 21:52:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:49,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648300720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:49,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:49,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 22 [2025-03-13 21:52:49,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752992485] [2025-03-13 21:52:49,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:49,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-13 21:52:49,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:49,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-13 21:52:49,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2025-03-13 21:52:49,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:49,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 98 transitions, 980 flow. Second operand has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 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-03-13 21:52:49,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:49,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:49,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:51,154 INFO L124 PetriNetUnfolderBase]: 426/838 cut-off events. [2025-03-13 21:52:51,154 INFO L125 PetriNetUnfolderBase]: For 2948/2948 co-relation queries the response was YES. [2025-03-13 21:52:51,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4101 conditions, 838 events. 426/838 cut-off events. For 2948/2948 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 4354 event pairs, 16 based on Foata normal form. 33/871 useless extension candidates. Maximal degree in co-relation 4007. Up to 233 conditions per place. [2025-03-13 21:52:51,159 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 115 selfloop transitions, 66 changer transitions 101/283 dead transitions. [2025-03-13 21:52:51,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 283 transitions, 2748 flow [2025-03-13 21:52:51,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-13 21:52:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-13 21:52:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 321 transitions. [2025-03-13 21:52:51,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47205882352941175 [2025-03-13 21:52:51,161 INFO L175 Difference]: Start difference. First operand has 92 places, 98 transitions, 980 flow. Second operand 34 states and 321 transitions. [2025-03-13 21:52:51,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 283 transitions, 2748 flow [2025-03-13 21:52:51,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 283 transitions, 2604 flow, removed 41 selfloop flow, removed 12 redundant places. [2025-03-13 21:52:51,173 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 1068 flow [2025-03-13 21:52:51,174 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=899, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=1068, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2025-03-13 21:52:51,174 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 99 predicate places. [2025-03-13 21:52:51,174 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 1068 flow [2025-03-13 21:52:51,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.0) internal successors, (110), 22 states have internal predecessors, (110), 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-03-13 21:52:51,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:51,174 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:51,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 21:52:51,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-13 21:52:51,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:51,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:51,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1914007222, now seen corresponding path program 5 times [2025-03-13 21:52:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695310612] [2025-03-13 21:52:51,377 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:51,382 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:51,390 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:51,391 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:51,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:51,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695310612] [2025-03-13 21:52:51,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695310612] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:51,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745810681] [2025-03-13 21:52:51,473 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:51,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:51,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:51,475 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-03-13 21:52:51,476 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-03-13 21:52:51,512 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:51,525 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:51,525 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:51,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:51,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-13 21:52:51,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:51,548 INFO L378 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-03-13 21:52:51,668 INFO L378 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 15 treesize of output 7 [2025-03-13 21:52:51,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:51,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:52,121 INFO L378 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 33 treesize of output 29 [2025-03-13 21:52:52,130 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:52,131 INFO L378 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 62 treesize of output 41 [2025-03-13 21:52:52,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:52,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745810681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:52,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 21 [2025-03-13 21:52:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677374610] [2025-03-13 21:52:52,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-13 21:52:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:52,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-13 21:52:52,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=335, Unknown=0, NotChecked=0, Total=420 [2025-03-13 21:52:52,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:52,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 1068 flow. Second operand has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 21 states have internal predecessors, (107), 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-03-13 21:52:52,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:52,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:52,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:53,417 INFO L124 PetriNetUnfolderBase]: 301/632 cut-off events. [2025-03-13 21:52:53,417 INFO L125 PetriNetUnfolderBase]: For 3033/3033 co-relation queries the response was YES. [2025-03-13 21:52:53,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 632 events. 301/632 cut-off events. For 3033/3033 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3223 event pairs, 7 based on Foata normal form. 10/641 useless extension candidates. Maximal degree in co-relation 3201. Up to 211 conditions per place. [2025-03-13 21:52:53,421 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 107 selfloop transitions, 53 changer transitions 32/193 dead transitions. [2025-03-13 21:52:53,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 193 transitions, 2055 flow [2025-03-13 21:52:53,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-13 21:52:53,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2025-03-13 21:52:53,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 235 transitions. [2025-03-13 21:52:53,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3671875 [2025-03-13 21:52:53,423 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 1068 flow. Second operand 32 states and 235 transitions. [2025-03-13 21:52:53,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 193 transitions, 2055 flow [2025-03-13 21:52:53,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 193 transitions, 1801 flow, removed 90 selfloop flow, removed 19 redundant places. [2025-03-13 21:52:53,433 INFO L231 Difference]: Finished difference. Result has 127 places, 107 transitions, 1143 flow [2025-03-13 21:52:53,434 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=1143, PETRI_PLACES=127, PETRI_TRANSITIONS=107} [2025-03-13 21:52:53,434 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 106 predicate places. [2025-03-13 21:52:53,434 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 107 transitions, 1143 flow [2025-03-13 21:52:53,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.095238095238095) internal successors, (107), 21 states have internal predecessors, (107), 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-03-13 21:52:53,434 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:53,434 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:53,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-13 21:52:53,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:53,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:53,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:53,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1448648492, now seen corresponding path program 6 times [2025-03-13 21:52:53,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:53,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081006693] [2025-03-13 21:52:53,639 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:53,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:53,643 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:53,650 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:53,650 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:52:53,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:53,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:52:53,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081006693] [2025-03-13 21:52:53,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081006693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:53,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803235823] [2025-03-13 21:52:53,733 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:53,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:53,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:53,735 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-03-13 21:52:53,737 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-03-13 21:52:53,769 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:53,782 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:53,782 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:52:53,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:53,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-13 21:52:53,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:53,811 INFO L378 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-03-13 21:52:53,931 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-13 21:52:53,932 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2025-03-13 21:52:53,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:53,955 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:54,181 INFO L378 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 130 treesize of output 116 [2025-03-13 21:52:54,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:52:54,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 286 treesize of output 240 [2025-03-13 21:52:55,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:52:55,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803235823] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:55,202 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:55,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-13 21:52:55,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068032531] [2025-03-13 21:52:55,202 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:55,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 21:52:55,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:55,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 21:52:55,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2025-03-13 21:52:55,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:55,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 107 transitions, 1143 flow. Second operand has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-03-13 21:52:55,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:55,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:55,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:55,833 INFO L124 PetriNetUnfolderBase]: 369/707 cut-off events. [2025-03-13 21:52:55,833 INFO L125 PetriNetUnfolderBase]: For 3283/3283 co-relation queries the response was YES. [2025-03-13 21:52:55,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3773 conditions, 707 events. 369/707 cut-off events. For 3283/3283 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3329 event pairs, 11 based on Foata normal form. 13/719 useless extension candidates. Maximal degree in co-relation 3740. Up to 226 conditions per place. [2025-03-13 21:52:55,839 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 66 selfloop transitions, 84 changer transitions 35/186 dead transitions. [2025-03-13 21:52:55,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 186 transitions, 2020 flow [2025-03-13 21:52:55,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 21:52:55,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 21:52:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 215 transitions. [2025-03-13 21:52:55,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.35833333333333334 [2025-03-13 21:52:55,841 INFO L175 Difference]: Start difference. First operand has 127 places, 107 transitions, 1143 flow. Second operand 30 states and 215 transitions. [2025-03-13 21:52:55,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 186 transitions, 2020 flow [2025-03-13 21:52:55,848 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 186 transitions, 1902 flow, removed 19 selfloop flow, removed 14 redundant places. [2025-03-13 21:52:55,852 INFO L231 Difference]: Finished difference. Result has 135 places, 121 transitions, 1443 flow [2025-03-13 21:52:55,852 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=984, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1443, PETRI_PLACES=135, PETRI_TRANSITIONS=121} [2025-03-13 21:52:55,853 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 114 predicate places. [2025-03-13 21:52:55,853 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 121 transitions, 1443 flow [2025-03-13 21:52:55,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.526315789473684) internal successors, (105), 19 states have internal predecessors, (105), 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-03-13 21:52:55,853 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:55,853 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:55,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:56,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:56,055 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:56,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 207597458, now seen corresponding path program 2 times [2025-03-13 21:52:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106152326] [2025-03-13 21:52:56,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:56,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:56,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:56,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:56,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:56,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:56,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106152326] [2025-03-13 21:52:56,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106152326] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:56,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844964003] [2025-03-13 21:52:56,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:52:56,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:56,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:56,162 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-03-13 21:52:56,163 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-03-13 21:52:56,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:56,250 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:56,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:56,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:56,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:52:56,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:56,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:56,287 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:56,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844964003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:56,386 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:56,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:52:56,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673286499] [2025-03-13 21:52:56,387 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:56,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:56,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:56,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:56,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:56,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:56,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 121 transitions, 1443 flow. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-03-13 21:52:56,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:56,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:56,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:56,762 INFO L124 PetriNetUnfolderBase]: 434/799 cut-off events. [2025-03-13 21:52:56,762 INFO L125 PetriNetUnfolderBase]: For 4193/4193 co-relation queries the response was YES. [2025-03-13 21:52:56,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4696 conditions, 799 events. 434/799 cut-off events. For 4193/4193 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 3805 event pairs, 80 based on Foata normal form. 12/810 useless extension candidates. Maximal degree in co-relation 4660. Up to 412 conditions per place. [2025-03-13 21:52:56,767 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 153 selfloop transitions, 70 changer transitions 1/225 dead transitions. [2025-03-13 21:52:56,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 225 transitions, 2822 flow [2025-03-13 21:52:56,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:52:56,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:52:56,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 140 transitions. [2025-03-13 21:52:56,769 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-13 21:52:56,769 INFO L175 Difference]: Start difference. First operand has 135 places, 121 transitions, 1443 flow. Second operand 14 states and 140 transitions. [2025-03-13 21:52:56,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 225 transitions, 2822 flow [2025-03-13 21:52:56,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 225 transitions, 2218 flow, removed 189 selfloop flow, removed 17 redundant places. [2025-03-13 21:52:56,785 INFO L231 Difference]: Finished difference. Result has 113 places, 162 transitions, 1690 flow [2025-03-13 21:52:56,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1039, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1690, PETRI_PLACES=113, PETRI_TRANSITIONS=162} [2025-03-13 21:52:56,786 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 92 predicate places. [2025-03-13 21:52:56,786 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 162 transitions, 1690 flow [2025-03-13 21:52:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-03-13 21:52:56,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:56,787 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:56,793 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-03-13 21:52:56,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 21:52:56,991 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:56,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:56,991 INFO L85 PathProgramCache]: Analyzing trace with hash 300181376, now seen corresponding path program 3 times [2025-03-13 21:52:56,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:56,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691732825] [2025-03-13 21:52:56,991 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:56,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:57,005 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:57,008 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:57,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691732825] [2025-03-13 21:52:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691732825] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739024817] [2025-03-13 21:52:57,098 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:52:57,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:57,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:57,100 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-03-13 21:52:57,102 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-03-13 21:52:57,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:57,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:57,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:52:57,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:57,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:52:57,191 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:57,223 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:57,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:57,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:57,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739024817] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:57,328 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:57,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:52:57,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220641184] [2025-03-13 21:52:57,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:57,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:57,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:57,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:57,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:57,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:57,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 162 transitions, 1690 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-03-13 21:52:57,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:57,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:57,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:57,721 INFO L124 PetriNetUnfolderBase]: 431/797 cut-off events. [2025-03-13 21:52:57,721 INFO L125 PetriNetUnfolderBase]: For 3735/3735 co-relation queries the response was YES. [2025-03-13 21:52:57,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4405 conditions, 797 events. 431/797 cut-off events. For 3735/3735 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 3821 event pairs, 81 based on Foata normal form. 15/811 useless extension candidates. Maximal degree in co-relation 4365. Up to 416 conditions per place. [2025-03-13 21:52:57,727 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 154 selfloop transitions, 70 changer transitions 1/226 dead transitions. [2025-03-13 21:52:57,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 226 transitions, 2548 flow [2025-03-13 21:52:57,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:52:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:52:57,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 153 transitions. [2025-03-13 21:52:57,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.45 [2025-03-13 21:52:57,728 INFO L175 Difference]: Start difference. First operand has 113 places, 162 transitions, 1690 flow. Second operand 17 states and 153 transitions. [2025-03-13 21:52:57,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 226 transitions, 2548 flow [2025-03-13 21:52:57,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 226 transitions, 2407 flow, removed 67 selfloop flow, removed 1 redundant places. [2025-03-13 21:52:57,744 INFO L231 Difference]: Finished difference. Result has 130 places, 165 transitions, 1760 flow [2025-03-13 21:52:57,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1760, PETRI_PLACES=130, PETRI_TRANSITIONS=165} [2025-03-13 21:52:57,745 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 109 predicate places. [2025-03-13 21:52:57,745 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 165 transitions, 1760 flow [2025-03-13 21:52:57,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-03-13 21:52:57,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:57,745 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:57,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-13 21:52:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-13 21:52:57,946 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:57,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1805435074, now seen corresponding path program 4 times [2025-03-13 21:52:57,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:57,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282239620] [2025-03-13 21:52:57,948 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:57,953 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:57,959 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:57,959 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:57,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:58,033 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:58,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282239620] [2025-03-13 21:52:58,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282239620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:58,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245847220] [2025-03-13 21:52:58,034 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:52:58,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:58,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:58,036 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-03-13 21:52:58,037 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-03-13 21:52:58,072 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:58,111 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:58,111 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:52:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:58,112 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:52:58,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:58,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:58,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:58,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245847220] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:58,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:58,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:52:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313498694] [2025-03-13 21:52:58,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:58,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:58,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:58,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:58,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:58,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 165 transitions, 1760 flow. Second operand has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-03-13 21:52:58,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:58,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:58,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:58,619 INFO L124 PetriNetUnfolderBase]: 499/921 cut-off events. [2025-03-13 21:52:58,619 INFO L125 PetriNetUnfolderBase]: For 4745/4745 co-relation queries the response was YES. [2025-03-13 21:52:58,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5238 conditions, 921 events. 499/921 cut-off events. For 4745/4745 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 4573 event pairs, 68 based on Foata normal form. 15/935 useless extension candidates. Maximal degree in co-relation 5195. Up to 344 conditions per place. [2025-03-13 21:52:58,625 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 134 selfloop transitions, 109 changer transitions 1/245 dead transitions. [2025-03-13 21:52:58,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 245 transitions, 2909 flow [2025-03-13 21:52:58,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:52:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:52:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 138 transitions. [2025-03-13 21:52:58,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.40588235294117647 [2025-03-13 21:52:58,629 INFO L175 Difference]: Start difference. First operand has 130 places, 165 transitions, 1760 flow. Second operand 17 states and 138 transitions. [2025-03-13 21:52:58,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 245 transitions, 2909 flow [2025-03-13 21:52:58,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 245 transitions, 2794 flow, removed 19 selfloop flow, removed 9 redundant places. [2025-03-13 21:52:58,647 INFO L231 Difference]: Finished difference. Result has 141 places, 200 transitions, 2355 flow [2025-03-13 21:52:58,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=1661, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=78, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=2355, PETRI_PLACES=141, PETRI_TRANSITIONS=200} [2025-03-13 21:52:58,647 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 120 predicate places. [2025-03-13 21:52:58,647 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 200 transitions, 2355 flow [2025-03-13 21:52:58,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.166666666666667) internal successors, (62), 12 states have internal predecessors, (62), 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-03-13 21:52:58,648 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:58,648 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:58,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:58,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 21:52:58,848 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:58,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:58,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1683817646, now seen corresponding path program 5 times [2025-03-13 21:52:58,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:58,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639199315] [2025-03-13 21:52:58,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:58,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:58,853 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:58,858 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:58,858 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:58,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639199315] [2025-03-13 21:52:58,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639199315] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:58,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1438929292] [2025-03-13 21:52:58,933 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:52:58,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:58,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:58,935 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-03-13 21:52:58,936 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-03-13 21:52:58,974 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:59,027 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:59,028 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:52:59,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:59,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:52:59,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:59,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:59,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:59,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1438929292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:59,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:59,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:52:59,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417990555] [2025-03-13 21:52:59,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:59,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:59,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:59,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:59,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:59,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:59,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 200 transitions, 2355 flow. Second operand has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-03-13 21:52:59,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:59,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:59,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:52:59,452 INFO L124 PetriNetUnfolderBase]: 610/1122 cut-off events. [2025-03-13 21:52:59,452 INFO L125 PetriNetUnfolderBase]: For 7738/7738 co-relation queries the response was YES. [2025-03-13 21:52:59,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 1122 events. 610/1122 cut-off events. For 7738/7738 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 5931 event pairs, 91 based on Foata normal form. 12/1133 useless extension candidates. Maximal degree in co-relation 7000. Up to 597 conditions per place. [2025-03-13 21:52:59,459 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 158 selfloop transitions, 118 changer transitions 2/279 dead transitions. [2025-03-13 21:52:59,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 279 transitions, 3711 flow [2025-03-13 21:52:59,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-13 21:52:59,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-13 21:52:59,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 131 transitions. [2025-03-13 21:52:59,460 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46785714285714286 [2025-03-13 21:52:59,460 INFO L175 Difference]: Start difference. First operand has 141 places, 200 transitions, 2355 flow. Second operand 14 states and 131 transitions. [2025-03-13 21:52:59,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 279 transitions, 3711 flow [2025-03-13 21:52:59,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 279 transitions, 3506 flow, removed 96 selfloop flow, removed 3 redundant places. [2025-03-13 21:52:59,490 INFO L231 Difference]: Finished difference. Result has 156 places, 237 transitions, 3076 flow [2025-03-13 21:52:59,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2176, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3076, PETRI_PLACES=156, PETRI_TRANSITIONS=237} [2025-03-13 21:52:59,490 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 135 predicate places. [2025-03-13 21:52:59,490 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 237 transitions, 3076 flow [2025-03-13 21:52:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.916666666666667) internal successors, (59), 12 states have internal predecessors, (59), 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-03-13 21:52:59,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:52:59,490 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:52:59,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-13 21:52:59,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-13 21:52:59,691 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:52:59,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:52:59,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1760678426, now seen corresponding path program 6 times [2025-03-13 21:52:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:52:59,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19728072] [2025-03-13 21:52:59,691 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:59,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:52:59,695 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:59,702 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:59,702 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:52:59,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:59,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:59,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:52:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19728072] [2025-03-13 21:52:59,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19728072] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:52:59,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265899310] [2025-03-13 21:52:59,779 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:52:59,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:52:59,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:52:59,781 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-03-13 21:52:59,782 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-03-13 21:52:59,818 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:52:59,840 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:52:59,841 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:52:59,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:52:59,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:52:59,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:52:59,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:59,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:52:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:52:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265899310] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:52:59,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:52:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:52:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530618951] [2025-03-13 21:52:59,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:52:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:52:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:52:59,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:52:59,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:52:59,955 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:52:59,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 237 transitions, 3076 flow. Second operand has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-03-13 21:52:59,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:52:59,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:52:59,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:00,258 INFO L124 PetriNetUnfolderBase]: 602/1112 cut-off events. [2025-03-13 21:53:00,258 INFO L125 PetriNetUnfolderBase]: For 9981/9981 co-relation queries the response was YES. [2025-03-13 21:53:00,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7374 conditions, 1112 events. 602/1112 cut-off events. For 9981/9981 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 5859 event pairs, 93 based on Foata normal form. 15/1126 useless extension candidates. Maximal degree in co-relation 7323. Up to 609 conditions per place. [2025-03-13 21:53:00,274 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 157 selfloop transitions, 115 changer transitions 2/275 dead transitions. [2025-03-13 21:53:00,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 275 transitions, 3853 flow [2025-03-13 21:53:00,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-13 21:53:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-13 21:53:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 130 transitions. [2025-03-13 21:53:00,276 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43333333333333335 [2025-03-13 21:53:00,276 INFO L175 Difference]: Start difference. First operand has 156 places, 237 transitions, 3076 flow. Second operand 15 states and 130 transitions. [2025-03-13 21:53:00,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 275 transitions, 3853 flow [2025-03-13 21:53:00,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 275 transitions, 3632 flow, removed 85 selfloop flow, removed 5 redundant places. [2025-03-13 21:53:00,315 INFO L231 Difference]: Finished difference. Result has 167 places, 238 transitions, 3147 flow [2025-03-13 21:53:00,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2786, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=110, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=3147, PETRI_PLACES=167, PETRI_TRANSITIONS=238} [2025-03-13 21:53:00,315 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 146 predicate places. [2025-03-13 21:53:00,315 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 238 transitions, 3147 flow [2025-03-13 21:53:00,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.083333333333333) internal successors, (61), 12 states have internal predecessors, (61), 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-03-13 21:53:00,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:00,316 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:00,321 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-03-13 21:53:00,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:00,520 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:00,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:00,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1702251672, now seen corresponding path program 7 times [2025-03-13 21:53:00,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:00,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712065629] [2025-03-13 21:53:00,520 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:53:00,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:00,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:53:00,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:00,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:00,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:00,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712065629] [2025-03-13 21:53:00,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712065629] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:00,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855083561] [2025-03-13 21:53:00,601 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:53:00,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:00,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:00,603 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-03-13 21:53:00,604 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-03-13 21:53:00,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-13 21:53:00,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:00,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:00,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:00,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:00,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:00,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:00,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:00,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1855083561] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:00,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:53:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711037765] [2025-03-13 21:53:00,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:00,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:53:00,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:00,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:53:00,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:53:00,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:00,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 238 transitions, 3147 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-03-13 21:53:00,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:00,777 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:00,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:01,283 INFO L124 PetriNetUnfolderBase]: 907/1729 cut-off events. [2025-03-13 21:53:01,283 INFO L125 PetriNetUnfolderBase]: For 18709/18709 co-relation queries the response was YES. [2025-03-13 21:53:01,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11733 conditions, 1729 events. 907/1729 cut-off events. For 18709/18709 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10234 event pairs, 50 based on Foata normal form. 14/1742 useless extension candidates. Maximal degree in co-relation 11680. Up to 532 conditions per place. [2025-03-13 21:53:01,295 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 200 selfloop transitions, 209 changer transitions 0/410 dead transitions. [2025-03-13 21:53:01,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 410 transitions, 5962 flow [2025-03-13 21:53:01,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:53:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:53:01,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 178 transitions. [2025-03-13 21:53:01,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49444444444444446 [2025-03-13 21:53:01,296 INFO L175 Difference]: Start difference. First operand has 167 places, 238 transitions, 3147 flow. Second operand 18 states and 178 transitions. [2025-03-13 21:53:01,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 410 transitions, 5962 flow [2025-03-13 21:53:01,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 410 transitions, 5805 flow, removed 16 selfloop flow, removed 8 redundant places. [2025-03-13 21:53:01,354 INFO L231 Difference]: Finished difference. Result has 187 places, 320 transitions, 4951 flow [2025-03-13 21:53:01,354 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=2976, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=4951, PETRI_PLACES=187, PETRI_TRANSITIONS=320} [2025-03-13 21:53:01,354 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 166 predicate places. [2025-03-13 21:53:01,354 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 320 transitions, 4951 flow [2025-03-13 21:53:01,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-03-13 21:53:01,355 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:01,355 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:01,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-13 21:53:01,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2025-03-13 21:53:01,555 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:01,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:01,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1733246448, now seen corresponding path program 8 times [2025-03-13 21:53:01,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:01,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490610512] [2025-03-13 21:53:01,556 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:01,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:01,559 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:53:01,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:01,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:01,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:01,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:01,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:01,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490610512] [2025-03-13 21:53:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490610512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977159495] [2025-03-13 21:53:01,643 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:01,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:01,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:01,644 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-03-13 21:53:01,646 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-03-13 21:53:01,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:53:01,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:01,712 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:01,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:01,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:01,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:01,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:01,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:01,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:01,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977159495] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:01,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:01,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:53:01,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739483370] [2025-03-13 21:53:01,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:01,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:53:01,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:01,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:53:01,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:53:01,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:01,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 320 transitions, 4951 flow. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-03-13 21:53:01,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:01,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:01,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:02,243 INFO L124 PetriNetUnfolderBase]: 979/1855 cut-off events. [2025-03-13 21:53:02,243 INFO L125 PetriNetUnfolderBase]: For 27543/27543 co-relation queries the response was YES. [2025-03-13 21:53:02,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14394 conditions, 1855 events. 979/1855 cut-off events. For 27543/27543 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10999 event pairs, 22 based on Foata normal form. 6/1860 useless extension candidates. Maximal degree in co-relation 14330. Up to 633 conditions per place. [2025-03-13 21:53:02,256 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 215 selfloop transitions, 197 changer transitions 0/413 dead transitions. [2025-03-13 21:53:02,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 413 transitions, 7040 flow [2025-03-13 21:53:02,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:53:02,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:53:02,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 153 transitions. [2025-03-13 21:53:02,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.478125 [2025-03-13 21:53:02,258 INFO L175 Difference]: Start difference. First operand has 187 places, 320 transitions, 4951 flow. Second operand 16 states and 153 transitions. [2025-03-13 21:53:02,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 413 transitions, 7040 flow [2025-03-13 21:53:02,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 413 transitions, 6487 flow, removed 229 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:02,356 INFO L231 Difference]: Finished difference. Result has 203 places, 337 transitions, 5325 flow [2025-03-13 21:53:02,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=4486, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=181, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=5325, PETRI_PLACES=203, PETRI_TRANSITIONS=337} [2025-03-13 21:53:02,356 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 182 predicate places. [2025-03-13 21:53:02,356 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 337 transitions, 5325 flow [2025-03-13 21:53:02,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 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-03-13 21:53:02,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:02,357 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:02,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-13 21:53:02,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:02,557 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:02,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1779112452, now seen corresponding path program 9 times [2025-03-13 21:53:02,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:02,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392090687] [2025-03-13 21:53:02,558 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:02,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:02,561 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:53:02,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:02,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:02,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:02,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392090687] [2025-03-13 21:53:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392090687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:02,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [592742006] [2025-03-13 21:53:02,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:02,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:02,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:02,666 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-03-13 21:53:02,668 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-03-13 21:53:02,705 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-03-13 21:53:02,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-03-13 21:53:02,768 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:02,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:02,769 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:02,770 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:02,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:02,818 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:02,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [592742006] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:02,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:02,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-13 21:53:02,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856041276] [2025-03-13 21:53:02,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:02,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-13 21:53:02,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:02,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-13 21:53:02,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:53:02,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:02,886 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 337 transitions, 5325 flow. Second operand has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-03-13 21:53:02,886 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:02,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:03,371 INFO L124 PetriNetUnfolderBase]: 1021/1939 cut-off events. [2025-03-13 21:53:03,371 INFO L125 PetriNetUnfolderBase]: For 31899/31899 co-relation queries the response was YES. [2025-03-13 21:53:03,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15073 conditions, 1939 events. 1021/1939 cut-off events. For 31899/31899 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11649 event pairs, 68 based on Foata normal form. 9/1947 useless extension candidates. Maximal degree in co-relation 15005. Up to 735 conditions per place. [2025-03-13 21:53:03,384 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 191 selfloop transitions, 220 changer transitions 0/412 dead transitions. [2025-03-13 21:53:03,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 412 transitions, 6973 flow [2025-03-13 21:53:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-13 21:53:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-03-13 21:53:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 154 transitions. [2025-03-13 21:53:03,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42777777777777776 [2025-03-13 21:53:03,385 INFO L175 Difference]: Start difference. First operand has 203 places, 337 transitions, 5325 flow. Second operand 18 states and 154 transitions. [2025-03-13 21:53:03,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 412 transitions, 6973 flow [2025-03-13 21:53:03,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 412 transitions, 6743 flow, removed 85 selfloop flow, removed 4 redundant places. [2025-03-13 21:53:03,512 INFO L231 Difference]: Finished difference. Result has 221 places, 348 transitions, 5960 flow [2025-03-13 21:53:03,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5055, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=5960, PETRI_PLACES=221, PETRI_TRANSITIONS=348} [2025-03-13 21:53:03,513 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 200 predicate places. [2025-03-13 21:53:03,513 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 348 transitions, 5960 flow [2025-03-13 21:53:03,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.0) internal successors, (65), 13 states have internal predecessors, (65), 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-03-13 21:53:03,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:03,513 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:03,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:03,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:03,714 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:03,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:03,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1054123996, now seen corresponding path program 1 times [2025-03-13 21:53:03,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:03,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734161862] [2025-03-13 21:53:03,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:03,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:03,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:53:03,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:03,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:03,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734161862] [2025-03-13 21:53:03,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734161862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:03,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35514772] [2025-03-13 21:53:03,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:53:03,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:03,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:03,842 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-03-13 21:53:03,844 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-03-13 21:53:03,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:53:03,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:03,905 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:03,905 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:03,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:03,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:03,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:04,009 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:04,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35514772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:04,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:04,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 10 [2025-03-13 21:53:04,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962099540] [2025-03-13 21:53:04,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:04,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 21:53:04,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:04,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 21:53:04,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-13 21:53:04,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:04,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 348 transitions, 5960 flow. Second operand has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-03-13 21:53:04,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:04,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:04,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:04,409 INFO L124 PetriNetUnfolderBase]: 947/1826 cut-off events. [2025-03-13 21:53:04,409 INFO L125 PetriNetUnfolderBase]: For 33322/33322 co-relation queries the response was YES. [2025-03-13 21:53:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14698 conditions, 1826 events. 947/1826 cut-off events. For 33322/33322 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 10927 event pairs, 134 based on Foata normal form. 45/1870 useless extension candidates. Maximal degree in co-relation 14626. Up to 622 conditions per place. [2025-03-13 21:53:04,420 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 221 selfloop transitions, 152 changer transitions 13/387 dead transitions. [2025-03-13 21:53:04,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 387 transitions, 7175 flow [2025-03-13 21:53:04,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 21:53:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 21:53:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 86 transitions. [2025-03-13 21:53:04,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2025-03-13 21:53:04,421 INFO L175 Difference]: Start difference. First operand has 221 places, 348 transitions, 5960 flow. Second operand 9 states and 86 transitions. [2025-03-13 21:53:04,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 387 transitions, 7175 flow [2025-03-13 21:53:04,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 387 transitions, 7004 flow, removed 43 selfloop flow, removed 7 redundant places. [2025-03-13 21:53:04,545 INFO L231 Difference]: Finished difference. Result has 224 places, 340 transitions, 6168 flow [2025-03-13 21:53:04,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5375, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=6168, PETRI_PLACES=224, PETRI_TRANSITIONS=340} [2025-03-13 21:53:04,546 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 203 predicate places. [2025-03-13 21:53:04,546 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 340 transitions, 6168 flow [2025-03-13 21:53:04,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.6) internal successors, (56), 10 states have internal predecessors, (56), 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-03-13 21:53:04,546 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:04,547 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:04,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:04,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-13 21:53:04,747 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:04,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:04,748 INFO L85 PathProgramCache]: Analyzing trace with hash 905351333, now seen corresponding path program 7 times [2025-03-13 21:53:04,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:04,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338881325] [2025-03-13 21:53:04,748 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:53:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:04,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:53:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:04,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:04,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:04,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:04,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338881325] [2025-03-13 21:53:04,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338881325] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:04,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120222201] [2025-03-13 21:53:04,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-13 21:53:04,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:04,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:04,858 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-03-13 21:53:04,860 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-03-13 21:53:04,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-13 21:53:04,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:04,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:53:04,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:04,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:04,922 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:04,958 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:04,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:05,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120222201] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:05,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:53:05,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 13 [2025-03-13 21:53:05,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456205770] [2025-03-13 21:53:05,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:05,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:05,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:05,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:05,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:53:05,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:05,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 340 transitions, 6168 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-13 21:53:05,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:05,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:05,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:05,320 INFO L124 PetriNetUnfolderBase]: 962/1907 cut-off events. [2025-03-13 21:53:05,320 INFO L125 PetriNetUnfolderBase]: For 37452/37452 co-relation queries the response was YES. [2025-03-13 21:53:05,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16068 conditions, 1907 events. 962/1907 cut-off events. For 37452/37452 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11794 event pairs, 47 based on Foata normal form. 10/1916 useless extension candidates. Maximal degree in co-relation 15994. Up to 1098 conditions per place. [2025-03-13 21:53:05,334 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 259 selfloop transitions, 113 changer transitions 0/373 dead transitions. [2025-03-13 21:53:05,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 373 transitions, 7334 flow [2025-03-13 21:53:05,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:05,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2025-03-13 21:53:05,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59 [2025-03-13 21:53:05,335 INFO L175 Difference]: Start difference. First operand has 224 places, 340 transitions, 6168 flow. Second operand 5 states and 59 transitions. [2025-03-13 21:53:05,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 373 transitions, 7334 flow [2025-03-13 21:53:05,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 373 transitions, 7028 flow, removed 71 selfloop flow, removed 6 redundant places. [2025-03-13 21:53:05,468 INFO L231 Difference]: Finished difference. Result has 223 places, 357 transitions, 6660 flow [2025-03-13 21:53:05,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=5882, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=97, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6660, PETRI_PLACES=223, PETRI_TRANSITIONS=357} [2025-03-13 21:53:05,468 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 202 predicate places. [2025-03-13 21:53:05,468 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 357 transitions, 6660 flow [2025-03-13 21:53:05,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-13 21:53:05,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:05,469 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:05,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:05,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:05,670 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash 481823505, now seen corresponding path program 8 times [2025-03-13 21:53:05,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:05,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433672133] [2025-03-13 21:53:05,670 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:05,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:05,679 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:05,679 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:05,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:05,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:05,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433672133] [2025-03-13 21:53:05,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433672133] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:05,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693201491] [2025-03-13 21:53:05,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:05,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:05,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:05,770 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-03-13 21:53:05,771 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-03-13 21:53:05,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:05,841 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:05,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:05,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:05,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:05,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:05,889 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:05,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:05,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693201491] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-13 21:53:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 13 [2025-03-13 21:53:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854053635] [2025-03-13 21:53:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:53:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 21:53:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:05,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 21:53:05,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-13 21:53:05,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:05,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 357 transitions, 6660 flow. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-13 21:53:05,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:05,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:05,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:06,271 INFO L124 PetriNetUnfolderBase]: 958/1887 cut-off events. [2025-03-13 21:53:06,271 INFO L125 PetriNetUnfolderBase]: For 40285/40285 co-relation queries the response was YES. [2025-03-13 21:53:06,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16075 conditions, 1887 events. 958/1887 cut-off events. For 40285/40285 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11561 event pairs, 83 based on Foata normal form. 4/1890 useless extension candidates. Maximal degree in co-relation 16000. Up to 1046 conditions per place. [2025-03-13 21:53:06,282 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 294 selfloop transitions, 67 changer transitions 1/363 dead transitions. [2025-03-13 21:53:06,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 363 transitions, 7422 flow [2025-03-13 21:53:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 21:53:06,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 21:53:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2025-03-13 21:53:06,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53 [2025-03-13 21:53:06,283 INFO L175 Difference]: Start difference. First operand has 223 places, 357 transitions, 6660 flow. Second operand 5 states and 53 transitions. [2025-03-13 21:53:06,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 363 transitions, 7422 flow [2025-03-13 21:53:06,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 363 transitions, 7376 flow, removed 23 selfloop flow, removed 0 redundant places. [2025-03-13 21:53:06,451 INFO L231 Difference]: Finished difference. Result has 227 places, 354 transitions, 6723 flow [2025-03-13 21:53:06,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=6571, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6723, PETRI_PLACES=227, PETRI_TRANSITIONS=354} [2025-03-13 21:53:06,452 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 206 predicate places. [2025-03-13 21:53:06,453 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 354 transitions, 6723 flow [2025-03-13 21:53:06,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 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-03-13 21:53:06,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:06,453 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:06,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-13 21:53:06,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:06,653 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:06,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:06,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1242143, now seen corresponding path program 10 times [2025-03-13 21:53:06,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:06,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023283336] [2025-03-13 21:53:06,654 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:06,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:06,658 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:06,663 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:06,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:06,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:06,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:06,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023283336] [2025-03-13 21:53:06,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023283336] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:06,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1963126145] [2025-03-13 21:53:06,750 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:06,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:06,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:06,752 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-03-13 21:53:06,753 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-03-13 21:53:06,793 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:06,817 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:06,817 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:06,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:06,818 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:53:06,819 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:06,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:06,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:06,979 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1963126145] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:06,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:06,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-13 21:53:06,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538416583] [2025-03-13 21:53:06,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:06,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-13 21:53:06,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:06,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-13 21:53:06,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-03-13 21:53:06,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:06,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 354 transitions, 6723 flow. Second operand has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-03-13 21:53:06,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:06,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:06,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:07,947 INFO L124 PetriNetUnfolderBase]: 960/1896 cut-off events. [2025-03-13 21:53:07,947 INFO L125 PetriNetUnfolderBase]: For 41389/41389 co-relation queries the response was YES. [2025-03-13 21:53:07,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16196 conditions, 1896 events. 960/1896 cut-off events. For 41389/41389 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11687 event pairs, 131 based on Foata normal form. 12/1907 useless extension candidates. Maximal degree in co-relation 16119. Up to 663 conditions per place. [2025-03-13 21:53:07,965 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 224 selfloop transitions, 182 changer transitions 2/409 dead transitions. [2025-03-13 21:53:07,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 409 transitions, 8015 flow [2025-03-13 21:53:07,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-13 21:53:07,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-13 21:53:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 136 transitions. [2025-03-13 21:53:07,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4 [2025-03-13 21:53:07,966 INFO L175 Difference]: Start difference. First operand has 227 places, 354 transitions, 6723 flow. Second operand 17 states and 136 transitions. [2025-03-13 21:53:07,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 409 transitions, 8015 flow [2025-03-13 21:53:08,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 409 transitions, 7999 flow, removed 7 selfloop flow, removed 1 redundant places. [2025-03-13 21:53:08,107 INFO L231 Difference]: Finished difference. Result has 244 places, 356 transitions, 7110 flow [2025-03-13 21:53:08,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=6686, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=179, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7110, PETRI_PLACES=244, PETRI_TRANSITIONS=356} [2025-03-13 21:53:08,108 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 223 predicate places. [2025-03-13 21:53:08,108 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 356 transitions, 7110 flow [2025-03-13 21:53:08,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.066666666666666) internal successors, (76), 15 states have internal predecessors, (76), 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-03-13 21:53:08,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:08,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:08,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-13 21:53:08,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:08,308 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:08,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:08,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1778675005, now seen corresponding path program 9 times [2025-03-13 21:53:08,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:08,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98384337] [2025-03-13 21:53:08,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:08,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:08,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:08,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:08,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:08,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:08,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98384337] [2025-03-13 21:53:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98384337] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:08,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049786569] [2025-03-13 21:53:08,388 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:08,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:08,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:08,391 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-03-13 21:53:08,392 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-03-13 21:53:08,433 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:08,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:08,455 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:08,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:08,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:08,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:08,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:08,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:08,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049786569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:08,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:53:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868452955] [2025-03-13 21:53:08,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:08,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:53:08,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:08,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:53:08,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:53:08,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:08,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 356 transitions, 7110 flow. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-03-13 21:53:08,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:08,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:08,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:08,989 INFO L124 PetriNetUnfolderBase]: 1023/2052 cut-off events. [2025-03-13 21:53:08,989 INFO L125 PetriNetUnfolderBase]: For 48499/48499 co-relation queries the response was YES. [2025-03-13 21:53:08,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18029 conditions, 2052 events. 1023/2052 cut-off events. For 48499/48499 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 13100 event pairs, 238 based on Foata normal form. 10/2061 useless extension candidates. Maximal degree in co-relation 17949. Up to 1143 conditions per place. [2025-03-13 21:53:09,006 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 319 selfloop transitions, 102 changer transitions 1/423 dead transitions. [2025-03-13 21:53:09,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 423 transitions, 8864 flow [2025-03-13 21:53:09,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-13 21:53:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-13 21:53:09,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2025-03-13 21:53:09,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2025-03-13 21:53:09,009 INFO L175 Difference]: Start difference. First operand has 244 places, 356 transitions, 7110 flow. Second operand 12 states and 110 transitions. [2025-03-13 21:53:09,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 423 transitions, 8864 flow [2025-03-13 21:53:09,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 423 transitions, 8599 flow, removed 30 selfloop flow, removed 6 redundant places. [2025-03-13 21:53:09,184 INFO L231 Difference]: Finished difference. Result has 250 places, 363 transitions, 7254 flow [2025-03-13 21:53:09,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=6788, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=95, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7254, PETRI_PLACES=250, PETRI_TRANSITIONS=363} [2025-03-13 21:53:09,185 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 229 predicate places. [2025-03-13 21:53:09,185 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 363 transitions, 7254 flow [2025-03-13 21:53:09,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 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-03-13 21:53:09,185 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:09,185 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:09,191 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-03-13 21:53:09,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-13 21:53:09,386 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:09,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:09,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1572767373, now seen corresponding path program 10 times [2025-03-13 21:53:09,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:09,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217577888] [2025-03-13 21:53:09,386 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:09,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:09,390 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:09,397 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:09,398 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:09,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:09,542 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:09,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217577888] [2025-03-13 21:53:09,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217577888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:09,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766332993] [2025-03-13 21:53:09,542 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:09,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:09,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:09,544 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-03-13 21:53:09,545 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-03-13 21:53:09,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:09,600 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:09,600 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:09,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:09,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-13 21:53:09,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:09,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:09,741 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766332993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:09,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 14 [2025-03-13 21:53:09,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642333980] [2025-03-13 21:53:09,741 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 21:53:09,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:09,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 21:53:09,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-13 21:53:09,742 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:09,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 363 transitions, 7254 flow. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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-03-13 21:53:09,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:09,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:09,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:10,582 INFO L124 PetriNetUnfolderBase]: 1048/2085 cut-off events. [2025-03-13 21:53:10,582 INFO L125 PetriNetUnfolderBase]: For 51534/51534 co-relation queries the response was YES. [2025-03-13 21:53:10,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18421 conditions, 2085 events. 1048/2085 cut-off events. For 51534/51534 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13249 event pairs, 187 based on Foata normal form. 18/2102 useless extension candidates. Maximal degree in co-relation 18339. Up to 1057 conditions per place. [2025-03-13 21:53:10,595 INFO L140 encePairwiseOnDemand]: 14/20 looper letters, 286 selfloop transitions, 109 changer transitions 5/401 dead transitions. [2025-03-13 21:53:10,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 401 transitions, 8522 flow [2025-03-13 21:53:10,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-13 21:53:10,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-13 21:53:10,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 124 transitions. [2025-03-13 21:53:10,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3875 [2025-03-13 21:53:10,596 INFO L175 Difference]: Start difference. First operand has 250 places, 363 transitions, 7254 flow. Second operand 16 states and 124 transitions. [2025-03-13 21:53:10,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 401 transitions, 8522 flow [2025-03-13 21:53:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 401 transitions, 8422 flow, removed 11 selfloop flow, removed 6 redundant places. [2025-03-13 21:53:10,741 INFO L231 Difference]: Finished difference. Result has 261 places, 368 transitions, 7611 flow [2025-03-13 21:53:10,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7101, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7611, PETRI_PLACES=261, PETRI_TRANSITIONS=368} [2025-03-13 21:53:10,741 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 240 predicate places. [2025-03-13 21:53:10,741 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 368 transitions, 7611 flow [2025-03-13 21:53:10,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 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-03-13 21:53:10,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:10,742 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:10,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-13 21:53:10,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-13 21:53:10,942 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:10,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:10,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1004450863, now seen corresponding path program 11 times [2025-03-13 21:53:10,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:10,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649431779] [2025-03-13 21:53:10,943 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:10,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:10,946 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:10,954 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:10,954 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:10,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:11,023 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:11,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649431779] [2025-03-13 21:53:11,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649431779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:11,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138182288] [2025-03-13 21:53:11,023 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:53:11,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:11,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:11,025 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-03-13 21:53:11,027 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-03-13 21:53:11,069 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-03-13 21:53:11,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 18 of 18 statements. [2025-03-13 21:53:11,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:11,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:11,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-13 21:53:11,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:11,122 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:11,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:11,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:11,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138182288] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:11,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:11,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-13 21:53:11,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733381944] [2025-03-13 21:53:11,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:11,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-13 21:53:11,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:11,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-13 21:53:11,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-03-13 21:53:11,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:11,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 368 transitions, 7611 flow. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-03-13 21:53:11,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:11,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:11,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:11,901 INFO L124 PetriNetUnfolderBase]: 1057/2093 cut-off events. [2025-03-13 21:53:11,902 INFO L125 PetriNetUnfolderBase]: For 51496/51496 co-relation queries the response was YES. [2025-03-13 21:53:11,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18962 conditions, 2093 events. 1057/2093 cut-off events. For 51496/51496 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 13252 event pairs, 225 based on Foata normal form. 10/2102 useless extension candidates. Maximal degree in co-relation 18878. Up to 1283 conditions per place. [2025-03-13 21:53:11,917 INFO L140 encePairwiseOnDemand]: 13/20 looper letters, 274 selfloop transitions, 123 changer transitions 0/398 dead transitions. [2025-03-13 21:53:11,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 398 transitions, 8619 flow [2025-03-13 21:53:11,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-13 21:53:11,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-13 21:53:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 96 transitions. [2025-03-13 21:53:11,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2025-03-13 21:53:11,918 INFO L175 Difference]: Start difference. First operand has 261 places, 368 transitions, 7611 flow. Second operand 11 states and 96 transitions. [2025-03-13 21:53:11,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 398 transitions, 8619 flow [2025-03-13 21:53:12,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 398 transitions, 8427 flow, removed 26 selfloop flow, removed 8 redundant places. [2025-03-13 21:53:12,065 INFO L231 Difference]: Finished difference. Result has 260 places, 375 transitions, 7831 flow [2025-03-13 21:53:12,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7355, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=113, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=250, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=7831, PETRI_PLACES=260, PETRI_TRANSITIONS=375} [2025-03-13 21:53:12,066 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 239 predicate places. [2025-03-13 21:53:12,066 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 375 transitions, 7831 flow [2025-03-13 21:53:12,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 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-03-13 21:53:12,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:12,066 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:12,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-03-13 21:53:12,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-13 21:53:12,268 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:12,268 INFO L85 PathProgramCache]: Analyzing trace with hash -140778511, now seen corresponding path program 12 times [2025-03-13 21:53:12,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:12,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070721558] [2025-03-13 21:53:12,268 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:53:12,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:12,272 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:12,277 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:12,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:53:12,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-13 21:53:12,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070721558] [2025-03-13 21:53:12,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070721558] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:12,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245782292] [2025-03-13 21:53:12,339 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-13 21:53:12,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:12,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:12,341 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-03-13 21:53:12,342 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-03-13 21:53:12,387 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:12,403 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:12,403 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-13 21:53:12,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:12,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-13 21:53:12,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:12,443 INFO L378 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-03-13 21:53:12,684 INFO L349 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2025-03-13 21:53:12,685 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 40 [2025-03-13 21:53:12,704 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:12,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:13,036 INFO L378 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 170 treesize of output 150 [2025-03-13 21:53:13,114 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:53:13,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 609 treesize of output 549 [2025-03-13 21:53:47,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:47,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245782292] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:47,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:47,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 25 [2025-03-13 21:53:47,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958034097] [2025-03-13 21:53:47,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:47,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-13 21:53:47,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:47,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-13 21:53:47,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2025-03-13 21:53:47,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:47,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 375 transitions, 7831 flow. Second operand has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-03-13 21:53:47,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:47,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:47,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:49,297 INFO L124 PetriNetUnfolderBase]: 1975/3517 cut-off events. [2025-03-13 21:53:49,297 INFO L125 PetriNetUnfolderBase]: For 92648/92648 co-relation queries the response was YES. [2025-03-13 21:53:49,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33766 conditions, 3517 events. 1975/3517 cut-off events. For 92648/92648 co-relation queries the response was YES. Maximal size of possible extension queue 245. Compared 22095 event pairs, 31 based on Foata normal form. 46/3561 useless extension candidates. Maximal degree in co-relation 33683. Up to 1495 conditions per place. [2025-03-13 21:53:49,325 INFO L140 encePairwiseOnDemand]: 11/20 looper letters, 383 selfloop transitions, 455 changer transitions 6/845 dead transitions. [2025-03-13 21:53:49,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 845 transitions, 18221 flow [2025-03-13 21:53:49,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-13 21:53:49,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-13 21:53:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 386 transitions. [2025-03-13 21:53:49,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.41956521739130437 [2025-03-13 21:53:49,327 INFO L175 Difference]: Start difference. First operand has 260 places, 375 transitions, 7831 flow. Second operand 46 states and 386 transitions. [2025-03-13 21:53:49,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 845 transitions, 18221 flow [2025-03-13 21:53:49,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 845 transitions, 17862 flow, removed 25 selfloop flow, removed 7 redundant places. [2025-03-13 21:53:49,640 INFO L231 Difference]: Finished difference. Result has 310 places, 679 transitions, 15734 flow [2025-03-13 21:53:49,640 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=7523, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=15734, PETRI_PLACES=310, PETRI_TRANSITIONS=679} [2025-03-13 21:53:49,641 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 289 predicate places. [2025-03-13 21:53:49,641 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 679 transitions, 15734 flow [2025-03-13 21:53:49,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 5.12) internal successors, (128), 25 states have internal predecessors, (128), 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-03-13 21:53:49,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:49,641 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:49,647 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-03-13 21:53:49,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:49,841 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:49,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:49,842 INFO L85 PathProgramCache]: Analyzing trace with hash 2002364096, now seen corresponding path program 2 times [2025-03-13 21:53:49,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:49,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444185353] [2025-03-13 21:53:49,842 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:49,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:49,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:49,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:49,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:49,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:50,800 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:50,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444185353] [2025-03-13 21:53:50,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444185353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:50,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413078724] [2025-03-13 21:53:50,801 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 21:53:50,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:50,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:50,803 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-03-13 21:53:50,805 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-03-13 21:53:50,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:50,861 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:50,861 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:53:50,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:50,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-13 21:53:50,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:51,090 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:53:51,090 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 20 [2025-03-13 21:53:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:53:51,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:51,333 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-13 21:53:51,334 INFO L378 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-03-13 21:53:51,384 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-13 21:53:51,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2025-03-13 21:53:51,416 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:51,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413078724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:51,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 27 [2025-03-13 21:53:51,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560170884] [2025-03-13 21:53:51,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:51,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-13 21:53:51,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:51,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-13 21:53:51,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=669, Unknown=0, NotChecked=0, Total=756 [2025-03-13 21:53:51,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:51,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 679 transitions, 15734 flow. Second operand has 28 states, 28 states have (on average 4.75) internal successors, (133), 28 states have internal predecessors, (133), 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-03-13 21:53:51,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:51,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:51,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:53,425 INFO L124 PetriNetUnfolderBase]: 2122/3786 cut-off events. [2025-03-13 21:53:53,427 INFO L125 PetriNetUnfolderBase]: For 105973/105973 co-relation queries the response was YES. [2025-03-13 21:53:53,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38777 conditions, 3786 events. 2122/3786 cut-off events. For 105973/105973 co-relation queries the response was YES. Maximal size of possible extension queue 282. Compared 24231 event pairs, 80 based on Foata normal form. 6/3790 useless extension candidates. Maximal degree in co-relation 38679. Up to 3118 conditions per place. [2025-03-13 21:53:53,459 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 651 selfloop transitions, 174 changer transitions 19/845 dead transitions. [2025-03-13 21:53:53,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 845 transitions, 20002 flow [2025-03-13 21:53:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 21:53:53,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 21:53:53,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 239 transitions. [2025-03-13 21:53:53,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42678571428571427 [2025-03-13 21:53:53,461 INFO L175 Difference]: Start difference. First operand has 310 places, 679 transitions, 15734 flow. Second operand 28 states and 239 transitions. [2025-03-13 21:53:53,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 845 transitions, 20002 flow [2025-03-13 21:53:53,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 845 transitions, 18821 flow, removed 409 selfloop flow, removed 11 redundant places. [2025-03-13 21:53:53,904 INFO L231 Difference]: Finished difference. Result has 335 places, 756 transitions, 16942 flow [2025-03-13 21:53:53,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=14645, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=524, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=16942, PETRI_PLACES=335, PETRI_TRANSITIONS=756} [2025-03-13 21:53:53,905 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 314 predicate places. [2025-03-13 21:53:53,905 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 756 transitions, 16942 flow [2025-03-13 21:53:53,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.75) internal successors, (133), 28 states have internal predecessors, (133), 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-03-13 21:53:53,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:53,905 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:53,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-13 21:53:54,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:54,106 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash 188106284, now seen corresponding path program 3 times [2025-03-13 21:53:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:54,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013494974] [2025-03-13 21:53:54,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:54,111 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:54,133 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:54,133 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:54,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013494974] [2025-03-13 21:53:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013494974] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:54,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1479464878] [2025-03-13 21:53:54,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-13 21:53:54,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:54,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:54,877 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-03-13 21:53:54,879 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-03-13 21:53:54,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:54,934 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:54,934 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-13 21:53:54,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:54,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-13 21:53:54,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:55,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:53:55,103 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 93 treesize of output 71 [2025-03-13 21:53:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:53:55,150 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:55,322 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-13 21:53:55,322 INFO L378 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-03-13 21:53:55,378 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-13 21:53:55,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2025-03-13 21:53:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1479464878] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:55,410 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 8] total 26 [2025-03-13 21:53:55,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386591404] [2025-03-13 21:53:55,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:55,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:53:55,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:55,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:53:55,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:53:55,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:55,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 756 transitions, 16942 flow. Second operand has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 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-03-13 21:53:55,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:55,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:55,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:53:56,761 INFO L124 PetriNetUnfolderBase]: 2146/3834 cut-off events. [2025-03-13 21:53:56,761 INFO L125 PetriNetUnfolderBase]: For 110310/110310 co-relation queries the response was YES. [2025-03-13 21:53:56,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38826 conditions, 3834 events. 2146/3834 cut-off events. For 110310/110310 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 24789 event pairs, 92 based on Foata normal form. 1/3835 useless extension candidates. Maximal degree in co-relation 38721. Up to 3342 conditions per place. [2025-03-13 21:53:56,795 INFO L140 encePairwiseOnDemand]: 10/20 looper letters, 696 selfloop transitions, 124 changer transitions 14/835 dead transitions. [2025-03-13 21:53:56,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 835 transitions, 19534 flow [2025-03-13 21:53:56,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-13 21:53:56,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-13 21:53:56,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 196 transitions. [2025-03-13 21:53:56,796 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4260869565217391 [2025-03-13 21:53:56,796 INFO L175 Difference]: Start difference. First operand has 335 places, 756 transitions, 16942 flow. Second operand 23 states and 196 transitions. [2025-03-13 21:53:56,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 835 transitions, 19534 flow [2025-03-13 21:53:57,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 835 transitions, 19198 flow, removed 136 selfloop flow, removed 9 redundant places. [2025-03-13 21:53:57,265 INFO L231 Difference]: Finished difference. Result has 352 places, 771 transitions, 17307 flow [2025-03-13 21:53:57,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=16622, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=756, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=17307, PETRI_PLACES=352, PETRI_TRANSITIONS=771} [2025-03-13 21:53:57,265 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 331 predicate places. [2025-03-13 21:53:57,265 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 771 transitions, 17307 flow [2025-03-13 21:53:57,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 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-03-13 21:53:57,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:53:57,266 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:53:57,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-13 21:53:57,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-13 21:53:57,466 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:53:57,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:53:57,467 INFO L85 PathProgramCache]: Analyzing trace with hash 111245504, now seen corresponding path program 4 times [2025-03-13 21:53:57,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:53:57,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193013200] [2025-03-13 21:53:57,467 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:57,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:53:57,471 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:57,482 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:57,482 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:57,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:57,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:53:57,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:53:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193013200] [2025-03-13 21:53:57,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193013200] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:53:57,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121182233] [2025-03-13 21:53:57,958 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-13 21:53:57,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:53:57,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:53:57,960 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-03-13 21:53:57,961 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-03-13 21:53:58,001 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:53:58,013 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:53:58,013 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-13 21:53:58,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:53:58,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-13 21:53:58,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:53:58,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:53:58,169 INFO L378 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2025-03-13 21:53:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:53:58,172 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:53:58,394 INFO L349 Elim1Store]: treesize reduction 10, result has 84.6 percent of original size [2025-03-13 21:53:58,394 INFO L378 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 74 [2025-03-13 21:53:58,435 INFO L349 Elim1Store]: treesize reduction 74, result has 29.5 percent of original size [2025-03-13 21:53:58,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 61 [2025-03-13 21:53:58,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:53:58,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121182233] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:53:58,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:53:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 8] total 26 [2025-03-13 21:53:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545950528] [2025-03-13 21:53:58,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:53:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:53:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:53:58,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:53:58,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2025-03-13 21:53:58,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:53:58,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 771 transitions, 17307 flow. Second operand has 27 states, 27 states have (on average 4.814814814814815) internal successors, (130), 27 states have internal predecessors, (130), 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-03-13 21:53:58,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:53:58,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:53:58,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:54:00,198 INFO L124 PetriNetUnfolderBase]: 2159/3855 cut-off events. [2025-03-13 21:54:00,198 INFO L125 PetriNetUnfolderBase]: For 118413/118413 co-relation queries the response was YES. [2025-03-13 21:54:00,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39499 conditions, 3855 events. 2159/3855 cut-off events. For 118413/118413 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 24971 event pairs, 91 based on Foata normal form. 4/3859 useless extension candidates. Maximal degree in co-relation 39390. Up to 3327 conditions per place. [2025-03-13 21:54:00,245 INFO L140 encePairwiseOnDemand]: 9/20 looper letters, 697 selfloop transitions, 145 changer transitions 19/862 dead transitions. [2025-03-13 21:54:00,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 862 transitions, 19921 flow [2025-03-13 21:54:00,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-13 21:54:00,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-03-13 21:54:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 243 transitions. [2025-03-13 21:54:00,247 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43392857142857144 [2025-03-13 21:54:00,247 INFO L175 Difference]: Start difference. First operand has 352 places, 771 transitions, 17307 flow. Second operand 28 states and 243 transitions. [2025-03-13 21:54:00,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 862 transitions, 19921 flow [2025-03-13 21:54:00,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 862 transitions, 19674 flow, removed 54 selfloop flow, removed 14 redundant places. [2025-03-13 21:54:00,797 INFO L231 Difference]: Finished difference. Result has 369 places, 780 transitions, 17606 flow [2025-03-13 21:54:00,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=20, PETRI_DIFFERENCE_MINUEND_FLOW=17060, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=771, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=135, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=17606, PETRI_PLACES=369, PETRI_TRANSITIONS=780} [2025-03-13 21:54:00,798 INFO L279 CegarLoopForPetriNet]: 21 programPoint places, 348 predicate places. [2025-03-13 21:54:00,798 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 780 transitions, 17606 flow [2025-03-13 21:54:00,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.814814814814815) internal successors, (130), 27 states have internal predecessors, (130), 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-03-13 21:54:00,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:54:00,798 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:54:00,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-03-13 21:54:00,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-13 21:54:00,999 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-13 21:54:01,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:54:01,000 INFO L85 PathProgramCache]: Analyzing trace with hash 932808782, now seen corresponding path program 5 times [2025-03-13 21:54:01,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:54:01,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160837695] [2025-03-13 21:54:01,000 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:54:01,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:54:01,004 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:54:01,017 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:54:01,017 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:01,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:01,341 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:54:01,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:54:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160837695] [2025-03-13 21:54:01,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160837695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 21:54:01,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908796137] [2025-03-13 21:54:01,341 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-13 21:54:01,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 21:54:01,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:54:01,343 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-03-13 21:54:01,343 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-03-13 21:54:01,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-03-13 21:54:01,418 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-03-13 21:54:01,419 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 21:54:01,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:54:01,419 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-13 21:54:01,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 21:54:01,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:54:01,567 INFO L378 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 105 treesize of output 75 [2025-03-13 21:54:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 21:54:01,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 21:54:06,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-13 21:54:06,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 127 treesize of output 152 [2025-03-13 21:54:06,350 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 21:54:06,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908796137] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 21:54:06,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 21:54:06,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 9] total 26 [2025-03-13 21:54:06,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355391579] [2025-03-13 21:54:06,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 21:54:06,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-13 21:54:06,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:54:06,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-13 21:54:06,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=600, Unknown=1, NotChecked=0, Total=702 [2025-03-13 21:54:06,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 20 [2025-03-13 21:54:06,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 780 transitions, 17606 flow. Second operand has 27 states, 27 states have (on average 4.703703703703703) internal successors, (127), 27 states have internal predecessors, (127), 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-03-13 21:54:06,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:54:06,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 20 [2025-03-13 21:54:06,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand